| Geometry of Secure Two-party Computation. | 0 | 0.34 | 2022 |
| SIM: Secure Interval Membership Testing and Applications to Secure Comparison. | 0 | 0.34 | 2022 |
| Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes | 0 | 0.34 | 2021 |
| Efficient Distributed Coin-Tossing Protocols | 0 | 0.34 | 2021 |
| Optimally-Secure Coin-Tossing Against A Byzantine Adversary | 0 | 0.34 | 2021 |
| Computational Hardness Of Optimal Fair Computation: Beyond Minicrypt | 0 | 0.34 | 2021 |
| Lower Bounds For Leakage-Resilient Secret-Sharing Schemes Against Probing Attacks | 0 | 0.34 | 2021 |
| Coin Tossing with Lazy Defense: Hardness of Computation Results. | 0 | 0.34 | 2020 |
| Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing. | 0 | 0.34 | 2020 |
| Secure Non-interactive Simulation: Hardness & Feasibility. | 0 | 0.34 | 2020 |
| Explicit Rate-1 Non-malleable Codes for Local Tampering. | 0 | 0.34 | 2019 |
| Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness | 0 | 0.34 | 2019 |
| Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions) | 0 | 0.34 | 2018 |
| Non-malleable Codes Against Lookahead Tampering. | 0 | 0.34 | 2018 |
| Secure Computation with Constant Communication Overhead using Multiplication Embeddings. | 0 | 0.34 | 2018 |
| Constant-rate Non-malleable Codes in the Split-state Model. | 2 | 0.37 | 2017 |
| Secure Computation Based on Leaky Correlations: High Resilience Setting. | 2 | 0.37 | 2017 |
| Bounded-Communication Leakage Resilience via Parity-Resilient Circuits | 2 | 0.37 | 2016 |
| Optimal Computational Split-state Non-malleable Codes. | 17 | 0.89 | 2016 |
| Secure Computation from Elastic Noisy Channels. | 4 | 0.40 | 2016 |
| All Complete Functionalities are Reversible. | 0 | 0.34 | 2016 |
| On the Security and Usability of Segment-based Visual Cryptographic Authentication Protocols. | 0 | 0.34 | 2016 |
| Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations | 15 | 0.93 | 2015 |
| Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations | 70 | 1.58 | 2015 |
| Secure Computation From Leaky Correlated Randomness | 3 | 0.37 | 2015 |
| A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations. | 3 | 0.39 | 2015 |
| Explicit Non-malleable Codes Resistant to Permutations and Perturbations. | 8 | 0.53 | 2014 |
| Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero. | 26 | 0.98 | 2014 |
| Explicit Non-Malleable Codes Resistant to Permutations. | 0 | 0.34 | 2014 |
| Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations. | 2 | 0.38 | 2014 |
| On the Power of Public-Key Encryption in Secure Computation. | 4 | 0.38 | 2014 |
| Black-Box Separations for Differentially Private Protocols. | 2 | 0.37 | 2014 |
| Single-use ot combiners with near-optimal resilience | 0 | 0.34 | 2014 |
| A Full Characterization of Completeness for Two-party Randomized Function Evaluation. | 6 | 0.42 | 2014 |
| A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. | 10 | 0.50 | 2012 |
| Limits of random oracles in secure computation | 3 | 0.39 | 2012 |
| The limits of common coins: further results | 0 | 0.34 | 2011 |
| Exploring the limits of common coins using frontier analysis of protocols | 7 | 0.51 | 2011 |
| Stateless Cryptographic Protocols | 9 | 0.45 | 2011 |
| A Zero-One Law for Deterministic 2-Party Secure Computation | 2 | 0.39 | 2010 |
| Cryptographic Complexity Classes and Computational Intractability Assumptions | 9 | 0.48 | 2010 |
| On the Computational Complexity of Coin Flipping | 8 | 0.56 | 2010 |
| A zero-one law for cryptographic complexity with respect to computational UC security | 17 | 0.58 | 2010 |
| Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance. | 60 | 2.04 | 2008 |
| Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation | 0 | 0.34 | 2008 |
| Theory of alignment generators and applications to statistical machine translation | 2 | 0.37 | 2005 |
