| Publication | Date of Publication | Type |
|---|
| Malicious secure, structure-aware private set intersection | 2024-02-02 | Paper |
| How to obfuscate MPC inputs | 2023-08-14 | Paper |
| Finding one common item, privately | 2023-07-25 | Paper |
| Structure-aware private set intersection, with applications to fuzzy matching | 2023-06-12 | Paper |
| Batching base oblivious transfers | 2023-05-12 | Paper |
| Oblivious key-value stores and amplification for private set intersection | 2022-04-22 | Paper |
| Three halves make a whole? Beating the half-gates lower bound for garbled circuits | 2022-03-31 | Paper |
| PSI from PaXoS: fast, malicious private set intersection | 2022-03-23 | Paper |
| Private set operations from oblivious switching | 2021-12-21 | Paper |
| SWiM: secure wildcard pattern matching from OT extension | 2021-03-17 | Paper |
| Optimizing authenticated garbling for faster secure two-party computation | 2020-06-30 | Paper |
| Scalable private set union from symmetric-key techniques | 2020-05-05 | Paper |
| Characterizing collision and second-preimage resistance in Linicrypt | 2020-04-30 | Paper |
| SpOT-light: lightweight private set intersection from sparse OT extension | 2020-03-09 | Paper |
| On the structure of unconditional UC hybrid protocols | 2018-12-06 | Paper |
| Improvements for gate-hiding garbled circuits | 2018-04-26 | Paper |
| Reconciling non-malleability with homomorphic encryption | 2017-10-12 | Paper |
| Non-interactive Secure 2PC in the Offline/Online and Batch Settings | 2017-06-23 | Paper |
| Improved Private Set Intersection Against Malicious Adversaries | 2017-06-13 | Paper |
| Sublinear Zero-Knowledge Arguments for RAM Programs | 2017-06-13 | Paper |
| Linicrypt: A Model for Practical Cryptography | 2016-11-09 | Paper |
| Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost | 2015-12-10 | Paper |
| How to Efficiently Evaluate RAM Programs with Malicious Security | 2015-09-30 | Paper |
| Richer Efficiency/Security Trade-offs in 2PC | 2015-07-06 | Paper |
| A Unified Characterization of Completeness and Triviality for Secure Function Evaluation | 2014-08-20 | Paper |
| FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR | 2014-08-07 | Paper |
| Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction | 2013-05-31 | Paper |
| Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities | 2013-03-18 | Paper |
| Universal Composability from Essentially Any Trusted Setup | 2012-09-25 | Paper |
| Must You Know the Code of f to Securely Compute f? | 2012-09-25 | Paper |
| Exploring the Limits of Common Coins Using Frontier Analysis of Protocols | 2011-05-19 | Paper |
| Attribute-Based Signatures | 2011-02-11 | Paper |
| A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security | 2010-08-24 | Paper |
| Rerandomizable RCCA Encryption | 2009-03-10 | Paper |
| Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation | 2009-03-03 | Paper |
| Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations | 2009-02-10 | Paper |
| Towards Robust Computation on Encrypted Data | 2009-02-10 | Paper |
| Homomorphic Encryption with CCA Security | 2008-08-19 | Paper |
