| Publication | Date of Publication | Type |
|---|
| Efficient MPC with a Mixed Adversary | 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) | 2017-09-29 | Paper |
| Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions | 2017-01-06 | Paper |
| Network-Hiding Communication and Applications to Multi-party Protocols | 2016-10-27 | Paper |
| Anonymous Authentication with Shared Secrets | 2015-09-17 | Paper |
| Optimally efficient multi-valued byzantine agreement | 2015-03-10 | Paper |
| On the theoretical gap between synchronous and asynchronous MPC protocols | 2015-03-02 | Paper |
| Multi-valued Byzantine Broadcast: The t < n Case | 2015-01-06 | Paper |
| Key-Indistinguishable Message Authentication Codes | 2014-10-14 | Paper |
| Broadcast Amplification | 2014-02-18 | Paper |
| Efficient General-Adversary Multi-Party Computation | 2013-12-10 | Paper |
| A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation | 2013-09-17 | Paper |
| On the Complexity of Broadcast Setup | 2013-08-06 | Paper |
| Resource-Restricted Indifferentiability | 2013-05-31 | Paper |
| Passive Corruption in Statistical Multi-Party Computation | 2012-11-06 | Paper |
| Player-Centric Byzantine Agreement | 2011-07-06 | Paper |
| Graceful Degradation in Multi-Party Computation (Extended Abstract) | 2011-05-19 | Paper |
| Receipt-Free K-out-of-L Voting Based on ElGamal Encryption | 2010-06-17 | Paper |
| Adaptively Secure Broadcast | 2010-06-01 | Paper |
| MPC vs. SFE : Unconditional and Computational Security | 2009-02-10 | Paper |
| Asynchronous Multi-Party Computation with Quadratic Communication | 2008-08-19 | Paper |
| Simple and Efficient Perfectly-Secure Asynchronous MPC | 2008-05-15 | Paper |
| Efficient Byzantine Agreement with Faulty Minority | 2008-05-15 | Paper |
| Cryptographic Asynchronous Multi-party Computation with Optimal Resilience | 2008-05-06 | Paper |
| Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation | 2008-03-18 | Paper |
| Perfectly-Secure MPC with Linear Communication Complexity | 2008-03-05 | Paper |
| MPC vs. SFE: Perfect Security in a Unified Corruption Model | 2008-03-05 | Paper |
| Robust Multiparty Computation with Linear Communication Complexity | 2007-09-04 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374936 | 2006-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434868 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783721 | 2002-12-08 | Paper |
| Player simulation and general adversary structures in perfect multiparty computation | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502503 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707411 | 2001-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249325 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250770 | 1999-06-17 | Paper |
