| Implementing BP-Obfuscation Using Graph-Induced Encoding. | 7 | 0.43 | 2017 |
| Practical Chosen Ciphertext Secure Encryption from Factoring | 79 | 3.08 | 2013 |
| Practical and Employable Protocols for UC-Secure Circuit Evaluation over $Z_n$. | 0 | 0.34 | 2013 |
| A framework for practical universally composable zero-knowledge protocols | 22 | 0.72 | 2011 |
| A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack | 11 | 0.59 | 2010 |
| Simple and efficient public-key encryption from computational diffie-hellman in the standard model | 23 | 0.85 | 2010 |
| A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks | 94 | 2.66 | 2009 |
| Anonymous credentials on a standard java card | 81 | 3.23 | 2009 |
| The Twin Diffie–Hellman Problem and Applications | 140 | 4.10 | 2009 |
| Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs | 16 | 0.68 | 2008 |
| Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation | 34 | 1.48 | 2006 |
| Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography | 124 | 6.82 | 2005 |
| Optimistic asynchronous atomic broadcast | 17 | 0.92 | 2005 |
| Tag-KEM/DEM: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM | 89 | 3.54 | 2005 |
| Anonymous Identification in Ad Hoc Groups | 104 | 4.40 | 2004 |
| A Note on An Encryption Scheme of Kurosawa and Desmedt. | 32 | 2.00 | 2004 |
| A secure signature scheme from bilinear maps | 34 | 3.57 | 2003 |
| Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products | 66 | 3.60 | 2002 |
| Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption | 336 | 16.33 | 2002 |
| Secure and Efficient Asynchronous Broadcast Protocols | 83 | 3.67 | 2001 |
| Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack | 334 | 16.58 | 2001 |
| Algorithms for exponentiation in finite fields | 42 | 2.93 | 2000 |
| Using hash functions as a hedge against chosen ciphertext attack | 98 | 8.80 | 2000 |
| Optimistic fair Exchange of Digital Signatures. | 344 | 25.54 | 2000 |
| ACE: The Advanced Cryptographic Engine | 10 | 1.91 | 2000 |
| A Composition Theorem for Universal One-Way Hash Functions. | 48 | 3.62 | 2000 |
| Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract) | 69 | 4.99 | 2000 |
| Signature Schemes Based on the Strong RSA Assumption. | 253 | 17.52 | 2000 |
| Factorization in Z[x]: the searching phase | 8 | 0.83 | 2000 |
| On the Security of a Practical Identification Scheme | 35 | 4.54 | 1999 |
| Practical Threshold Signatures. | 286 | 23.43 | 1999 |
| Efficient computation of minimal polynomials in algebraic extensions of finite fields | 18 | 0.99 | 1999 |
| Asynchronous protocols for optimistic fair exchange | 183 | 9.32 | 1998 |
| A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. | 578 | 70.08 | 1998 |
| Securing Threshold Cryptosystems against Chosen Ciphertext Attack | 182 | 16.68 | 1998 |
| Lower bounds for discrete logarithms and related problems | 487 | 51.40 | 1997 |
| Fast polynomial factorization over high algebraic extensions of finite fields | 22 | 2.83 | 1997 |
| Session key distribution using smart cards | 42 | 4.15 | 1996 |
| A new polynomial factorization algorithm and its implementation | 47 | 3.71 | 1995 |
| Fast Construction of Irreducible Polynomials over Finite Fields | 64 | 4.69 | 1994 |
| Primality Testing with Fewer Random Bits | 4 | 0.57 | 1993 |
| Computing Frobenius Maps and Factoring Polynomials | 95 | 9.63 | 1992 |
| Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) | 0 | 0.34 | 1992 |
| A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic | 18 | 2.04 | 1991 |
| On the deterministic complexity of factoring polynomials over finite fields | 25 | 4.82 | 1990 |
| New algorithms for finding irreducible polynomials over finite fields | 84 | 15.38 | 1988 |
