| Publication | Date of Publication | Type |
|---|
| Cheater identification on a budget: MPC with identifiable abort from pairwise MACs | 2024-12-13 | Paper |
| Succinct homomorphic secret sharing | 2024-11-13 | Paper |
| Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus | 2024-08-30 | Paper |
| Multiparty computation with covert security and public verifiability | 2024-06-25 | Paper |
Scooby: improved multi-party homomorphic secret sharing based on FHE
Information and Computation | 2024-03-27 | Paper |
Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Sok: vector OLE-based zero-knowledge protocols
Designs, Codes and Cryptography | 2023-11-07 | Paper |
Scooby: improved multi-party homomorphic secret sharing based on FHE
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
An algebraic framework for silent preprocessing with trustless setup and active security
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Le Mans: dynamic and fluid MPC for dishonest majority
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Efficient protocols for oblivious linear function evaluation from ring-LWE | 2022-12-16 | Paper |
| Efficient pseudorandom correlation generators from ring-LPN | 2022-11-09 | Paper |
| Efficient constant-round MPC with identifiable abort and public verifiability | 2022-11-09 | Paper |
| Improved primitives for MPC over mixed arithmetic-binary circuits | 2022-11-09 | Paper |
| Distributed (correlation) samplers: how to remove a trusted dealer in one round | 2022-08-30 | Paper |
Low-communication multiparty triple generation for SPDZ from ring-LPN
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
On the bottleneck complexity of MPC with correlated randomness
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
| Faster secure multi-party computation of AES and DES using lookup tables | 2022-07-01 | Paper |
| Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] | 2022-05-18 | Paper |
| \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions | 2022-05-18 | Paper |
TinyKeys: a new approach to efficient multi-party computation
Journal of Cryptology | 2022-04-11 | Paper |
| Banquet: short and fast signatures from AES | 2021-12-21 | Paper |
| Oblivious TLS via multi-party computation | 2021-12-20 | Paper |
| The rise of Paillier: homomorphic secret sharing and public-key silent OT | 2021-12-08 | Paper |
High-performance multi-party computation for binary circuits based on oblivious transfer
Journal of Cryptology | 2021-08-10 | Paper |
Low cost constant round MPC combining BMR and oblivious transfer
Journal of Cryptology | 2020-11-06 | Paper |
TinyKeys: a new approach to efficient multi-party computation
Lecture Notes in Computer Science | 2020-06-30 | Paper |
| Efficient pseudorandom correlation generators: silent OT extension and more | 2020-03-09 | Paper |
| Homomorphic secret sharing from lattices without FHE | 2020-02-06 | Paper |
| Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) | 2019-01-23 | Paper |
| \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority | 2018-09-26 | Paper |
| Compact zero-knowledge proofs of small Hamming weight | 2018-05-29 | Paper |
| Extending oblivious transfer with low communication via key-homomorphic PRFs | 2018-05-16 | Paper |
| When it's all just too much: outsourcing MPC-preprocessing | 2018-04-20 | Paper |
Low cost constant round MPC combining BMR and oblivious transfer
Advances in Cryptology – ASIACRYPT 2017 | 2018-04-06 | Paper |
Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
Topics in Cryptology – CT-RSA 2017 | 2017-04-12 | Paper |
Efficient secure multiparty computation with identifiable abort
Theory of Cryptography | 2016-12-21 | Paper |
A Unified Approach to MPC with Preprocessing Using OT
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Actively secure OT extension with optimal overhead
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Efficient, oblivious data structures for MPC
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
Lecture Notes in Computer Science | 2014-10-16 | Paper |
Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
Cryptography and Coding | 2011-12-16 | Paper |
| Modelling of micro clusters | 2008-12-30 | Paper |
| scientific article; zbMATH DE number 2209742 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2089589 (Why is no real title available?) | 2004-08-12 | Paper |
