| Low-Complexity Weak Pseudorandom Functions In Ac0[Mod2] | 0 | 0.34 | 2021 |
| Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party | 0 | 0.34 | 2021 |
| Lightweight Techniques for Private Heavy Hitters | 2 | 0.36 | 2021 |
| Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation | 0 | 0.34 | 2021 |
| Sublinear Gmw-Style Compiler For Mpc With Preprocessing | 1 | 0.35 | 2021 |
| Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement | 0 | 0.34 | 2020 |
| Cryptography from Information Loss. | 0 | 0.34 | 2020 |
| Efficient Pseudorandom Correlation Generators from Ring-LPN. | 0 | 0.34 | 2020 |
| How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs. | 0 | 0.34 | 2019 |
| Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs | 0 | 0.34 | 2019 |
| Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. | 2 | 0.35 | 2019 |
| Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. | 2 | 0.36 | 2019 |
| Adversarially Robust Property-Preserving Hash Functions. | 0 | 0.34 | 2019 |
| Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. | 0 | 0.34 | 2019 |
| Homomorphic Secret Sharing from Lattices Without FHE. | 1 | 0.35 | 2019 |
| Permuted Puzzles and Cryptographic Hardness. | 0 | 0.34 | 2019 |
| Compressing Vector OLE. | 1 | 0.35 | 2019 |
| Limits of Practical Sublinear Secure Computation. | 0 | 0.34 | 2018 |
| Must the Communication Graph of MPC Protocols be an Expander? | 0 | 0.34 | 2018 |
| Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. | 0 | 0.34 | 2018 |
| Exploring the Boundaries of Topology-Hiding Computation. | 2 | 0.38 | 2018 |
| The Bottleneck Complexity of Secure Multiparty Computation. | 0 | 0.34 | 2018 |
| Function Secret Sharing: Improvements and Extensions. | 6 | 0.42 | 2018 |
| Recent Advances in Function and Homomorphic Secret Sharing - (Invited Talk). | 0 | 0.34 | 2017 |
| Foundations of Homomorphic Secret Sharing. | 3 | 0.39 | 2017 |
| Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. | 7 | 0.42 | 2017 |
| Homomorphic Secret Sharing: Optimizations and Applications. | 0 | 0.34 | 2017 |
| Can We Access a Database Both Locally and Privately? | 0 | 0.34 | 2017 |
| Is There An Oblivious Ram Lower Bound? | 8 | 0.46 | 2016 |
| Oblivious Parallel RAM and Applications. | 19 | 0.63 | 2016 |
| Breaking the Circuit Size Barrier for Secure Computation Under DDH. | 12 | 0.51 | 2016 |
| Limits of Extractability Assumptions with Distributional Auxiliary Input. | 19 | 0.60 | 2015 |
| Function Secret Sharing. | 36 | 1.09 | 2015 |
| Large-Scale Secure Computation: Multi-Party Computation For (Parallel) Ram Programs | 16 | 0.64 | 2015 |
| Oblivious Parallel RAM. | 8 | 0.48 | 2014 |
| Large-Scale Secure Computation. | 2 | 0.37 | 2014 |
| On Extractability Obfuscation. | 0 | 0.34 | 2014 |
| Secure Computation against Adaptive Auxiliary Information. | 13 | 0.52 | 2013 |
| Limits of Extractability Assumptions with Distributional Auxiliary Input. | 14 | 0.51 | 2013 |
| Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting | 23 | 0.72 | 2013 |
| Multiparty computation secure against continual memory leakage | 29 | 0.89 | 2012 |
| Fully Leakage-Resilient Signatures | 27 | 0.90 | 2011 |
| Leakage-resilient coin tossing | 7 | 0.46 | 2011 |
| Sequential entry in many-to-one matching markets | 1 | 0.38 | 2009 |
