| A Note on Copy-Protection from Random Oracles. | 0 | 0.34 | 2022 |
| On the Feasibility of Unclonable Encryption, and More. | 0 | 0.34 | 2022 |
| Post-Quantum Zero-Knowledge with Space-Bounded Simulation. | 0 | 0.34 | 2022 |
| Collusion-Resistant Functional Encryption for RAMs. | 0 | 0.34 | 2022 |
| Cryptography from Pseudorandom Quantum States. | 0 | 0.34 | 2021 |
| Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE). | 0 | 0.34 | 2020 |
| Multikey FHE in the Plain Model. | 0 | 0.34 | 2020 |
| Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation? | 0 | 0.34 | 2020 |
| Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. | 2 | 0.36 | 2019 |
| Fully Homomorphic NIZK and NIWI Proofs. | 0 | 0.34 | 2019 |
| Two Round Information-Theoretic MPC with Malicious Security. | 0 | 0.34 | 2018 |
| Private Circuits: A Modular Approach. | 3 | 0.40 | 2018 |
| Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. | 0 | 0.34 | 2018 |
| Succinct Garbling Schemes From Functional Encryption Through A Local Simulation Paradigm | 0 | 0.34 | 2018 |
| Attribute Based Encryption for RAMs from LWE. | 0 | 0.34 | 2018 |
| Round-Optimal Secure Multiparty Computation with Honest Majority. | 1 | 0.34 | 2018 |
| Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization. | 1 | 0.34 | 2017 |
| On Secure Two-Party Computation in Three Rounds. | 1 | 0.35 | 2017 |
| A New Approach to Round-Optimal Secure Multiparty Computation. | 9 | 0.46 | 2017 |
| Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps. | 21 | 0.58 | 2017 |
| Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption. | 3 | 0.36 | 2017 |
| Patchable Indistinguishability Obfuscation: iO for Evolving Software. | 0 | 0.34 | 2017 |
| Cryptography with Updates. | 0 | 0.34 | 2017 |
| Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. | 5 | 0.40 | 2016 |
| Delegating RAM Computations with Adaptive Soundness and Privacy. | 13 | 0.50 | 2016 |
| Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. | 7 | 0.42 | 2016 |
| Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption. | 16 | 0.55 | 2015 |
| From Selective To Adaptive Security In Functional Encryption | 43 | 0.99 | 2015 |
| Indistinguishability Obfuscation with Constant Size Overhead. | 1 | 0.35 | 2015 |
| Patchable Obfuscation. | 0 | 0.34 | 2015 |
| Interactive Proofs under Continual Memory Leakage. | 9 | 0.48 | 2014 |
| The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. | 7 | 0.47 | 2014 |
| Optimizing Obfuscation: Avoiding Barrington's Theorem | 49 | 1.34 | 2014 |
| Differing-Inputs Obfuscation and Applications. | 16 | 0.66 | 2013 |
| On the (in)security of fischlin’s paradigm | 1 | 0.35 | 2013 |
| Lower Bounds in the Hardware Token Model. | 1 | 0.35 | 2013 |
| Non Observability in the Random Oracle Model | 7 | 0.48 | 2012 |
| An algebraic characterization of rainbow connectivity | 0 | 0.34 | 2011 |
| Rainbow Connectivity: Hardness and Tractability. | 12 | 0.79 | 2011 |
| Hardness and Parameterized Algorithms on Rainbow Connectivity problem | 1 | 0.45 | 2011 |
| New Hardness Results in Rainbow Connectivity | 5 | 0.94 | 2011 |
