| Publication | Date of Publication | Type |
|---|
| Rumors MPC: GOD for dynamic committees, low communication via constant-round chat | 2026-04-23 | Paper |
Proofs of sequential communication delays from physical assumptions and their applications
Cryptography and Communications | 2025-10-15 | Paper |
| Universally composable interactive and ordered multi-signatures | 2025-07-29 | Paper |
| Updatable privacy-preserving blueprints | 2025-07-23 | Paper |
| CaSCaDE: (time-based) Cryptography from Space Communications DElay | 2025-01-10 | Paper |
| MUSEN: aggregatable key-evolving verifiable random functions and applications | 2025-01-10 | Paper |
| Publicly verifiable secret sharing over class groups and applications to DKG and YOSO | 2024-11-13 | Paper |
| Eagle: efficient privacy preserving smart contracts | 2024-07-17 | Paper |
Perfect MPC over layered graphs
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
Lecture Notes in Computer Science | 2023-11-24 | Paper |
PAPR: publicly auditable privacy revocation for anonymous credentials
Topics in Cryptology – CT-RSA 2023 | 2023-10-04 | Paper |
YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
(Public) verifiability for composable protocols without adaptivity or zero-knowledge
Provable and Practical Security | 2023-07-21 | Paper |
| ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing | 2023-03-29 | Paper |
| Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model | 2023-03-22 | Paper |
| FAST: fair auctions via secret transactions | 2022-11-09 | Paper |
| SCRAPE: scalable randomness attested by public entities | 2022-07-01 | Paper |
| P2DEX: privacy-preserving decentralized cryptocurrency exchange | 2022-03-21 | Paper |
| TARDIS: a foundation of time-lock puzzles in UC | 2021-12-08 | Paper |
| Insured MPC: efficient secure computation with financial penalties | 2021-02-08 | Paper |
| Efficient UC commitment extension with homomorphism for free (and applications) | 2020-05-05 | Paper |
| 21 -- bringing down the complexity: fast composable protocols for card games without secret state | 2018-09-26 | Paper |
| Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain | 2018-07-09 | Paper |
| Ouroboros: a provably secure proof-of-stake blockchain protocol | 2017-11-03 | Paper |
Rate-1, linear time and additively homomorphic UC commitments
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Constant-size structure-preserving signatures: generic constructions and simple assumptions
Journal of Cryptology | 2016-10-13 | Paper |
Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
Provable Security | 2016-01-27 | Paper |
Generalizing efficient multiparty computation
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Additively homomorphic UC commitments with optimal amortized overhead
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Universally composable oblivious transfer based on a variant of LPN
Cryptology and Network Security | 2015-02-10 | Paper |
Compact VSS and efficient homomorphic UC commitments
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Tagged one-time signatures: tight security and optimal tag size
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Constant-size structure-preserving signatures: generic constructions and simple assumptions
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Universally composable private proximity testing
Provable Security | 2011-09-16 | Paper |
