| Publication | Date of Publication | Type |
|---|
| Lower bounds for garbled circuits from Shannon-type information inequalities | 2026-02-04 | Paper |
| How to tolerate typos in strong asymmetric PAKE | 2026-02-04 | Paper |
| The joy of cryptography. An undergraduate course in provable security | 2025-11-25 | Paper |
Malicious secure, structure-aware private set intersection
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
How to obfuscate MPC inputs
Theory of Cryptography | 2023-08-14 | Paper |
Finding one common item, privately
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Structure-aware private set intersection, with applications to fuzzy matching
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Batching base oblivious transfers
Lecture Notes in Computer Science | 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
Journal of Cryptology | 2017-10-12 | Paper |
Non-interactive secure 2PC in the offline/online and batch settings
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Improved private set intersection against malicious adversaries
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Sublinear zero-knowledge arguments for RAM programs
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Linicrypt: a model for practical cryptography
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
Lecture Notes in Computer Science | 2015-12-10 | Paper |
How to efficiently evaluate RAM programs with malicious security
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Richer Efficiency/Security Trade-offs in 2PC
Theory of Cryptography | 2015-07-06 | Paper |
A unified characterization of completeness and triviality for secure function evaluation
Lecture Notes in Computer Science | 2014-08-20 | Paper |
Flexor: Flexible garbling for XOR gates that beats free-XOR
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Multi-party computation of polynomials and branching programs without simultaneous interaction
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
Theory of Cryptography | 2013-03-18 | Paper |
Universal composability from essentially any trusted setup
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Must you know the code of \(f\) to securely compute \(f\)?
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Exploring the limits of common coins using frontier analysis of protocols
Theory of Cryptography | 2011-05-19 | Paper |
Attribute-based signatures
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
A zero-one law for cryptographic complexity with respect to computational UC security
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Rerandomizable RCCA Encryption
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Theory of Cryptography | 2009-03-03 | Paper |
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Towards Robust Computation on Encrypted Data
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Homomorphic Encryption with CCA Security
Automata, Languages and Programming | 2008-08-19 | Paper |
