Buch, Englisch, Band 16545, 642 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 990 g
45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Rome, Italy, May 10-14, 2026, Proceedings, Part V
Buch, Englisch, Band 16545, 642 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 990 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-25329-3
Verlag: Springer
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
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung
- Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung Netzwerksicherheit
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Angewandte Informatik
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
Weitere Infos & Material
.- 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.
