Advances in Cryptology – EUROCRYPT 2026
45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Rome, Italy, May 10–14, 2026, Proceedings, Part III
Series: Lecture Notes in Computer Science;
-
GET 12% OFF
- Publisher's listprice EUR 79.17
-
30 923 Ft (29 451 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 12% (cc. 3 711 Ft off)
- Discounted price 27 213 Ft (25 917 Ft + 5% VAT)
27 213 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Switzerland
- Date of Publication 7 May 2026
- ISBN 9783032253231
- Binding Paperback
- No. of pages606 pages
- Size 235x155 mm
- Language English
- Illustrations XXII, 606 p. 69 illus., 18 illus. in color. 700
Categories
Long description:
This seven-volume set, LNCS 16541-16547, constitutes the proceedings of the 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2026, held in Rome, Italy, during May 10–14, 2026.
The 142 papers included in these proceedings were carefully reviewed and selected from 675 submissions. They are organized in topical sections as follows:
Part I: Signatures; Quantum Cryptography
Part II: Applied Cryptography
Part III: Multi-Party Computation
Part IV: Post-Quantum Cryptography
Part V: Foundations
Part VI: Symmetric Cryptography and Related Techniques
Part VII: Zero-Knowledge; Hardware and Embedded Systems
Table of Contents:
.- Multi-Party Computation.
.- Traceable Secret Sharing Schemes for General Access Structures.
.- Traceable Secret Sharing Revisited.
.- Client-Server Homomorphic Secret Sharing in the CRS Model.
.- Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols.
.- Non-Interactive Secure Computation with Constant Communication Overhead.
.- On the Communication Complexity of PSM and CDS for Symmetric Functions.
.- Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation.
.- BitGC Made (More) Efficient.
.- Succinct Garbled Circuits with Low Depth Garbling Algorithms.
.- Zebra: Arithmetic Garbled RAM for Large Words from DCR.
.- Information-Theoretic Network-Agnostic MPC with Polynomial Communication.
.- Perfectly Secure Network-Agnostic MPC Comes for Free.
.- New Upper and Lower Bounds for Perfectly Secure MPC.
.- Optimal Good-Case Latency for Sleepy Consensus.
.- Round-Optimal Byzantine Agreement without Trusted Setup.
.- When Trying to Catch Cheaters Breaks the MPC: Breaking and Fixing Delayed Consistency Checks in Trident, Fantastic Four, SWIFT, and Quad.
.- Game Theory Does Not Always Help: The Case of Statistical Multi-Party Coin Tossing.
.- PUFF: Maximally Proactive Security for Free in Perfectly Secure MPC with Guaranteed Output Delivery.
.- Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph.
.- On Succinct Non-Interactive Secure Computation with Malicious Security.
