Progress in Cryptology ? INDOCRYPT 2023
24th International Conference on Cryptology in India, Goa, India, December 10?13, 2023, Proceedings, Part II
Series:
Lecture Notes in Computer Science;
14460;
Edition number: 2024
Publisher: Springer
Date of Publication: 29 March 2024
Number of Volumes: 1 pieces, Book
Normal price:
Publisher's listprice:
EUR 62.05
EUR 62.05
Your price:
20 483 (19 508 HUF + 5% VAT )
discount is: 20% (approx 5 121 HUF off)
Discount is valid until: 30 June 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
Click here to subscribe.
Availability:
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
Not in stock at Prospero.
Product details:
| ISBN13: | 9783031562341 |
| ISBN10: | 3031562348 |
| Binding: | Paperback |
| No. of pages: | 264 pages |
| Size: | 235x155 mm |
| Language: | English |
| Illustrations: | 20 Illustrations, black & white; 22 Illustrations, color |
| 699 |
Category:
System analysis, system planning
Data management in computer systems
Privacy, data security
Computing's and information technology's impact on society
System analysis, system planning (charity campaign)
Data management in computer systems (charity campaign)
Privacy, data security (charity campaign)
Computing's and information technology's impact on society (charity campaign)
Long description:
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.
Table of 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.