| Publication | Date of Publication | Type |
|---|
| Round efficient Byzantine agreement from VDFs | 2025-01-10 | Paper |
| A holistic security analysis of Monero transactions | 2024-11-13 | Paper |
| Early stopping for any number of corruptions | 2024-11-13 | Paper |
| Twinkle: threshold signatures from DDH with full adaptive security | 2024-11-12 | Paper |
| Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults | 2024-08-15 | Paper |
A New Way to Achieve Round-Efficient Byzantine Agreement
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Optimal Clock Synchronization with Signatures
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Network-agnostic security comes (almost) for free in DKG and MPC
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Rai-Choo! Evolving blind signatures to the next level
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Transparent batchable time-lock puzzles and applications to Byzantine consensus
Lecture Notes in Computer Science | 2023-11-24 | Paper |
State machine replication under changing network conditions
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Efficient adaptively-secure Byzantine agreement for long messages
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
The Abe-Okamoto partially blind signature scheme revisited
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-21 | Paper |
On pairing-free blind signature schemes in the algebraic group model
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Gossiping for communication-efficient broadcast
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
(Nondeterministic) hardness vs. non-malleability
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Boosting the Security of Blind Signature Schemes
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Algebraic adversaries in the universal composability framework
Lecture Notes in Computer Science | 2023-05-12 | Paper |
\textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| MPC with synchronous security and asynchronous responsiveness | 2023-03-29 | Paper |
| Lattice-based blind signatures, revisited | 2022-11-09 | Paper |
| A classification of computational assumptions in the algebraic group model | 2022-11-09 | Paper |
| Always have a backup plan: fully secure synchronous MPC with asynchronous fallback | 2022-11-09 | Paper |
| How Byzantine is a send corruption? | 2022-11-09 | Paper |
On the (in)security of ROS
Journal of Cryptology | 2022-09-23 | Paper |
| Strong Separations Between Broadcast and Authenticated Channels | 2022-07-21 | Paper |
| On the security of time-lock puzzles and timed commitments | 2022-03-23 | Paper |
On the (in)security of ROS
Lecture Notes in Computer Science | 2021-12-08 | Paper |
| Asynchronous Byzantine agreement with subquadratic communication | 2021-12-01 | Paper |
| Synchronous consensus with optimal asynchronous fallback guarantees | 2020-04-30 | Paper |
| A modular treatment of blind signatures from identification schemes | 2020-02-04 | Paper |
| The algebraic group model and its applications | 2018-09-26 | Paper |
| Tightly-secure signatures from five-move identification protocols | 2018-02-23 | Paper |
