| Publication | Date of Publication | Type |
|---|
| Malicious security for SCALES. Outsourced computation with ephemeral servers | 2024-12-13 | Paper |
| Garbled circuit lookup tables with logarithmic number of ciphertexts | 2024-11-13 | Paper |
| Tri-state circuits. A circuit model that captures RAM | 2024-02-06 | Paper |
| SCALES. MPC with small clients and larger ephemeral servers | 2023-08-14 | Paper |
| PrORAM | 2023-05-26 | Paper |
| Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation | 2023-05-12 | Paper |
| \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication | 2023-03-29 | Paper |
| Stacked garbling. Garbled circuit proportional to longest execution path | 2022-11-09 | Paper |
| \textsc{EpiGRAM}: practical garbled RAM | 2022-08-30 | Paper |
| Garbled circuits with sublinear evaluator | 2022-08-30 | Paper |
| Masked triples. Amortizing multiplication triples across conditionals | 2021-12-21 | Paper |
| \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation | 2021-12-08 | Paper |
| Stacked garbling for disjunctive zero-knowledge proofs | 2021-12-01 | Paper |
| SWiM: secure wildcard pattern matching from OT extension | 2021-03-17 | Paper |
| Scalable private set union from symmetric-key techniques | 2020-05-05 | Paper |
| Covert security with public verifiability: faster, leaner, and simpler | 2020-02-04 | Paper |
| Perennial secure multi-party computation of universal Turing machine | 2019-04-23 | Paper |
| Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free | 2019-01-23 | Paper |
| Overlaying conditional circuit clauses for secure computation | 2018-03-08 | Paper |
| Hashing Garbled Circuits for Free | 2017-06-23 | Paper |
| On Cut-and-Choose Oblivious Transfer and Its Variants | 2016-06-10 | Paper |
| Public Verifiability in the Covert Model (Almost) for Free | 2016-03-23 | Paper |
| Towards efficient private distributed computation on unbounded input streams | 2015-08-07 | Paper |
| Richer Efficiency/Security Trade-offs in 2PC | 2015-07-06 | Paper |
| Secure Key Exchange and Sessions without Credentials | 2014-10-14 | Paper |
| Efficient Network-Based Enforcement of Data Access Rights | 2014-10-14 | Paper |
| FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR | 2014-08-07 | Paper |
| Amortizing Garbled Circuits | 2014-08-07 | Paper |
| Improved OT Extension for Transferring Short Secrets | 2013-09-17 | Paper |
| Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits | 2012-09-25 | Paper |
| MAC Aggregation with Message Multiplicity | 2012-09-25 | Paper |
| A security enhancement and proof for authentication and key agreement (AKA) | 2010-09-10 | Paper |
| Truly efficient string oblivious transfer using resettable tamper-proof tokens | 2010-02-24 | Paper |
| Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima | 2009-11-26 | Paper |
| One-round secure comparison of integers | 2009-06-12 | Paper |
| A Practical Universal Circuit Construction and Secure Evaluation of Private Functions | 2009-02-12 | Paper |
| Conditional Encrypted Mapping and Comparing Encrypted Numbers | 2008-09-09 | Paper |
| Improved Garbled Circuit: Free XOR Gates and Applications | 2008-08-19 | Paper |
| Password Mistyping in Two-Factor-Authenticated Key Exchange | 2008-08-19 | Paper |
| Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation | 2008-03-18 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Strong Conditional Oblivious Transfer and Computing on Intervals | 2005-08-12 | Paper |
