| Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches | 2010/10/19 | English | 70 |
| Bonsai Trees, or How to Delegate a Lattice Basis | 2011/09/06 | English | 66 |
| Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups | 2003/07/11 | English | 65 |
| Linking information reconciliation and privacy amplification | 1997/03/01 | English | 62 |
| The Size of a Share Must Be Large | 1997/09/01 | English | 62 |
| On Probability of Success in Linear and Differential Cryptanalysis | 2007/09/14 | English | 61 |
| Constructive and destructive facets of Weil descent on elliptic curves | 2002/03/01 | English | 59 |
| Quark: A Lightweight Hash | 2012/05/10 | English | 57 |
| New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups | 2002/09/01 | English | 54 |
| Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography | 2005/05/03 | English | 54 |
| A construction of a cipher from a single pseudorandom permutation | 1997/06/01 | English | 54 |
| Security Proofs for Identity-Based Identification and Signature Schemes | 2008/08/22 | English | 54 |
| How To Construct Constant-Round Zero-Knowledge Proof Systems for NP | 1996/01/01 | | 54 |
| Secure Proxy Signature Schemes for Delegation of Signing Rights | 2010/10/16 | English | 53 |
| Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | 2012/02/01 | English | 51 |
| Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)* | 2002/01/01 | English | 51 |
| Updating Key Size Estimations for Pairings | 2018/01/29 | English | 50 |
| Secure Classical Bit Commitment Using Fixed Capacity Communication Channels | 2005/05/27 | English | 47 |
| Scalable Protocols for Authenticated Group Key Exchange | 2006/09/25 | English | 47 |
| Side-Channel Resistant Crypto for Less than 2,300 GE | 2010/10/27 | English | 47 |
| Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes | 2007/09/05 | English | 45 |
| The Insecurity of the Digital Signature Algorithm with Partially Known Nonces | 2002/06/01 | English | 44 |
| Efficient Implementation of Pairing-Based Cryptosystems | 2004/09/01 | English | 41 |
| Lattice Reduction: A Toolbox for the Cryptanalyst | 1998/06/01 | English | 41 |
| Efficient Selective Identity-Based Encryption Without Random Oracles | 2010/09/15 | English | 41 |
| Tweakable Block Ciphers | 2010/09/02 | English | 40 |
| Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries | 2009/04/07 | English | 40 |
| Dynamic Proofs of Retrievability Via Oblivious RAM | 2015/09/22 | English | 40 |
| Computationally Secure Oblivious Transfer | 2004/10/21 | English | 39 |
| A Forward-Secure Public-Key Encryption Scheme | 2007/02/06 | English | 39 |