| year | title | booktitle | pages |
|---|
| 1 | 2017 | Separating IND-CPA and Circular Security for Unbounded Length Key Cycles | pkc | 232-246 |
| 2 | 2017 | Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption | eurocrypt | 528-557 |
| 3 | 2017 | Universal Samplers with Fast Verification | pkc | 525-554 |
| 4 | 2016 | Circular Security Separations for Arbitrary Length Cycles from LWE | crypto | 681-700 |
| 5 | 2016 | Semi-adaptive Security and Bundling Functionalities Made Generic and Easy | tcc | 361-388 |
| 6 | 2016 | New Negative Results on Differing-Inputs Obfuscation | eurocrypt | 792-821 |
| 7 | 2016 | Constrained Pseudorandom Functions for Unconstrained Inputs | eurocrypt | 124-153 |
| 8 | 2016 | How to Generate and Use Universal Samplers | asiacrypt | online |
| 9 | 2015 | New Circular Security Counterexamples from Decision Linear and Learning with Errors | asiacrypt | 776-800 |
| 10 | 2015 | New Circular Security Counterexamples from Decision Linear and Learning with Errors | eprint | 715 |
| 11 | 2015 | Separations in Circular Security for Arbitrary Length Key Cycles | tcc | 378-400 |
| 12 | 2015 | New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators | asiacrypt | 121-145 |
| 13 | 2015 | Universal Signature Aggregators | eurocrypt | 3-34 |
| 14 | 2015 | Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption | eprint | 16 |
| 15 | 2015 | Computing on Authenticated Data | jofc | 351-395 |
| 16 | 2015 | Time-Lock Puzzles from Randomized Encodings | eprint | 514 |
| 17 | 2015 | A Punctured Programming Approach to Adaptively Secure Functional Encryption | crypto | 678-697 |
| 18 | 2015 | Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model | asiacrypt | 79-102 |
| 19 | 2015 | New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators | eprint | 869 |
| 20 | 2014 | Witness Encryption from Instance Independent Assumptions | eprint | 273 |
| 21 | 2014 | Low Overhead Broadcast Encryption from Multilinear Maps | eprint | 195 |
| 22 | 2014 | How to Generate and use Universal Parameters | eprint | 507 |
| 23 | 2014 | Relaxed Two-to-one Recoding Schemes | eprint | 477 |
| 24 | 2014 | Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption | eprint | 309 |
| 25 | 2014 | Witness Encryption from Instance Independent Assumptions | crypto | 426-443 |
| 26 | 2014 | Online/Offline Attribute-Based Encryption | eprint | 21 |
| 27 | 2014 | Low Overhead Broadcast Encryption from Multilinear Maps | crypto | 206-223 |
| 28 | 2014 | Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation | eurocrypt | 201-220 |
| 29 | 2014 | A Punctured Programming Approach to Adaptively Secure Functional Encryption | eprint | 588 |
| 30 | 2014 | Why Proving HIBE Systems Secure Is Difficult | eurocrypt | 58-76 |
| 31 | 2014 | Online/Offline Attribute-Based Encryption | pkc | 293-310 |
| 32 | 2014 | Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model | eprint | 521 |
| 33 | 2014 | Fully Secure and Fast Signing from Obfuscation | eprint | 523 |
| 34 | 2013 | Attribute-Based Encryption for Circuits from Multilinear Maps | crypto | 479-499 |
| 35 | 2013 | Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures | crypto | 494-512 |
| 36 | 2013 | Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based | crypto | 75-92 |
| 37 | 2013 | Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys | crypto | 166-184 |
| 38 | 2013 | Constrained Pseudorandom Functions and Their Applications | asiacrypt | 280-300 |
| 39 | 2013 | Functional Encryption: Origins and Recent Developments | PKC | 50 |
| 40 | 2013 | Attribute-Based Encryption with Fast Decryption | PKC | 160 |
| 41 | 2012 | Dual Form Signatures: An Approach for Proving Security from Static Assumptions | asiacrypt | 25-42 |
| 42 | 2012 | Computing on Authenticated Data | tcc | 1-20 |
| 43 | 2012 | Identity-Based (Lossy) Trapdoor Functions and Applications | eurocrypt | 228-245 |
| 44 | 2012 | Standard Security Does Not Imply Security against Selective-Opening | eurocrypt | 645-662 |
| 45 | 2012 | Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security | eurocrypt | 663-681 |
| 46 | 2012 | Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption | crypto | 199-217 |
| 47 | 2012 | Functional Encryption for Regular Languages | crypto | 218-235 |
| 48 | 2012 | New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques | crypto | 180-198 |
| 49 | 2011 | Bi-Deniable Public-Key Encryption | crypto | 521 |
| 50 | 2011 | Unbounded HIBE and Attribute-Based Encryption | eurocrypt | 547 |
| 51 | 2011 | Decentralizing Attribute-Based Encryption | eurocrypt | 568 |
| 52 | 2011 | Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization | pkc | 53 |
| 53 | 2011 | Achieving Leakage Resilience Through Dual System Encryption | tcc | 70 |
| 54 | 2011 | Identity-Based Encryption Secure Against Selective Opening Attack | tcc | 235 |
| 55 | 2011 | Functional Encryption: Definitions and Challenges | tcc | 253 |
| 56 | 2010 | On the Insecurity of Parallel Repetition for Leakage Resilience | eprint | online |
| 57 | 2010 | Identity-Based Encryption Secure under Selective Opening Attack | eprint | online |
| 58 | 2010 | Achieving Leakage Resilience Through Dual System Encryption | eprint | online |
| 59 | 2010 | New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts | tcc | 455-479 |
| 60 | 2010 | Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption | eurocrypt | 62-91 |
| 61 | 2010 | Constructing Verifiable Random Functions with Large Input Spaces | eurocrypt | 656-672 |
| 62 | 2010 | Decentralizing Attribute-Based Encryption | eprint | online |
| 63 | 2010 | Constructing Verifiable Random Functions with Large Input Spaces | eprint | online |
| 64 | 2010 | Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption | eprint | online |
| 65 | 2009 | Signing a Linear Subspace: Signature Schemes for Network Coding | pkc | 68-87 |
| 66 | 2009 | Realizing Hash-and-Sign Signatures under Standard Assumptions | eprint | online |
| 67 | 2009 | Short and Stateless Signatures from the RSA Assumption | crypto | 654-670 |
| 68 | 2009 | Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions | crypto | 619-636 |
| 69 | 2009 | Predicate Privacy in Encryption Systems | tcc | 457-473 |
| 70 | 2009 | Realizing Hash-and-Sign Signatures under Standard Assumptions | eurocrypt | 333-350 |
| 71 | 2009 | Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts) | eurocrypt | 171-188 |
| 72 | 2008 | Adaptive Security in Broadcast Encryption Systems | eprint | online |
| 73 | 2008 | Delegating Capabilities in Predicate Encryption Systems | eprint | online |
| 74 | 2008 | Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization | eprint | online |
| 75 | 2008 | A Framework for Efficient and Composable Oblivious Transfer | crypto | 554-571 |
| 76 | 2008 | Revocation Systems with Very Small Private Keys | eprint | online |
| 77 | 2008 | Compact Signatures for Network Coding | eprint | online |
| 78 | 2008 | Compact Proofs of Retrievability | eprint | online |
| 79 | 2008 | Compact Proofs of Retrievability | asiacrypt | 90-107 |
| 80 | 2008 | Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | eurocrypt | 146-162 |
| 81 | 2008 | Signing a Linear Subspace: Signature Schemes for Network Coding | eprint | online |
| 82 | 2007 | Attribute-Based Encryption with Non-Monotonic Access Structures | eprint | online |
| 83 | 2007 | Conjunctive, Subset, and Range Queries on Encrypted Data | tcc | 535-554 |
| 84 | 2007 | A Framework for Efficient and Composable Oblivious Transfer | eprint | online |
| 85 | 2007 | Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | eprint | online |
| 86 | 2007 | Efficient Ring Signatures Without Random Oracles | pkc | 166-180 |
| 87 | 2007 | Full-Domain Subgroup Hiding and Constant-Size Group Signatures | pkc  | 1-15 |
| 88 | 2007 | Lossy Trapdoor Functions and Their Applications | eprint | online |
| 89 | 2006 | Conjunctive, Subset, and Range Queries on Encrypted Data | eprint | online |
| 90 | 2006 | Efficient Ring Signatures without Random Oracles | eprint | online |
| 91 | 2006 | Sequential Aggregate Signatures and Multisignatures Without Random Oracles | eurocrypt | online |
| 92 | 2006 | Forward-Secure Signatures with Untrusted Update | eprint | online |
| 93 | 2006 | A Fully Collusion Resistant Broadcast, Trace, and Revoke System | eprint | online |
| 94 | 2006 | Fully Collusion Resistant Traitor Tracing | eprint | online |
| 95 | 2006 | Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data | eprint | online |
| 96 | 2006 | Strongly Unforgeable Signatures Based on Computational Diffie-Hellman | pkc | online |
| 97 | 2006 | Compact Group Signatures Without Random Oracles | eurocrypt | online |
| 98 | 2006 | Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) | eprint | online |
| 99 | 2006 | Sequential Aggregate Signatures and Multisignatures without Random Oracles | eprint | online |
| 100 | 2006 | Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) | crypto | online |
| 101 | 2006 | Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys | eurocrypt | online |
| 102 | 2005 | Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys | crypto | online |
| 103 | 2005 | Efficient Identity-Based Encryption Without Random Oracles | eurocrypt | online |
| 104 | 2005 | Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys | eprint | online |
| 105 | 2005 | Direct Chosen Ciphertext Security from Identity-Based Techniques | eprint | online |
| 106 | 2005 | Compact Group Signatures Without Random Oracles | eprint | online |
| 107 | 2005 | Fuzzy Identity-Based Encryption | eurocrypt | online |
| 108 | 2004 | Fuzzy Identity Based Encryption | eprint | online |
| 109 | 2004 | Efficient Identity-Based Encryption Without Random Oracles | eprint | online |
