Normal view MARC view ISBD view

Progress in Cryptology - INDOCRYPT 2023 [electronic resource] : 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.

Contributor(s): Chattopadhyay, Anupam [editor.] | Bhasin, Shivam [editor.] | Picek, Stjepan [editor.] | Rebeiro, Chester [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 14460Publisher: Cham : Springer Nature Switzerland : Imprint: Springer, 2024Edition: 1st ed. 2024.Description: XXII, 264 p. 42 illus., 22 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031562358.Subject(s): Cryptography | Data encryption (Computer science) | Computer science -- Mathematics | Artificial intelligence | Computer science | Cryptology | Mathematics of Computing | Artificial Intelligence | Theory of ComputationAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.824 Online resources: Click here to access online
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.