| year | title | booktitle | pages |
|---|
| 1 | 2012 | An Enciphering Scheme Based on a Card Shuffle | crypto | 1-13 |
| 2 | 2011 | The Software Performance of Authenticated-Encryption Modes | fse | 306 |
| 3 | 2011 | Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings | crypto | |
| 4 | 2010 | On Generalized Feistel Networks | crypto | 613-630 |
| 5 | 2010 | An Analysis of the Blockcipher-Based Hash Functions from PGV | jofc | 519-545 |
| 6 | 2010 | On generalized Feistel networks | eprint | online |
| 7 | 2009 | How to Encipher Messages on a Small Domain | crypto | 286-302 |
| 8 | 2008 | Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers | crypto | 433-450 |
| 9 | 2008 | Security/Efficiency Tradeoffs for Permutation-Based Hashing | eurocrypt | 220-236 |
| 10 | 2007 | How to Enrich the Message Space of a Cipher | eprint | online |
| 11 | 2007 | Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) | jofc | 395 |
| 12 | 2007 | How to Enrich the Message Space of a Cipher | fse | 101-118 |
| 13 | 2006 | Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys | eprint | online |
| 14 | 2006 | Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals | eprint | online |
| 15 | 2006 | A Provable-Security Treatment of the Key-Wrap Problem | eurocrypt | online |
| 16 | 2006 | Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem | eprint | online |
| 17 | 2006 | The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs | eurocrypt | online |
| 18 | 2005 | CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions | jofc | 111-131 |
| 19 | 2005 | Improved Security Analyses for CBC MACs | crypto | online |
| 20 | 2004 | Code-Based Game-Playing Proofs and the Security of Triple Encryption | eprint | online |
| 21 | 2004 | Nonce-Based Symmetric Encryption | fse | 348-359 |
| 22 | 2004 | Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance | fse | 371-388 |
| 23 | 2004 | Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC | asiacrypt | online |
| 24 | 2004 | The EAX Mode of Operation | fse | 389-407 |
| 25 | 2004 | Cryptographic Hash-Function Basics: Definitions, Implications and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance | eprint | online |
| 26 | 2003 | EAX: A Conventional Authenticated-Encryption Mode | eprint | online |
| 27 | 2003 | A Critique of CCM | eprint | online |
| 28 | 2003 | A Parallelizable Enciphering Mode | eprint | online |
| 29 | 2003 | A Tweakable Enciphering Mode | eprint | online |
| 30 | 2003 | A Tweakable Enciphering Mode | crypto | online |
| 31 | 2002 | A Block-Cipher Mode of Operation for Parallelizable Message Authentication | eurocrypt | online |
| 32 | 2002 | Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV | eprint | online |
| 33 | 2002 | Encryption-Scheme Security in the Presence of Key-Dependent Messages | eprint | online |
| 34 | 2002 | Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV | crypto | online |
| 35 | 2002 | The EMD Mode of Operation (A Tweaked, Wide-Blocksize, Strong PRP) | eprint | online |
| 36 | 2002 | Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) | jofc | 103-127 |
| 37 | 2001 | How to Protect DES Against Exhaustive Key Search (an Analysis of DESX) | jofc | 17-35 |
| 38 | 2001 | Ciphers with Arbitrary Finite Domains | eprint | online |
| 39 | 2001 | OCB Mode | eprint | online |
| 40 | 2001 | A Block-Cipher Mode of Operation for Parallelizable Message Authentication | eprint | online |
| 41 | 2000 | Authenticated Key Exchange Secure against Dictionary Attacks | eurocrypt | 139-155 |
| 42 | 2000 | Authenticated Key Exchange Secure Against Dictionary Attacks | eprint | online |
| 43 | 2000 | CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions | crypto | 197-215 |
| 44 | 2000 | Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography | asiacrypt | 317-330 |
| 45 | 1999 | DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem | eprint | online |
| 46 | 1999 | UMAC: Fast and Secure Message Authentication | crypto | 216-233 |
| 47 | 1999 | On the Construction of Variable-Input-Length Ciphers | fse | 231-244 |
| 48 | 1999 | Bucket Hashing and Its Application to Fast Message Authentication | jofc | 91-115 |
| 49 | 1998 | Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible | eurocrypt | 266-280 |
| 50 | 1998 | Relations among Notions of Security for Public-Key Encryption Schemes | eprint | online |
| 51 | 1998 | Relations Among Notions of Security for Public-Key Encryption Schemes | crypto | 26-45 |
| 52 | 1998 | A Software-Optimized Encryption Algorithm | jofc | 273-287 |
| 53 | 1997 | Collision-Resistant Hashing: Towards Making UOWHFs Practical | crypto | 470-484 |
| 54 | 1997 | Locally Random Reductions: Improvements and Applications | jofc | 17-36 |
| 55 | 1996 | How to Protect DES Against Exhaustive Key Search | crypto | 252-267 |
| 56 | 1996 | The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin | eurocrypt | 399-416 |
| 57 | 1995 | Bucket Hashing and its Application to Fast Message Authentication | crypto | 29-42 |
| 58 | 1995 | XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions | crypto | 15-28 |
| 59 | 1994 | Optimal Asymmetric Encryption | eurocrypt | 92-111 |
| 60 | 1994 | The Security of Cipher Block Chaining | crypto | 341-358 |
| 61 | 1993 | A Software-Optimised Encryption Algorithm | fse | 56-63 |
| 62 | 1993 | Entity Authentication and Key Distribution | crypto | 232-249 |
| 63 | 1991 | Secure Computation (Abstract) | crypto | 392-404 |
| 64 | 1990 | Security with Low Communication Overhead | crypto | 62-76 |
| 65 | 1988 | Everything Provable is Provable in Zero-Knowledge | crypto | 37-56 |
