| 1 | 2011 | PKC | pc |
| 2 | 2011 | TCC | pc |
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2012 | How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware | crypto | 552-569 |
| 2 | 2011 | Program Obfuscation with Leaky Hardware | asiacrypt | 722-739 |
| 3 | 2011 | Securely Obfuscating Re-Encryption | jofc | 694-719 |
| 4 | 2010 | Obfuscation of Hyperplane Membership | tcc | 72-89 |
| 5 | 2010 | Leakage-Resilient Signatures | tcc | 343-360 |
| 6 | 2010 | Securing Computation against Continuous Leakage | crypto | 59-79 |
| 7 | 2009 | How Efficient Can Memory Checking Be? | tcc | 503-520 |
| 8 | 2009 | Weak Verifiable Random Functions | tcc | 558-576 |
| 9 | 2008 | One-Time Programs | crypto | 39-56 |
| 10 | 2007 | On Best-Possible Obfuscation | tcc | 194-213 |
| 11 | 2007 | Securely Obfuscating Re-encryption | tcc | 233-252 |
| 12 | 2006 | The Complexity of Online Memory Checking | eprint | online |
Coauthors of Guy N. Rothblum |