Buch, Englisch, 486 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 762 g
44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4-8, 2025, Proceedings, Part V
Buch, Englisch, 486 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 762 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-91091-3
Verlag: Springer Nature Switzerland
This eight-volume set, LNCS 15601-15608, constitutes the proceedings of the 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025, held in Madrid, Spain, during May 4–8, 2025.
The 123 papers included in these proceedings were carefully reviewed and selected from 602 submissions. They are organized in topical sections as follows:
Part I: Secure Multiparty Computation I
Part II: Public-Key Cryptography and Key-Exchange
Part III: Advanced Cryptographic Schemes
Part IV: (Non-)Interactive Proofs and Zero-Knowledge
Part V: Secure Multiparty Computation II
Part VI: MPC II: Private Information Retrieval and Garbling; Algorithms and Attacks
Part VII: Theoretical Foundations
Part VIII: Real-World Cryptography
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Angewandte Informatik
- Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung Netzwerksicherheit
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
Weitere Infos & Material
Secure Multiparty Computation II: Multi-key Homomorphic Secret Sharing.- Disincentivize Collusion in Veri able Secret Sharing.- Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement.- MiniCast: Minimizing the Communication Complexity of Reliable Broadcast.- Asymptotically Optimal Early Termination for Dishonest Majority Broadcast.- Efficient Pseudorandom Correlation Generators for Any Finite Field.- Efficient Distributed Randomness Generation from Minimal Assumptions where PArties Speak Sequentially Once.- Simultaneous-Message and Succinct Secure Computation.- Efficient Multiparty Private Simultaneous Messages for Symmetric Functions.- MPC with Publicly Identi able Abort from Pseudorandomness and Homomorphic Encryption.- The Complexity of Memory Checking with Covert Security.- Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions.- Black-Box Constant-Round Secure 2PC with Succinct Communication.- Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries.- Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC.- Honest Majority MPC with (||) Communication in Minicrypt.
