Beat the rise! Delivery fees are going up soon.

Close Notification

Your cart does not contain any items

Advances in Cryptology – EUROCRYPT 2026

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?

QTY:

English
Springer Nature Switzerland AG
07 May 2026
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:   ,
Imprint:   Springer Nature Switzerland AG
Country of Publication:   Switzerland
Dimensions:   Height: 235mm,  Width: 155mm, 
ISBN:   9783032253293
ISBN 10:   3032253292
Series:   Lecture Notes in Computer Science
Pages:   642
Publication Date:  
Audience:   Professional and scholarly ,  College/higher education ,  Undergraduate ,  Further / Higher Education
Format:   Paperback
Publisher's Status:   Active
.- Foundations. .- Impossibility of VDFs in the ROM: The Complete Picture. .- Separating Verifiable Delay Functions and Time-Lock Puzzles. .- Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space. .- The Structured Generic-Group Model. .- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols. .- Lower Bounds on the Overhead of Indistinguishability Obfuscation. .- Lower Bounding Update Frequency in Short Accumulators and Vector Commitments. .- Improved Search-to-Decision Reduction for Random Local Functions. .- Fair Multiparty Coin Tossing from Minimal Assumptions. .- Resizable Oblivious RAM. .- The Malice of ELFs: Practical Anamorphic-Resistant Encryption without Random Oracles. .- Distributed Monotone-Policy Encryption for DNFs from Lattices. .- Oblivious Ciphertext Compression via Linear Codes. .- Lattice EPID with Efficient Revocation. .- Partial Fraction Techniques for Cryptography. .- DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using SPHINCS+. .- Optimal Threshold Traitor Tracing. .- Silent Threshold Cryptography from Pairings: Expressive Policies in the Plain Model. .- Threshold Batched Identity-Based Encryption from Pairings in the Plain Model. .- Look Ahead! Practical CCA-secure Steganography: Cover-Source Switching meets Lattice Gaussian Sampling. .- Fully Asymmetric Anamorphic Homomorphic Encryption from LWE.

See Also