| Description |
1 online resource (xxii, 264 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science, 1611-3349 ; 14460 |
|
Lecture notes in computer science ; 14460. 1611-3349
|
| 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 |
| 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 One: Symmetric-key cryptography, Hash functions, Authenticated Encryption Modes; Elliptic curves, Zero-knowledge proof, Signatures; Attacks. Part Two: Secure computation, Algorithm hardness, Privacy; Post-quantum cryptography |
| Notes |
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed April 1, 2024) |
| Subject |
Cryptography -- Congresses
|
|
Data encryption (Computer science) -- Congresses
|
| Genre/Form |
Electronic books
|
| Form |
Electronic book
|
| Author |
Chattopadhyay, Anupam (Professor of computer science), editor.
|
|
Bhasin, Shivam, 1985- editor.
|
|
Picek, Stjepan, editor.
|
|
Rebeiro, Chester, editor.
|
| ISBN |
9783031562358 |
|
3031562356 |
|
