1 option
Progress in Cryptology – INDOCRYPT 2023 : 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II / edited by Anupam Chattopadhyay, Shivam Bhasin, Stjepan Picek, Chester Rebeiro.
Springer Nature - Springer Computer Science eBooks 2024 English International Available online
View online- Format:
- Book
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 14460
- Language:
- English
- Subjects (All):
- Cryptography.
- Data encryption (Computer science).
- Computer science--Mathematics.
- Computer science.
- Artificial intelligence.
- Cryptology.
- Mathematics of Computing.
- Artificial Intelligence.
- Theory of Computation.
- Local Subjects:
- Cryptology.
- Mathematics of Computing.
- Artificial Intelligence.
- Theory of Computation.
- Physical Description:
- 1 online resource (277 pages)
- Edition:
- 1st ed. 2024.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
- Summary:
- The two-volume proceedings constitutes the refereed proceedings of the 24th International Conference on Progress in Cryptology, INDOCRYPT 2023, Goa, India, in December 2023. The 26 full papers were carefully reviewed and selected from 74 submissions. They are organized in topical sections as follows: Part I: Symmetric-key cryptography, Hash functions, Authenticated Encryption Modes; Elliptic curves, Zero-knowledge proof, Signatures; Attacks. Part II: Secure computation, Algorithm hardness, Privacy; Post-quantum cryptography. .
- Contents:
- Secure computation, Algorithm hardness, Privacy
- Threshold-Optimal MPC With Friends and Foes
- Network-Agnostic Perfectly Secure Synchronous Message Transmission Revisited
- Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions
- Distributed Protocols for Oblivious Transfer and Polynomial Evaluation
- Obfuscating Decision Trees
- Privacy-Preserving Plagiarism Checking
- PURED: A unified framework for resource-hard functions
- Post-quantum cryptography
- Implementing Lattice-Based PQC on Resource-Constrained Processors: A Case Study for Kyber/Saber’s Polynomial Multiplication on ARM CortexM0/M0+
- Algorithmic Views of Vectorized Polynomial Multipliers – NTRU.
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 3-031-56235-6
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.