| Non-malleable Time-Lock Puzzles and Applications | 0 | 0.34 | 2021 |
| A Logarithmic Lower Bound For Oblivious Ram (For All Parameters) | 0 | 0.34 | 2021 |
| Oblivious Ram With Worst-Case Logarithmic Overhead | 0 | 0.34 | 2021 |
| Non-Malleable Codes For Bounded Parallel-Time Tampering | 0 | 0.34 | 2021 |
| From Minicrypt to Obfustopia via Private-Key Functional Encryption | 10 | 0.50 | 2020 |
| Instance Complexity and Unlabeled Certificates in the Decision Tree Model. | 0 | 0.34 | 2020 |
| Threshold Secret Sharing Requires a Linear-Size Alphabet | 0 | 0.34 | 2020 |
| Oblivious Parallel Tight Compaction. | 0 | 0.34 | 2020 |
| On Perfect Correctness without Derandomization. | 0 | 0.34 | 2019 |
| Hardness-Preserving Reductions via Cuckoo Hashing | 0 | 0.34 | 2019 |
| Impossibility of Strong KDM Security with Auxiliary Input. | 0 | 0.34 | 2019 |
| Distributional Collision Resistance Beyond One-Way Functions. | 0 | 0.34 | 2019 |
| Continuous Verifiable Delay Functions. | 0 | 0.34 | 2019 |
| White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing | 0 | 0.34 | 2019 |
| Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge | 0 | 0.34 | 2019 |
| Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. | 6 | 0.42 | 2018 |
| A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. | 0 | 0.34 | 2018 |
| OptORAMa: Optimal Oblivious RAM. | 1 | 0.36 | 2018 |
| Cutting-Edge Cryptography Through the Lens of Secret Sharing. | 4 | 0.39 | 2018 |
| Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. | 1 | 0.35 | 2018 |
| On Distributional Collision Resistant Hashing. | 1 | 0.35 | 2018 |
| Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. | 1 | 0.37 | 2018 |
| Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. | 10 | 0.55 | 2018 |
| On the Complexity of Compressing Obfuscation. | 0 | 0.34 | 2018 |
| Communication with Contextual Uncertainty | 1 | 0.36 | 2018 |
| Non-Interactive Multiparty Computation Without Correlated Randomness. | 2 | 0.37 | 2017 |
| Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. | 1 | 0.35 | 2017 |
| Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). | 1 | 0.34 | 2017 |
| Evolving Secret Sharing: Dynamic Thresholds and Robustness. | 1 | 0.37 | 2017 |
| Be Adaptive, Avoid Overcommitting. | 1 | 0.35 | 2017 |
| Threshold Secret Sharing Requires a Linear Size Alphabet. | 6 | 0.47 | 2016 |
| Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. | 1 | 0.34 | 2016 |
| How to Share a Secret, Infinitely. | 1 | 0.37 | 2016 |
| Compressing Communication in Distributed Protocols. | 0 | 0.34 | 2015 |
| Negation-Limited Formulas. | 0 | 0.34 | 2015 |
| From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. | 11 | 0.51 | 2015 |
| Communication with Contextual Uncertainty. | 0 | 0.34 | 2015 |
| Modern Cryptography Through the Lens of Secret Sharing. | 0 | 0.34 | 2015 |
| Secret-Sharing for NP from Indistinguishability Obfuscation. | 2 | 0.42 | 2014 |
| Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. | 5 | 0.43 | 2014 |
| Secret-Sharing for NP. | 2 | 0.37 | 2014 |
| Strong Locally Testable Codes with Relaxed Local Decoders. | 2 | 0.36 | 2014 |
| Improved Average-Case Lower Bounds for DeMorgan Formula Size | 22 | 0.77 | 2013 |
| Hardness preserving reductions via cuckoo hashing | 5 | 0.39 | 2012 |
| Average-case lower bounds for formula size | 15 | 0.73 | 2012 |
| The Spectrum of Small DeMorgan Formulas. | 0 | 0.34 | 2012 |
