Advances in Cryptology – EUROCRYPT 2026: 45th Annual International Conference on the Theory and Applications...

— —

Joan Daemen Emmanuel Thomé

Advances in Cryptology – EUROCRYPT 2026

Name: Advances in Cryptology – EUROCRYPT 2026
Price: 153.86 AUD
Availability: OutOfStock
ISBN: 9783032253231

45th Annual International Conference on the Theory and Applications of Cryptographic Techniques,...

Joan Daemen, Emmanuel Thomé

$191.95 $153.86

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We will update you on expected arrival time to us. If this delay is too long, please let us know within 2 business days and we can give you options regarding cancelling or adjusting your order. More details on cancelling your order can be found in our Terms of Trade.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer Nature Switzerland AG
07 May 2026

Coding theory & cryptology; Computing: general; Network hardware; Data encryption; Network security

Series: Lecture Notes in Computer Science

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

Edited by: Joan Daemen, Emmanuel Thomé
Imprint: Springer Nature Switzerland AG
Country of Publication: Switzerland
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783032253231
ISBN 10: 3032253233
Series: Lecture Notes in Computer Science
Pages: 606
Publication Date: 07 May 2026
Audience: Professional and scholarly , College/higher education , Undergraduate , Further / Higher Education
Format: Paperback
Publisher's Status: Active

.- Multi-Party Computation. .- Traceable Secret Sharing Schemes for General Access Structures. .- Linear-Communication ACSS with Guaranteed Termination and Lower Amortized Bound. .- 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.