| 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
Journal of Cryptology | 2024-04-21 | Paper |
| PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography | 2024-03-14 | Paper |
Completeness theorems for adaptively secure broadcast
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Etherless Ethereum Tokens: simulating native tokens in Ethereum
Journal of Computer and System Sciences | 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
Journal of Cryptology | 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
Journal of Cryptology | 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: communication locality and optimal resiliency with adaptive faults
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Constant-round asynchronous multi-party computation based on one-way functions
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Probabilistic Termination and Composability of Cryptographic Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Network-Hiding Communication and Applications to Multi-party Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Fair and robust multi-party computation using a global transaction ledger
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
How fair is your protocol? A utility-based approach to protocol optimality
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Incoercible multi-party computation and universally composable receipt-free voting
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Distributing the setup in universally composable multi-party computation
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Efficient three-party computation from cut-and-choose
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Secure multi-party computation with identifiable abort
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Feasibility and completeness of cryptographic tasks in the quantum world
Theory of Cryptography | 2013-03-18 | Paper |
Universally composable synchronous computation
Theory of Cryptography | 2013-03-18 | Paper |
Byzantine agreement with a rational adversary
Automata, Languages, and Programming | 2012-11-01 | Paper |
Collusion-preserving computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Player-centric Byzantine agreement
Automata, Languages and Programming | 2011-07-06 | Paper |
Adaptively secure broadcast
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Realistic Failures in Secure Multi-party Computation
Theory of Cryptography | 2009-03-03 | Paper |
MPC vs. SFE : Unconditional and Computational Security
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Theory of Cryptography | 2008-03-05 | Paper |
