| Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks. | 9 | 0.53 | 2016 |
| Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits. | 20 | 0.66 | 2016 |
| Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. | 44 | 0.89 | 2016 |
| Secure Obfuscation in a Weak Multilinear Map Model. | 28 | 0.68 | 2016 |
| Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations | 70 | 1.58 | 2015 |
| Post-Zeroizing Obfuscation: The case of Evasive Circuits. | 0 | 0.34 | 2015 |
| Protecting obfuscation against arithmetic attacks. | 18 | 0.67 | 2014 |
| Succinct and explicit circuits for sorting and connectivity. | 0 | 0.34 | 2014 |
| Iterated group products and leakage resilience against NC1 | 2 | 0.36 | 2013 |
| Local reductions. | 0 | 0.34 | 2013 |
| Shielding circuits with groups | 12 | 0.54 | 2013 |
| Amplifying Privacy in Privacy Amplification. | 1 | 0.36 | 2013 |
| Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. | 12 | 0.50 | 2012 |
| From RAM to SAT. | 1 | 0.35 | 2012 |
| On the complexity of constructing pseudorandom functions (especially when they don't exist). | 0 | 0.34 | 2012 |
| On the complexity of non-adaptively increasing the stretch of pseudorandom generators | 4 | 0.43 | 2011 |
| The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. | 0 | 0.34 | 2011 |
| Alternating Hierarchies for Time-Space Tradeoffs | 0 | 0.34 | 2008 |
