| year | title | booktitle | pages |
|---|
| 1 | 2012 | New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation | crypto | 443-460 |
| 2 | 2012 | On Efficient Zero-Knowledge PCPs | tcc | 151-168 |
| 3 | 2012 | Concurrently Secure Computation in Constant Rounds | eurocrypt | 99-116 |
| 4 | 2012 | Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption | crypto | 199-217 |
| 5 | 2012 | Adaptively Secure Multi-Party Computation with Dishonest Majority | crypto | 105-123 |
| 6 | 2011 | Leakage-Resilient Zero Knowledge | crypto | 293 |
| 7 | 2011 | Cryptography with Tamperable and Leaky Memory | crypto | 367 |
| 8 | 2011 | Round Optimal Blind Signatures in the Standard Model | crypto | 627 |
| 9 | 2011 | Constant-Rate Oblivious Transfer from Noisy Channels | crypto | 664 |
| 10 | 2011 | Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge | asiacrypt | 390-406 |
| 11 | 2011 | Effcient Non-Interactive Secure Computation | eurocrypt | 406 |
| 12 | 2011 | Fully Secure Accountable-Authority Identity-Based Encryption | pkc | 296 |
| 13 | 2011 | Functional Encryption: Definitions and Challenges | tcc | 253 |
| 14 | 2011 | Bringing People of Different Beliefs Together to do UC | tcc | 311 |
| 15 | 2010 | Founding Cryptography on Tamper-Proof Hardware Tokens | eprint | online |
| 16 | 2010 | On Invertible Sampling and Adaptive Security | asiacrypt | 466-482 |
| 17 | 2010 | On Complete Primitives for Fairness | tcc | 91-108 |
| 18 | 2010 | Founding Cryptography on Tamper-Proof Hardware Tokens | tcc | 308-326 |
| 19 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | crypto | 173-190 |
| 20 | 2010 | Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption | eurocrypt | 62-91 |
| 21 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | eprint | online |
| 22 | 2010 | Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption | eprint | online |
| 23 | 2009 | Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems | crypto | 595-618 |
| 24 | 2009 | Secure Arithmetic Computation with No Honest Majority | tcc | 294-314 |
| 25 | 2009 | Resettably Secure Computation | eurocrypt | 54-71 |
| 26 | 2008 | Founding Cryptography on Oblivious Transfer - Efficiently | crypto | 572-591 |
| 27 | 2008 | Revocation Systems with Very Small Private Keys | eprint | online |
| 28 | 2008 | Secure Arithmetic Computation with No Honest Majority | eprint | online |
| 29 | 2008 | Precise Concurrent Zero Knowledge | eurocrypt | 397-414 |
| 30 | 2008 | New Constructions for UC Secure Computation Using Tamper-Proof Hardware | eurocrypt | 545-562 |
| 31 | 2008 | Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | eurocrypt | 146-162 |
| 32 | 2008 | Efficient Non-interactive Proof Systems for Bilinear Groups | eurocrypt | 415-432 |
| 33 | 2007 | Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions | asiacrypt | 444-459 |
| 34 | 2007 | Attribute-Based Encryption with Non-Monotonic Access Structures | eprint | online |
| 35 | 2007 | New Constructions for UC Secure Computation using Tamper-proof Hardware | eprint | online |
| 36 | 2007 | Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | eprint | online |
| 37 | 2007 | Efficient Non-interactive Proof Systems for Bilinear Groups | eprint | online |
| 38 | 2007 | Precise Concurrent Zero Knowledge | eprint | online |
| 39 | 2007 | Private Locally Decodable Codes | eprint | online |
| 40 | 2006 | Sequential Aggregate Signatures and Multisignatures Without Random Oracles | eurocrypt | online |
| 41 | 2006 | Fully Collusion Resistant Traitor Tracing | eprint | online |
| 42 | 2006 | Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data | eprint | online |
| 43 | 2006 | Cryptography from Anonymity | eprint | online |
| 44 | 2006 | Sequential Aggregate Signatures and Multisignatures without Random Oracles | eprint | online |
| 45 | 2006 | Concurrent Non-Malleable Zero Knowledge | eprint | online |
| 46 | 2006 | Perfect Non-interactive Zero Knowledge for NP | eurocrypt | online |
| 47 | 2006 | Non-interactive Zaps and New Techniques for NIZK | crypto | online |
| 48 | 2006 | Concurrent Zero Knowledge Without Complexity Assumptions | tcc | online |
| 49 | 2006 | Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions | eprint | online |
| 50 | 2006 | Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys | eurocrypt | online |
| 51 | 2006 | Private Circuits II: Keeping Secrets in Tamperable Circuits | eurocrypt | online |
| 52 | 2006 | Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization | eprint | online |
| 53 | 2005 | Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation | tcc | online |
| 54 | 2005 | Concurrent Zero Knowledge without Complexity Assumptions | eprint | online |
| 55 | 2005 | Perfect Non-Interactive Zero Knowledge for NP | eprint | online |
| 56 | 2005 | How To Play Almost Any Mental Game Over The Net --- Concurrent Composition via Super-Polynomial Simulation | eprint | online |
| 57 | 2005 | Fuzzy Identity-Based Encryption | eurocrypt | online |
| 58 | 2004 | Positive Results and Techniques for Obfuscation | eprint | online |
| 59 | 2004 | Fuzzy Identity Based Encryption | eprint | online |
| 60 | 2004 | Positive Results and Techniques for Obfuscation | eurocrypt | online |
| 61 | 2004 | New Notions of Security: Achieving Universal Composability without Trusted Setup | eprint | online |
| 62 | 2003 | Private Circuits: Securing Hardware against Probing Attacks | crypto | online |
| 63 | 2002 | A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack | eprint | online |
| 64 | 2002 | Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity | eprint | online |
| 65 | 2002 | Universally Composable Two-Party and Multi-Party Secure Computation | eprint | online |
| 66 | 2001 | On Perfect and Adaptive Security in Exposure-Resilient Cryptography | eurocrypt | 301-324 |
| 67 | 2001 | Robust Non-interactive Zero Knowledge | crypto | 566-598 |
| 68 | 2001 | On the (Im)possibility of Obfuscating Programs | eprint | online |
| 69 | 2001 | On the (Im)possibility of Obfuscating Programs | crypto | 1-18 |
| 70 | 2000 | A Complete Problem for Statistical Zero Knowledge | eprint | online |
| 71 | 2000 | Exposure-Resilient Functions and All-or-Nothing Transforms | eurocrypt | 453-469 |
| 72 | 1999 | Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization | eprint | online |
| 73 | 1999 | Concurrent Zero-Knowledge | eprint | online |
| 74 | 1999 | Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK | crypto | 467-484 |
| 75 | 1999 | Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization | crypto | 519-536 |
| 76 | 1999 | Coding Constructions for Blacklisting Problems without Computational Assumptions | crypto | 609-623 |
| 77 | 1998 | Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems | eprint | online |
| 78 | 1998 | Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems | crypto | 283-298 |
| 79 | 1998 | Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints | crypto | 442-457 |
