| year | title | booktitle | pages |
|---|
| 1 | 2012 | Identifying Cheaters without an Honest Majority | tcc | 21-38 |
| 2 | 2012 | On Efficient Zero-Knowledge PCPs | tcc | 151-168 |
| 3 | 2011 | Constant-Rate Oblivious Transfer from Noisy Channels | crypto | 664 |
| 4 | 2011 | Effcient Non-Interactive Secure Computation | eurocrypt | 406 |
| 5 | 2011 | Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings | tcc | |
| 6 | 2010 | Founding Cryptography on Tamper-Proof Hardware Tokens | eprint | online |
| 7 | 2010 | On Invertible Sampling and Adaptive Security | asiacrypt | 466-482 |
| 8 | 2010 | Black-Box Constructions of Protocols for Secure Computation | eprint | online |
| 9 | 2010 | Secure Computation and Its Diverse Applications | tcc | 90 |
| 10 | 2010 | On Complete Primitives for Fairness | tcc | 91-108 |
| 11 | 2010 | Founding Cryptography on Tamper-Proof Hardware Tokens | tcc | 308-326 |
| 12 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | crypto | 173-190 |
| 13 | 2010 | On d-Multiplicative Secret Sharing | jofc | 580-593 |
| 14 | 2010 | Secure Multiparty Computation with Minimal Interaction | crypto | 577-594 |
| 15 | 2010 | On Achieving the "Best of Both Worlds" in Secure Multiparty Computation | eprint | online |
| 16 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | eprint | online |
| 17 | 2010 | Bounded Key-Dependent Message Security | eurocrypt | 423-444 |
| 18 | 2010 | Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography | eurocrypt | 445-465 |
| 19 | 2010 | Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography | eprint | online |
| 20 | 2009 | Cryptography with Constant Input Locality | jofc | 429-469 |
| 21 | 2009 | Secure Arithmetic Computation with No Honest Majority | tcc | 294-314 |
| 22 | 2008 | OT-Combiners via Secure Computation | tcc | 393-411 |
| 23 | 2008 | Basing Weak Public-Key Cryptography on Strong One-Way Functions | tcc | 55-72 |
| 24 | 2008 | Founding Cryptography on Oblivious Transfer - Efficiently | crypto | 572-591 |
| 25 | 2008 | Scalable Multiparty Computation with Nearly Optimal Work and Resilience | crypto | 241-261 |
| 26 | 2008 | Secure Arithmetic Computation with No Honest Majority | eprint | online |
| 27 | 2008 | Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle | eurocrypt | 379-396 |
| 28 | 2007 | Evaluating Branching Programs on Encrypted Data | tcc | 575-594 |
| 29 | 2007 | Cryptography with Constant Input Locality | crypto  | 92-110 |
| 30 | 2007 | How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? | crypto | 284-302 |
| 31 | 2006 | Cryptography from Anonymity | eprint | online |
| 32 | 2006 | Scalable Secure Multiparty Computation | crypto | online |
| 33 | 2006 | On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation | crypto | online |
| 34 | 2006 | Private Circuits II: Keeping Secrets in Tamperable Circuits | eurocrypt | online |
| 35 | 2005 | Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation | tcc | online |
| 36 | 2005 | Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator | eprint | online |
| 37 | 2005 | Keyword Search and Oblivious Pseudorandom Functions | tcc | online |
| 38 | 2005 | Sufficient Conditions for Collision-Resistant Hashing | tcc | online |
| 39 | 2005 | Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator | crypto | online |
| 40 | 2005 | Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems | crypto | online |
| 41 | 2004 | Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing | jofc | 125-151 |
| 42 | 2004 | Adaptive versus Non-Adaptive Security of Multi-Party Protocols | jofc | 153-207 |
| 43 | 2004 | On the Hardness of Information-Theoretic Multiparty Computation | eurocrypt | online |
| 44 | 2003 | Efficient Multi-party Computation over Rings | eurocrypt | online |
| 45 | 2003 | Extending Oblivious Transfers Efficiently | crypto | online |
| 46 | 2003 | Private Circuits: Securing Hardware against Probing Attacks | crypto | online |
| 47 | 2003 | Efficient Multi-Party Computation over Rings | eprint | online |
| 48 | 2002 | On 2-Round Secure Multiparty Computation | crypto | online |
| 49 | 2001 | Universal Service-Providers for Private Information Retrieval | jofc | 37-74 |
| 50 | 2001 | On Adaptive vs. Non-adaptive Security of Multiparty Protocols | eurocrypt | 262-279 |
| 51 | 2001 | On adaptive vs. non-adaptive security of multiparty protocols | eprint | online |
| 52 | 2001 | Secure Multiparty Computation of Approximations | eprint | online |
| 53 | 2001 | On the Power of Nonlinear Secret-Sharing | eprint | online |
| 54 | 2001 | Priced Oblivious Transfer: How to Sell Digital Goods | eurocrypt | 119-135 |
| 55 | 2000 | Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing | crypto | 55-73 |
| 56 | 1999 | Compressing Cryptographic Resources | crypto | 591-608 |
| 57 | 1998 | Universal Service Providers for Database Private Information Retrieval | eprint | online |
| 58 | 1997 | Protecting Data Privacy in Private Information Retrieval Schemes | eprint | online |
