| Publication | Date of Publication | Type |
|---|
Perfectly secure fluid MPC with abort and linear communication complexity
IACR Communications in Cryptology | 2026-09-09 | Paper |
| Towards scalable YOSO MPC via packed secret-sharing | 2026-04-23 | Paper |
| \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning | 2026-02-06 | Paper |
| Phoenix: secure computation in an unstable network with dropouts and comebacks | 2024-11-22 | Paper |
| LERNA: secure single-server aggregation via key-homomorphic masking | 2024-08-30 | Paper |
On linear communication complexity for (maximally) fluid MPC
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
\textsc{SuperPack}: dishonest majority MPC with constant online communication
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Prio+: privacy preserving aggregate statistics via Boolean shares
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Sharing transformation and dishonest majority MPC with packed secret sharing
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Kicking-the-bucket: fast privacy-preserving trading using buckets
Financial Cryptography and Data Security | 2023-05-26 | Paper |
| ATLAS: efficient and scalable MPC in the honest majority setting | 2022-04-22 | Paper |
| Unconditional communication-efficient MPC via Hall's marriage theorem | 2022-04-22 | Paper |
| Succinct non-interactive secure computation | 2022-03-23 | Paper |
| Constant-overhead unconditionally secure multiparty computation over binary fields | 2021-12-08 | Paper |
Round-optimal secure multi-party computation
Journal of Cryptology | 2021-07-30 | Paper |
| Limits of practical sublinear secure computation | 2020-06-30 | Paper |
More is less: perfectly secure oblivious algorithms in the multi-server setting
(available as arXiv preprint) | 2019-01-23 | Paper |
| Two-round adaptively secure multiparty computation from standard assumptions | 2018-12-11 | Paper |
Round-optimal secure multi-party computation
Lecture Notes in Computer Science | 2018-09-26 | Paper |
| Four round secure computation without setup | 2018-01-19 | Paper |
| Laconic oblivious transfer and its applications | 2017-11-15 | Paper |
Constant round adaptively secure protocols in the tamper-proof hardware model
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Theory of Cryptography | 2016-12-21 | Paper |
On the communication required for unconditionally secure multiplication
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
The Exact Round Complexity of Secure Computation
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Adaptively secure multi-party computation from LWE (via equivocal FHE)
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Efficient leakage resilient circuit compilers
Lecture Notes in Computer Science | 2016-03-02 | Paper |
Efficient multi-party computation: from passive to active security via secure SIMD circuits
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Theory of Cryptography | 2015-07-06 | Paper |
A coding-theoretic approach to recovering noisy RSA keys
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
