default search action
38th EUROCRYPT 2020: Zagreb, Croatia - Part I
- Anne Canteaut, Yuval Ishai:
Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12105, Springer 2020, ISBN 978-3-030-45720-4
Invited Talk
- Alice Silverberg:
Mathematics and Cryptography: A Marriage of Convenience? - Invited Talk. 3-9
Best Paper Awards
- Shweta Agrawal, Shota Yamada:
Optimal Broadcast Encryption from Pairings and LWE. 13-43 - Henry Corrigan-Gibbs, Dmitry Kogan:
Private Information Retrieval with Sublinear Online Time. 44-75
Obfuscation and Functional Encryption
- Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Candidate iO from Homomorphic Encryption Schemes. 79-109 - Shweta Agrawal, Alice Pellet-Mary:
Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE. 110-140 - Aayush Jain, Nathan Manohar, Amit Sahai:
Combiners for Functional Encryption, Unconditionally. 141-168 - Akin Ünal:
Impossibility Results for Lattice-Based Functional Encryption Schemes. 169-199
Symmetric Cryptanalysis
- Mridul Nandi:
Mind the Composition: Birthday Bound Attacks on EWCDMD and SoKAC21. 203-220 - Antonio Flórez-Gutiérrez, María Naya-Plasencia:
Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT. 221-249 - Orr Dunkelman, Nathan Keller, Noam Lasry, Adi Shamir:
New Slide Attacks on Almost Self-similar Ciphers. 250-279 - Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir:
The Retracing Boomerang Attack. 280-309
Randomness Extraction
- Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. 313-342 - Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. 343-372 - Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Low Error Efficient Computational Extractors in the CRS Model. 373-402
Symmetric Cryptography I
- Itai Dinur:
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications. 405-434 - Seongkwang Kim, ByeongHak Lee, Jooyoung Lee:
Tight Security Bounds for Double-Block Hash-then-Sum MACs. 435-465 - Yonglin Hao, Gregor Leander, Willi Meier, Yosuke Todo, Qingju Wang:
Modeling for Three-Subset Division Property Without Unknown Subset - Improved Cube Attacks Against Trivium and Grain-128AEAD. 466-495
Secret Sharing
- Ronald Cramer, Chaoping Xing:
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. 499-528 - Amos Beimel, Hussien Othman:
Evolving Ramp Secret Sharing with a Small Gap. 529-555 - Jesper Buus Nielsen, Mark Simkin:
Lower Bounds for Leakage-Resilient Secret Sharing. 556-577
Fault-Attack Security
- Thierry Simon, Lejla Batina, Joan Daemen, Vincent Grosso, Pedro Maat Costa Massolino, Kostas Papagiannopoulos, Francesco Regazzoni, Niels Samwel:
Friet: An Authenticated Encryption Scheme with Built-in Fault Detection. 581-611 - Sayandeep Saha, Arnab Bag, Debapriya Basu Roy, Sikhar Patranabis, Debdeep Mukhopadhyay:
Fault Template Attacks on Block Ciphers Exploiting Fault Propagation. 612-643 - Diego F. Aranha, Claudio Orlandi, Akira Takahashi, Greg Zaverucha:
Security of Hedged Fiat-Shamir Signatures Under Fault Attacks. 644-674
Succinct Proofs
- Benedikt Bünz, Ben Fisch, Alan Szepieniec:
Transparent SNARKs from DARK Compilers. 677-706 - Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. 707-737 - Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Psi Vesely, Nicholas P. Ward:
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. 738-768 - Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-quantum and Transparent Recursive Proofs from Holography. 769-793
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.