| Publication | Date of Publication | Type |
|---|
| Multi-threshold asynchronous reliable broadcast and consensus | 2026-03-31 | Paper |
| Anamorphic encryption, revisited | 2024-11-12 | Paper |
| Efficient MPC with a Mixed Adversary | 2023-11-02 | Paper |
| From partial to global asynchronous reliable broadcast | 2023-11-02 | Paper |
| Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus | 2023-11-02 | Paper |
| On communication-efficient asynchronous MPC with adaptive security | 2023-04-13 | Paper |
| Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback | 2023-03-31 | Paper |
| Adaptive security of multi-party protocols, revisited | 2023-03-31 | Paper |
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Constant-round asynchronous multi-party computation based on one-way functions
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Network-Hiding Communication and Applications to Multi-party Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Anonymous authentication with shared secrets
Progress in Cryptology - LATINCRYPT 2014 | 2015-09-17 | Paper |
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Multi-valued Byzantine broadcast: the \(t < n\) case
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Key-indistinguishable message authentication codes
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Broadcast amplification
Theory of Cryptography | 2014-02-18 | Paper |
Efficient general-adversary multi-party computation
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
On the complexity of broadcast setup
Automata, Languages, and Programming | 2013-08-06 | Paper |
Resource-restricted indifferentiability
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Passive corruption in statistical multi-party computation. (Extended abstract)
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Player-centric Byzantine agreement
Automata, Languages and Programming | 2011-07-06 | Paper |
Graceful degradation in multi-party computation. (Extended abstract)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
Towards Trustworthy Elections | 2010-06-17 | Paper |
Adaptively secure broadcast
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
MPC vs. SFE : Unconditional and Computational Security
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Asynchronous Multi-Party Computation with Quadratic Communication
Automata, Languages and Programming | 2008-08-19 | Paper |
Efficient Byzantine Agreement with Faulty Minority
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Simple and Efficient Perfectly-Secure Asynchronous MPC
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Perfectly-Secure MPC with Linear Communication Complexity
Theory of Cryptography | 2008-03-05 | Paper |
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Theory of Cryptography | 2008-03-05 | Paper |
Robust Multiparty Computation with Linear Communication Complexity
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
| Efficent receipt-free voting based on homomorphic encryption | 2006-03-01 | Paper |
| scientific article; zbMATH DE number 2009948 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 1842487 (Why is no real title available?) | 2002-12-08 | Paper |
Player simulation and general adversary structures in perfect multiparty computation
Journal of Cryptology | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1504552 (Why is no real title available?) | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1583776 (Why is no real title available?) | 2001-07-03 | Paper |
| scientific article; zbMATH DE number 1304080 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1302842 (Why is no real title available?) | 1999-06-17 | Paper |
