| Password-Authenticated Key Exchange Based on RSA | 83 | 4.37 | 2010 |
| Threshold Password-Authenticated Key Exchange | 85 | 3.02 | 2006 |
| Universally composable password-based key exchange | 122 | 3.39 | 2005 |
| Two-party generation of DSA signatures | 42 | 4.06 | 2004 |
| Efficient and Universally Composable Committed Oblivious Transfer and Applications. | 19 | 1.21 | 2004 |
| Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract) | 15 | 0.84 | 2004 |
| On Simulation-Sound Trapdoor Commitments. | 51 | 2.54 | 2004 |
| An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack | 8 | 0.86 | 2003 |
| Delegation of cryptographic servers for capture-resilient devices | 22 | 2.45 | 2003 |
| Automatic generation of two-party computations | 24 | 1.37 | 2003 |
| Adaptively secure distributed public-key systems | 23 | 1.11 | 2002 |
| Adaptive Security for the Additive-Sharing Based Proactive RSA | 17 | 0.72 | 2001 |
| An Improved Stability Bound for Binary Exponential Backoff. | 20 | 1.92 | 2001 |
| More Efficient Password-Authenticated Key Exchange | 29 | 2.45 | 2001 |
| Networked Cryptographic Devices Resilient to Capture | 52 | 3.60 | 2001 |
| Efficient and Fresh Cerification | 33 | 2.60 | 2000 |
| Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions | 70 | 2.18 | 2000 |
| Binary Exponential Backoff Is Stable for High Arrival Rates | 10 | 1.54 | 2000 |
| "Psyeudorandom Intermixing": A Tool for Shared Cryptography | 2 | 0.40 | 2000 |
| Contention resolution with constant expected delay | 36 | 1.12 | 2000 |
| Abuse-Free Multi-party Contract Signing | 32 | 1.50 | 1999 |
| Secure and lightweight advertising on the Web | 22 | 1.50 | 1999 |
| Adaptively-Secure Optimal-Resilience Proactive RSA | 22 | 0.91 | 1999 |
| Anonymous Investing: Hiding the Identities of Stockholders | 5 | 0.55 | 1999 |
| Abuse-Free Optimistic Contract Signing | 140 | 5.79 | 1999 |
| Adaptively-secure distributed public-key systems | 2 | 0.36 | 1999 |
| Computational bounds for fundamental problems on general-purpose parallel models | 6 | 0.44 | 1998 |
| An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks | 2 | 0.37 | 1998 |
| Contention resolution with guaranteed constant expected delay | 7 | 0.67 | 1997 |
| The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms | 1 | 0.36 | 1997 |
| Proactive RSA. | 79 | 9.72 | 1997 |
| Mis-representation of Identities in E-cash Schemes and how to Prevent it | 12 | 1.30 | 1996 |
| Analysis of practical backoff protocols for contention resolution with multiple servers | 29 | 3.55 | 1996 |
| ERCW PRAMs and optical communication | 7 | 0.48 | 1996 |
| Lower bounds for randomized exclusive write PRAMs | 10 | 0.87 | 1995 |
| An W(log log n) Lower Bound for Routing in Optical Networks. | 0 | 0.34 | 1994 |
| Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs | 5 | 0.53 | 1993 |
| A Lower Bound For Order-Preserving Broadcast In The Postal Model | 1 | 1.49 | 1993 |
| Load balancing requires &OHgr;(log*n) expected time | 6 | 0.53 | 1992 |
| Ultra-fast expected time parallel algorithms | 20 | 1.16 | 1991 |
