| Authentication in the Bounded Storage Model. | 0 | 0.34 | 2022 |
| The Pseudorandom Oracle Model and Ideal Obfuscation. | 0 | 0.34 | 2022 |
| Witness Encryption and Null-IO from Evasive LWE. | 0 | 0.34 | 2022 |
| Nearly Optimal Property Preserving Hashing. | 0 | 0.34 | 2022 |
| Updatable Public Key Encryption in the Standard Model. | 0 | 0.34 | 2022 |
| Post-Quantum Insecurity from LWE. | 0 | 0.34 | 2022 |
| Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. | 0 | 0.34 | 2022 |
| Boosting Batch Arguments and RAM Delegation. | 0 | 0.34 | 2022 |
| Is There An Oblivious Ram Lower Bound For Online Reads? | 0 | 0.34 | 2021 |
| Targeted Lossy Functions And Applications | 0 | 0.34 | 2021 |
| Succinct LWE Sampling, Random Polynomials, and Obfuscation | 0 | 0.34 | 2021 |
| Limits On The Adaptive Security Of Yao'S Garbling | 0 | 0.34 | 2021 |
| Updatable Public Key Encryption in the Standard Model | 0 | 0.34 | 2021 |
| Witness Maps and Applications. | 0 | 0.34 | 2020 |
| Statistical ZAPR Arguments from Bilinear Maps. | 0 | 0.34 | 2020 |
| Broadcast and Trace with (N^{varepsilon }) Ciphertext Size from Standard Assumptions | 0 | 0.34 | 2019 |
| Adaptively Secure MPC with Sublinear Communication Complexity | 0 | 0.34 | 2019 |
| New Constructions of Reusable Designated-Verifier NIZKs. | 0 | 0.34 | 2019 |
| 2-Message Publicly Verifiable WI from (Subexponential) LWE. | 0 | 0.34 | 2019 |
| Fiat-Shamir: from practice to theory | 0 | 0.34 | 2019 |
| Reusable Designated-Verifier NIZKs for all NP from CDH. | 0 | 0.34 | 2019 |
| Non-malleable Codes for Decision Trees. | 0 | 0.34 | 2019 |
| On the Plausibility of Fully Homomorphic Encryption for RAMs. | 0 | 0.34 | 2019 |
| Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. | 0 | 0.34 | 2018 |
| Watermarking Prfs Under Standard Assumptions: Public Marking And Security With Extraction Queries | 0 | 0.34 | 2018 |
| Hardness of Non-Interactive Differential Privacy from One-Way Functions. | 0 | 0.34 | 2018 |
| Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. | 1 | 0.35 | 2018 |
| Private Anonymous Data Access. | 1 | 0.35 | 2018 |
| Is There An Oblivious Ram Lower Bound For Online Reads? | 0 | 0.34 | 2018 |
| Laconic Function Evaluation and Applications | 3 | 0.38 | 2018 |
| Succinct delegation for low-space non-deterministic computation. | 0 | 0.34 | 2018 |
| Traitor-Tracing From Lwe Made Simple And Attribute-Based | 0 | 0.34 | 2018 |
| Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. | 0 | 0.34 | 2018 |
| Obfuscating Compute-and-Compare Programs under LWE | 13 | 0.52 | 2017 |
| Non-Interactive Delegation for Low-Space Non-Deterministic Computation. | 0 | 0.34 | 2017 |
| Adaptively Indistinguishable Garbled Circuits. | 2 | 0.35 | 2017 |
| The Edited Truth. | 0 | 0.34 | 2017 |
| Be Adaptive, Avoid Overcommitting. | 1 | 0.35 | 2017 |
| Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. | 28 | 0.77 | 2016 |
| Obfuscating Conjunctions Under Entropic Ring Lwe | 12 | 0.63 | 2016 |
| Spooky Encryption and its Applications. | 15 | 0.57 | 2016 |
| Watermarking Cryptographic Capabilities. | 4 | 0.40 | 2016 |
| Adaptively Secure Garbled Circuits from One-Way Functions. | 17 | 0.57 | 2016 |
| Two Round Multiparty Computation via Multi-key FHE. | 52 | 1.29 | 2016 |
| Standard Security Does Not Imply Indistinguishability Under Selective Opening. | 9 | 0.52 | 2016 |
| Adaptive Security of Yao's Garbled Circuits. | 9 | 0.44 | 2016 |
| Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. | 8 | 0.44 | 2016 |
| Essentially Optimal Robust Secret Sharing with Maximal Corruptions. | 6 | 0.47 | 2015 |
| Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. | 4 | 0.40 | 2015 |
| Perfect Structure on the Edge of Chaos. | 18 | 0.54 | 2015 |
