default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th EUROCRYPT 2021: Zagreb, Croatia - Part II
- Anne Canteaut
, François-Xavier Standaert:
Advances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part II. Lecture Notes in Computer Science 12697, Springer 2021, ISBN 978-3-030-77885-9
Symmetric Designs
- Christoph Dobraunig, Lorenzo Grassi, Anna Guinet, Daniël Kuijsters:
Ciminion: Symmetric Encryption Based on Toffoli-Gates over Large Finite Fields. 3-34 - Nathan Keller, Asaf Rosemarin:
Mind the Middle Layer: The HADES Design Strategy Revisited. 35-63 - Pooya Farshim, Stefano Tessaro:
Password Hashing and Preprocessing. 64-91 - Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy:
Compactness of Hashing Modes and Efficiency Beyond Merkle Tree. 92-123
Real-World Cryptanalysis
- Ohad Amon, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir:
Three Third Generation Attacks on the Format Preserving Encryption Scheme FF3. 127-154 - Christof Beierle, Patrick Derbez, Gregor Leander, Gaëtan Leurent, Håvard Raddum, Yann Rotella, David Rupprecht, Lukas Stennes:
Cryptanalysis of the GPRS Encryption Algorithms GEA-1 and GEA-2. 155-183
Implementation Issues
- Wei Yu, Guangwu Xu:
Pre-computation Scheme of Window τNAF for Koblitz Curves Revisited. 187-218 - Alex Biryukov, Aleksei Udovenko:
Dummy Shuffling Against Algebraic Attacks in White-Box Implementations. 219-248 - Léo Ducas, Marc Stevens, Wessel P. J. van Woerden:
Advanced Lattice Sieving on GPUs, with Tensor Cores. 249-279
Masking and Secret-Sharing
- Nicolas Bordes, Pierre Karpman:
Fast Verification of Masking Schemes in Characteristic Two. 283-312 - Sonia Belaïd, Matthieu Rivain, Abdul Rahman Taleb:
On the Power of Expansion: More Efficient Constructions in the Random Probing Model. 313-343 - Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages. 344-374
Leakage, Faults and Tampering
- Christoph Dobraunig, Bart Mennink:
Leakage Resilient Value Comparison with Application to Message Authentication. 377-407 - Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. 408-437 - Pierre-Louis Cayrel, Brice Colombier, Vlad-Florin Dragoi, Alexandre Menu, Lilian Bossuet:
Message-Recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem. 438-467 - Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu:
Multi-source Non-malleable Extractors and Applications. 468-497
Quantum Constructions and Proofs
- Prabhanjan Ananth, Rolando L. La Placa:
Secure Software Leasing. 501-530 - Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer Is in MiniQCrypt. 531-561 - Bhaskar Roberts:
Security Analysis of Quantum Lightning. 562-567 - Takashi Yamakawa, Mark Zhandry:
Classical vs Quantum Random Oracles. 568-597 - Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. 598-629 - Thomas Vidick, Tina Zhang:
Classical Proofs of Quantum Knowledge. 630-660
Multiparty Computation
- Gabrielle Beck, Aarushi Goel, Abhishek Jain, Gabriel Kaptchuk:
Order-C Secure Multiparty Computation for Highly Repetitive Circuits. 663-693 - S. Dov Gordon, Daniel Starin, Arkady Yerukhimovich:
The More the Merrier: Reducing the Cost of Large Scale MPC. 694-723 - Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-interactive Secure Computation from LWE. 724-753 - Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Unbounded Multi-party Computation from Learning with Errors. 754-781 - Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. 782-811 - Antigoni Polychroniadou, Yifan Song:
Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields. 812-841 - Geoffroy Couteau, Pierre Meyer:
Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPN. 842-870 - Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, Mayank Rathee:
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. 871-900 - Peter Rindal, Phillipp Schoppmann:
VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE. 901-930
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.
last updated on 2025-02-10 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
