| Interactive Proofs for Verifying Machine Learning. | 0 | 0.34 | 2021 |
| Pseudo-Deterministic Streaming. | 0 | 0.34 | 2020 |
| Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples | 0 | 0.34 | 2020 |
| Homomorphic Encryption Standard. | 0 | 0.34 | 2019 |
| Fine-grained Complexity Meets IP = PSPACE. | 1 | 0.35 | 2019 |
| Doubly-Efficient Pseudo-Deterministic Proofs | 0 | 0.34 | 2019 |
| Population stability: regulating size in the presence of an adversary. | 0 | 0.34 | 2018 |
| Pseudo-deterministic Proofs. | 0 | 0.34 | 2017 |
| Bipartite Perfect Matching in Pseudo-Deterministic NC. | 2 | 0.38 | 2017 |
| Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal. | 1 | 0.36 | 2017 |
| The Complexity of Problems in P Given Correlated Instances. | 0 | 0.34 | 2017 |
| On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. | 0 | 0.34 | 2016 |
| How To Incentivize Data-Driven Collaboration Among Competing Parties | 2 | 0.37 | 2016 |
| Perfect Bipartite Matching in Pseudo-Deterministic $RNC$. | 3 | 0.41 | 2015 |
| On Time and Order in Multiparty Computation. | 2 | 0.38 | 2015 |
| Adaptively Secure Coin-Flipping, Revisited. | 2 | 0.39 | 2015 |
| Aggregate Pseudorandom Functions and Connections to Learning. | 2 | 0.43 | 2015 |
| Multi-Input Functional Encryption. | 38 | 1.02 | 2014 |
| The Hunting of the SNARK. | 2 | 0.38 | 2014 |
| Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation. | 18 | 0.56 | 2014 |
| The impossibility of obfuscation with a universal simulator. | 1 | 0.36 | 2014 |
| Overcoming the Worst-Case Curse for Cryptographic Constructions. | 1 | 0.36 | 2013 |
| How to Run Turing Machines on Encrypted Data. | 62 | 1.82 | 2013 |
| Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting | 23 | 0.72 | 2013 |
| A Note on the Impossibility of Obfuscation with Auxiliary Input. | 3 | 0.40 | 2013 |
| Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond. | 15 | 1.09 | 2012 |
| How to Compute in the Presence of Leakage | 38 | 1.10 | 2012 |
| Distributed public key schemes secure against continual leakage | 10 | 0.50 | 2012 |
| Multiparty computation secure against continual memory leakage | 29 | 0.89 | 2012 |
| Pseudo-deterministic Algorithms (Invited Talk). | 0 | 0.34 | 2012 |
| Collision-Free Hashing from Lattice Problems. | 54 | 5.93 | 2011 |
| Program obfuscation with leaky hardware | 20 | 0.77 | 2011 |
| Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications. | 7 | 0.61 | 2011 |
| Leakage-resilient coin tossing | 7 | 0.46 | 2011 |
| Erratum for: on basing one-way functions on NP-hardness | 1 | 0.42 | 2010 |
| Robustness of the Learning with Errors Assumption | 57 | 2.11 | 2010 |
| Public-key encryption schemes with auxiliary inputs | 102 | 2.90 | 2010 |
| Black-box circular-secure encryption beyond affine functions | 31 | 1.24 | 2009 |
| Cryptography without (Hardly Any) Secrets ? | 2 | 0.52 | 2009 |
| Simultaneous Hardcore Bits and Cryptography against Memory Attacks | 245 | 7.41 | 2009 |
| Athena lecture: Controlling Access to Programs? | 0 | 0.34 | 2009 |
| Delegating computation: interactive proofs for muggles | 132 | 4.22 | 2008 |
| How to Protect Yourself without Perfect Shredding | 8 | 0.90 | 2008 |
| A (de)constructive approach to program checking | 12 | 0.60 | 2008 |
| On basing one-way functions on NP-hardness | 33 | 1.18 | 2006 |
| Fault-Tolerant Distributed Computing in Full-Information Networks | 10 | 0.54 | 2006 |
| Proof of plaintext knowledge for the ajtai-dwork cryptosystem | 7 | 1.72 | 2005 |
| On the Impossibility of Obfuscation with Auxiliary Input | 117 | 6.40 | 2005 |
| Secure Multi-Party Computation without Agreement | 45 | 1.75 | 2005 |
| Distributed computing with imperfect randomness | 6 | 0.44 | 2005 |
