| 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
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
SCALES. MPC with small clients and larger ephemeral servers
Theory of Cryptography | 2023-08-14 | Paper |
PrORAM
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
Lecture Notes in Computer Science | 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
Theoretical Computer Science | 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
Lecture Notes in Computer Science | 2017-06-23 | Paper |
On cut-and-choose oblivious transfer and its variants
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Public verifiability in the covert model (almost) for free
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Towards efficient private distributed computation on unbounded input streams
Journal of Mathematical Cryptology | 2015-08-07 | Paper |
Richer Efficiency/Security Trade-offs in 2PC
Theory of Cryptography | 2015-07-06 | Paper |
Secure Key Exchange and Sessions without Credentials
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Efficient network-based enforcement of data access rights
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Flexor: Flexible garbling for XOR gates that beats free-XOR
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Amortizing Garbled Circuits
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Improved OT extension for transferring short secrets
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
Lecture Notes in Computer Science | 2012-09-25 | Paper |
MAC aggregation with message multiplicity
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A security enhancement and proof for authentication and key agreement (AKA)
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Truly efficient string oblivious transfer using resettable tamper-proof tokens
Theory of Cryptography | 2010-02-24 | Paper |
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Cryptology and Network Security | 2009-11-26 | Paper |
One-round secure comparison of integers
Journal of Mathematical Cryptology | 2009-06-12 | Paper |
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Financial Cryptography and Data Security | 2009-02-12 | Paper |
Conditional Encrypted Mapping and Comparing Encrypted Numbers
Financial Cryptography and Data Security | 2008-09-09 | Paper |
Improved Garbled Circuit: Free XOR Gates and Applications
Automata, Languages and Programming | 2008-08-19 | Paper |
Password Mistyping in Two-Factor-Authenticated Key Exchange
Automata, Languages and Programming | 2008-08-19 | Paper |
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Strong Conditional Oblivious Transfer and Computing on Intervals
| 2005-08-12 | Paper |
