| Publication | Date of Publication | Type |
|---|
| Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited | 2024-08-15 | Paper |
| Universally composable almost-everywhere secure computation | 2024-06-25 | Paper |
| Bitcoin as a Transaction Ledger: A Composable Treatment | 2024-04-21 | Paper |
| PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography | 2024-03-14 | Paper |
| Completeness theorems for adaptively secure broadcast | 2024-02-02 | Paper |
| Etherless Ethereum Tokens: simulating native tokens in Ethereum | 2023-04-21 | Paper |
| On the (Ir)replaceability of global setups, or how (not) to use a global ledger | 2023-04-13 | Paper |
| A rational protocol treatment of 51\% attacks | 2022-04-22 | Paper |
| Universal composition with global subroutines: capturing global setup within plain UC | 2022-03-23 | Paper |
| Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era | 2022-03-23 | Paper |
| Broadcast-optimal two-round MPC | 2022-03-23 | Paper |
| Dynamic ad hoc clock synchronization | 2021-12-08 | Paper |
| Round-preserving parallel composition of probabilistic-termination cryptographic protocols | 2021-06-28 | Paper |
| Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era | 2021-02-23 | Paper |
| Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols | 2020-05-27 | Paper |
| Probabilistic termination and composability of cryptographic protocols | 2019-08-13 | Paper |
| Secure two-party computation over unreliable channels | 2018-10-17 | Paper |
| Fair distributed computation of reactive functions | 2018-08-24 | Paper |
| But why does it work? A rational protocol design treatment of bitcoin | 2018-07-09 | Paper |
| Provably Secure Virus Detection: Using The Observer Effect Against Malware. | 2017-12-19 | Paper |
| Bitcoin as a transaction ledger: a composable treatment | 2017-11-03 | Paper |
| The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
| The Hidden Graph Model | 2017-05-19 | Paper |
| Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions | 2017-01-06 | Paper |
| Probabilistic Termination and Composability of Cryptographic Protocols | 2016-11-09 | Paper |
| Network-Hiding Communication and Applications to Multi-party Protocols | 2016-10-27 | Paper |
| Fair and Robust Multi-party Computation Using a Global Transaction Ledger | 2016-07-15 | Paper |
| How fair is your protocol? A utility-based approach to protocol optimality | 2016-03-23 | Paper |
| Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting | 2015-12-10 | Paper |
| Distributing the setup in universally composable multi-party computation | 2015-09-03 | Paper |
| Efficient Three-Party Computation from Cut-and-Choose | 2014-08-07 | Paper |
| Secure Multi-Party Computation with Identifiable Abort | 2014-08-07 | Paper |
| Feasibility and Completeness of Cryptographic Tasks in the Quantum World | 2013-03-18 | Paper |
| Universally Composable Synchronous Computation | 2013-03-18 | Paper |
| Byzantine Agreement with a Rational Adversary | 2012-11-01 | Paper |
| Collusion-Preserving Computation | 2012-09-25 | Paper |
| Player-Centric Byzantine Agreement | 2011-07-06 | Paper |
| Adaptively Secure Broadcast | 2010-06-01 | Paper |
| Realistic Failures in Secure Multi-party Computation | 2009-03-03 | Paper |
| MPC vs. SFE : Unconditional and Computational Security | 2009-02-10 | Paper |
| MPC vs. SFE: Perfect Security in a Unified Corruption Model | 2008-03-05 | Paper |
