| The Pseudorandom Oracle Model and Ideal Obfuscation. | 0 | 0.34 | 2022 |
| On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. | 0 | 0.34 | 2022 |
| ABE for Circuits with Constant-Size Secret Keys and Adaptive Security. | 0 | 0.34 | 2022 |
| QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore. | 0 | 0.34 | 2022 |
| Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols. | 0 | 0.34 | 2022 |
| Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL. | 0 | 0.34 | 2020 |
| Multiparty Reusable Non-Interactive Secure Computation. | 0 | 0.34 | 2020 |
| Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles | 0 | 0.34 | 2020 |
| Succinct and Adaptively Secure ABE for ABP from k-Lin. | 0 | 0.34 | 2020 |
| Simplifying Constructions and Assumptions for i풪. | 0 | 0.34 | 2019 |
| k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. | 0 | 0.34 | 2018 |
| Pharos: Privacy Hazards of Replicating ORAM Stores. | 0 | 0.34 | 2018 |
| Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation. | 0 | 0.34 | 2018 |
| k-Round MPC from k-Round OT via Garbled Interactive Circuits. | 2 | 0.36 | 2017 |
| On Removing Graded Encodings from Functional Encryption. | 3 | 0.36 | 2017 |
| Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs. | 0 | 0.34 | 2017 |
| Foundations of Homomorphic Secret Sharing. | 3 | 0.39 | 2017 |
| Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles | 3 | 0.39 | 2017 |
| A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. | 1 | 0.35 | 2017 |
| Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. | 0 | 0.34 | 2017 |
| Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs. | 0 | 0.34 | 2016 |
| Obfuscation of Probabilistic Circuits and Applications. | 42 | 1.21 | 2014 |
| The Hunting of the SNARK. | 2 | 0.38 | 2014 |
| The Computational Benefit of Correlated Instances | 1 | 0.35 | 2014 |
| Succinct Garbling Schemes and Applications. | 12 | 0.55 | 2014 |
| Amplification of Chosen-Ciphertext Security. | 6 | 0.41 | 2013 |
| Public-Coin concurrent zero-knowledge in the global hash model | 16 | 0.53 | 2013 |
| Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. | 2 | 0.35 | 2012 |
| Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. | 5 | 0.43 | 2011 |
| Non-malleability amplification | 19 | 0.60 | 2009 |
| Composable Information Gradients in Wireless Sensor Networks | 30 | 1.22 | 2008 |
| RICH: Automatically Protecting Against Integer-Based Vulnerabilities | 44 | 3.23 | 2007 |
