| Incrementally Verifiable Computation via Rate-1 Batch Arguments. | 0 | 0.34 | 2022 |
| Succinct Non-Interactive Arguments via Linear Interactive Proofs | 0 | 0.34 | 2022 |
| PPAD is as Hard as LWE and Iterated Squaring. | 0 | 0.34 | 2022 |
| Reusable Fuzzy Extractors For Low-Entropy Distributions | 1 | 0.35 | 2021 |
| Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. | 0 | 0.34 | 2020 |
| On Round Optimal Statistical Zero Knowledge Arguments. | 0 | 0.34 | 2019 |
| Incrementally Verifiable Computation via Incremental PCPs. | 0 | 0.34 | 2019 |
| How to Delegate Computations Publicly. | 0 | 0.34 | 2019 |
| On Publicly Verifiable Delegation From Standard Assumptions. | 0 | 0.34 | 2018 |
| On Removing Graded Encodings from Functional Encryption. | 3 | 0.36 | 2017 |
| Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. | 8 | 0.42 | 2017 |
| On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. | 1 | 0.35 | 2017 |
| 3-Message Zero Knowledge Against Human Ignorance. | 4 | 0.38 | 2016 |
| Time-Lock Puzzles From Randomized Encodings | 24 | 0.86 | 2016 |
| Delegating RAM Computations. | 1 | 0.35 | 2016 |
| Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. | 8 | 0.44 | 2016 |
| On the Equivalence of Obfuscation and Multilinear Maps. | 7 | 0.44 | 2015 |
| On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. | 6 | 0.41 | 2015 |
| On Obfuscation with Random Oracles. | 14 | 0.51 | 2015 |
| Perfect Structure on the Edge of Chaos. | 18 | 0.54 | 2015 |
| ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. | 27 | 0.68 | 2014 |
| On the existence of extractable one-way functions | 35 | 0.84 | 2014 |
| Key Derivation From Noisy Sources With More Errors Than Entropy. | 3 | 0.37 | 2014 |
| On the Cryptographic Hardness of Finding a Nash Equilibrium. | 27 | 0.66 | 2014 |
| Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. | 0 | 0.34 | 2014 |
| The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. | 25 | 0.82 | 2014 |
| Publicly Verifiable Non-Interactive Arguments for Delegating Computation. | 6 | 0.40 | 2014 |
| On Virtual Grey Box Obfuscation for General Circuits. | 10 | 0.55 | 2014 |
| On the Achievability of Simulation-Based Security for Functional Encryption. | 46 | 1.23 | 2013 |
| How To Construct Extractable One-Way Functions Against Uniform Adversaries. | 2 | 0.37 | 2013 |
| Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. | 1 | 0.35 | 2013 |
| Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. | 13 | 0.57 | 2013 |
| Succinct non-interactive arguments via linear interactive proofs | 69 | 1.72 | 2013 |
| Public-Coin concurrent zero-knowledge in the global hash model | 16 | 0.53 | 2013 |
| Obfuscation for Evasive Functions. | 10 | 0.52 | 2013 |
| Protecting Obfuscation Against Algebraic Attacks. | 119 | 2.86 | 2013 |
| On the impossibility of approximate obfuscation and applications to resettable cryptography | 25 | 0.71 | 2013 |
| More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. | 6 | 0.47 | 2013 |
| Point obfuscation and 3-round zero-knowledge | 0 | 0.34 | 2011 |
