| Publication | Date of Publication | Type |
|---|
| Black-box (and fast) non-malleable zero knowledge | 2024-12-13 | Paper |
| MPC with delayed parties over star-like networks | 2024-08-30 | Paper |
| ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\) | 2024-08-30 | Paper |
| Scooby: improved multi-party homomorphic secret sharing based on FHE | 2024-03-27 | Paper |
| Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head | 2024-02-06 | Paper |
| Four-round black-box non-malleable schemes from one-way permutations | 2023-08-14 | Paper |
| Scooby: improved multi-party homomorphic secret sharing based on FHE | 2023-07-25 | Paper |
| Efficient proof of RAM programs from any public-coin zero-knowledge system | 2023-07-25 | Paper |
| Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT | 2023-03-22 | Paper |
| Efficient constant-round MPC with identifiable abort and public verifiability | 2022-11-09 | Paper |
| Tightly secure ring-LWE based key encapsulation with short ciphertexts | 2022-08-25 | Paper |
| Faster Secure Multi-party Computation of AES and DES Using Lookup Tables | 2022-07-01 | Paper |
| TinyKeys: a new approach to efficient multi-party computation | 2022-04-11 | Paper |
| Banquet: short and fast signatures from AES | 2021-12-21 | Paper |
| Compilation of function representations for secure computing paradigms | 2021-12-20 | Paper |
| Large scale, actively secure computation from LPN and free-XOR garbled circuits | 2021-12-08 | Paper |
| Efficient, actively secure MPC with a dishonest majority: a survey | 2021-10-04 | Paper |
| High-performance multi-party computation for binary circuits based on oblivious transfer | 2021-08-10 | Paper |
| Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption | 2020-08-05 | Paper |
| BBQ: using AES in Picnic signatures | 2020-07-21 | Paper |
| TinyKeys: a new approach to efficient multi-party computation | 2020-06-30 | Paper |
| Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) | 2019-01-23 | Paper |
| On the Shape of the General Error Locator Polynomial for Cyclic Codes | 2018-09-19 | Paper |
| Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection | 2017-04-12 | Paper |
| Efficient Secure Multiparty Computation with Identifiable Abort | 2016-12-21 | Paper |
| Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing | 2016-10-21 | Paper |
| A Unified Approach to MPC with Preprocessing Using OT | 2016-06-10 | Paper |
| Actively Secure OT Extension with Optimal Overhead | 2015-12-10 | Paper |
| Bootstrapping BGV Ciphertexts with a Wider Choice of $$p$$ and $$q$$ | 2015-08-27 | Paper |
| Dishonest Majority Multi-Party Computation for Binary Circuits | 2014-08-07 | Paper |
| Between a Rock and a Hard Place: Interpolating between MPC and FHE | 2013-12-10 | Paper |
| Improved decoding of affine-variety codes | 2012-10-19 | Paper |
| COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES | 2010-05-21 | Paper |
| Decoding Cyclic Codes: the Cooper Philosophy | 2009-12-16 | Paper |
| An Introduction to Linear and Cyclic Codes | 2009-12-16 | Paper |
| Gröbner Bases for the Distance Distribution of Systematic Codes | 2009-12-16 | Paper |
| Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy | 2009-01-22 | Paper |
| General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula> | 2008-12-21 | Paper |
| Correcting errors and erasures via the syndrome variety | 2005-06-23 | Paper |
