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