| Bounded Indistinguishability for Simple Sources. | 0 | 0.34 | 2022 |
| Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. | 0 | 0.34 | 2022 |
| Fully-Secure MPC with Minimal Trust. | 0 | 0.34 | 2022 |
| SNARGs for P from Sub-exponential DDH and QR. | 0 | 0.34 | 2022 |
| Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds. | 0 | 0.34 | 2022 |
| Round-Optimal Black-Box Protocol Compilers. | 0 | 0.34 | 2022 |
| On the Round Complexity of Black-box Secure MPC. | 0 | 0.34 | 2021 |
| Improved Computational Extractors and their Applications. | 0 | 0.34 | 2021 |
| Multi-Source Non-Malleable Extractors and Applications. | 0 | 0.34 | 2020 |
| Separating Two-Round Secure Computation From Oblivious Transfer. | 0 | 0.34 | 2020 |
| Delphi: A Cryptographic Inference System for Neural Networks | 0 | 0.34 | 2020 |
| Leakage Resilient Secret Sharing and Applications | 2 | 0.36 | 2019 |
| Nearly Optimal Robust Secret Sharing against Rushing Adversaries. | 0 | 0.34 | 2019 |
| Unconditionally Secure Computation Against Low-Complexity Leakage. | 0 | 0.34 | 2019 |
| Two-Round Multiparty Secure Computation from Minimal Assumptions. | 11 | 0.44 | 2018 |
| Round Optimal Black-Box Commit-and-Prove. | 0 | 0.34 | 2018 |
| Two-Round Multiparty Secure Computation Minimizing Public Key Operations. | 0 | 0.34 | 2018 |
| Adaptively Secure Garbling with Near Optimal Online Complexity. | 3 | 0.37 | 2018 |
| Revisiting Non-Malleable Secret Sharing. | 2 | 0.36 | 2018 |
| Adaptive Garbled RAM from Laconic Oblivious Transfer. | 0 | 0.34 | 2018 |
| A Simple Construction Of Io For Turing Machines | 2 | 0.35 | 2018 |
| Efficiently Obfuscating Re-Encryption Program under DDH Assumption. | 0 | 0.34 | 2017 |
| Garbled Protocols and Two-Round MPC from Bilinear Maps | 7 | 0.40 | 2017 |
| Breaking the Sub-Exponential Barrier in Obfustopia. | 18 | 0.54 | 2017 |
| Obfuscation without the Vulnerabilities of Multilinear Maps. | 0 | 0.34 | 2016 |
| Secure Obfuscation in a Weak Multilinear Map Model. | 28 | 0.68 | 2016 |
| Unifying Security Notions of Functional Encryption. | 3 | 0.38 | 2016 |
| Single-Key to Multi-Key Functional Encryption with Polynomial Loss. | 10 | 0.45 | 2016 |
| Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. | 18 | 0.54 | 2016 |
| On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. | 4 | 0.40 | 2015 |
| Certificateless Proxy Re-Encryption Without Pairing: Revisited | 3 | 0.39 | 2015 |
| Certificateless Proxy Re-Encryption Without Pairing. | 0 | 0.34 | 2014 |
