| Publication | Date of Publication | Type |
|---|
Synchronous distributed key generation without broadcasts
IACR Communications in Cryptology | 2026-08-25 | Paper |
| Context-dependent threshold decryption and its applications | 2026-04-23 | Paper |
| Leader election with poly-logarithmic communication per party | 2026-02-04 | Paper |
| Lumiere: making optimal BFT for partial synchrony practical | 2025-06-13 | Paper |
| Player-replaceability and forensic support are two sides of the same (crypto) coin | 2024-07-17 | Paper |
OptORAMa: Optimal oblivious RAM
Journal of the ACM | 2024-07-04 | Paper |
| Bucket oblivious sort: an extremely simple oblivious sort | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7832768 (Why is no real title available?) | 2024-04-15 | Paper |
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Good-case Latency of Byzantine Broadcast
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774313 (Why is no real title available?) | 2023-12-08 | Paper |
Transparent batchable time-lock puzzles and applications to Byzantine consensus
Lecture Notes in Computer Science | 2023-11-24 | Paper |
| Improved extension protocols for Byzantine broadcast and agreement | 2023-11-02 | Paper |
| Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency | 2023-11-02 | Paper |
Efficient adaptively-secure Byzantine agreement for long messages
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
| Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. | 2023-07-03 | Paper |
Communication complexity of Byzantine agreement, revisited
Distributed Computing | 2023-03-14 | Paper |
| OptORAMa: optimal oblivious RAM | 2022-03-23 | Paper |
Locality-preserving oblivious RAM
Journal of Cryptology | 2022-03-03 | Paper |
| Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience | 2021-03-17 | Paper |
Communication Complexity of Byzantine Agreement, Revisited
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Locality-preserving oblivious RAM
Advances in Cryptology – EUROCRYPT 2019 | 2020-02-06 | Paper |
More is less: perfectly secure oblivious algorithms in the multi-server setting
(available as arXiv preprint) | 2019-01-23 | Paper |
| Perfectly secure oblivious parallel RAM | 2018-12-06 | Paper |
Asymptotically tight bounds for composing ORAM with PIR
Lecture Notes in Computer Science | 2017-06-13 | Paper |
