Anamorphic Encryption, Revisited
Advances in Cryptology – EUROCRYPT 2024, LNCS, Springer Nature Switzerland, vol. 14652, pp. 3–32, May 2024.
Martin Hirt's Publications
Adaptive Security of Multi-Party Protocols, Revisited
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 686–716, Nov 2021.
On Communication-Efficient Asynchronous MPC with Adaptive Security
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 35–65, Nov 2021.
Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 623–653, Nov 2021.
Multi-Threshold Asynchronous Reliable Broadcast and Consensus
International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020.
Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus
International Symposium on Distributed Computing — DISC 2020, Oct 2020.
From Partial to Global Asynchronous Reliable Broadcast
International Symposium on Distributed Computing — DISC 2020, Oct 2020.
Efficient MPC with a Mixed Adversary
1st Conference on Information-Theoretic Cryptography (ITC 2020), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, vol. 163, pp. 3:1–3:23, Jun 2020.
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants
Computer and Communications Security — CCS 2018", 2018.
Network-Hiding Communication and Applications to Multi-Party Protocols
Advances in Cryptology – CRYPTO 2016, Security and Cryptology, Springer-Verlag Berlin Heidelberg, vol. 9814, pp. 335-365, Aug 2016.
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
Advances in Cryptology — ASIACRYPT 2016, Lecture Notes in Computer Science, Springer-Verlag, vol. 10032, 2016.
Multi-Valued Byzantine Broadcast: the $t < n$ Case
Advances in Cryptology — ASIACRYPT 2014, Lecture Notes in Computer Science, Springer, vol. 8874, pp. 448–465, Dec 2014.
Anonymous Authentication with Shared Secrets
Progress in Cryptology — LATINCRYPT 2014, Sep 2014.
Key-Indistinguishable Message Authentication Codes
The 9th Conference on Security and Cryptography for Networks — SCN 2014, Lecture Notes in Computer Science, Springer, vol. 8642, pp. 476–493, Sep 2014.
Broadcast Amplification
Theory of Cryptography Conference — TCC 2014, Lecture Notes in Computer Science, Springer, vol. 8349, pp. 419–439, Feb 2014.
Efficient General-Adversary Multi-Party Computation
Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8270, pp. 181-200, Dec 2013.
A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8043, pp. 203–219, Aug 2013.
On the Complexity of Broadcast Setup
Automata, Languages, and Programming — 40th International Colloquium, ICALP (1), Lecture Notes in Computer Science, Springer, vol. 7965, pp. 552–563, Jul 2013.
Resource-Restricted Indifferentiability
Advances in Cryptology — EUROCRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7881, pp. 665–684, May 2013, this is the full version.
Passive Corruption in Statistical Multi-Party Computation
The 6th International Conference on Information Theoretic Security - ICITS 2012, Lecture Notes in Computer Science, Springer-Verlag, 2012, Full Version available from http://eprint.iacr.org/2012/272.
Player-Centric Byzantine Agreement
Automata, Languages and Programming — 38th International Colloquium, ICALP 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6755, pp. 281–292, Jul 2011.
Graceful Degradation in Multi-Party Computation
The 5th International Conference on Information Theoretic Security - ICITS 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6673, pp. 163–180, 2011, Full Version available from http://eprint.iacr.org/2011/094.
On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols
Proc. of the 2010 ACM Symposium on Principles of Distributed Computing — PODC '10, pp. 211–218, Jul 2010.
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
Towards Trustworthy Elections, Lecture Notes in Computer Science, Springer-Verlag, vol. 6000, pp. 64–82, Jun 2010.
Adaptively Secure Broadcast
Advances in Cryptology — EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 466–485, May 2010.
MPC vs. SFE: Unconditional and Computational Security
Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 1–18, Dec 2008.
Asynchronous Multi-Party Computation With Quadratic Communication
Automata, Languages and Programming — ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5126, pp. 473–485, Jul 2008.
Perfectly-Secure MPC with Linear Communication Complexity
Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 213–230, Mar 2008.
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 231–250, Mar 2008.
Efficient Byzantine Agreement with Faulty Minority
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 - 409, Dec 2007.
Simple and Efficient Perfectly-Secure Asynchronous MPC
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 376–392, Dec 2007.
Robust Multiparty Computation with Linear Communication Complexity
Advances in Cryptology — CRYPTO 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4117, pp. 463–482, Aug 2006.
Optimally Efficient Multi-Valued Byzantine Agreement
Proc. 25th ACM Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006.
Efficient Multi-Party Computation with Dispute Control
Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 305–328, Mar 2006.
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Advances in Cryptology — ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 79–99, Dec 2005.
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience
Advances in Cryptology — EUROCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3494, pp. 322–340, May 2005, Full version available as Report 2004/368 at Cryptology ePrint Archive, http://eprint.iacr.org/2004/368.
Two-Threshold Broadcast and Detectable Multi-Party Computation
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 51–67, May 2003.
Detectable Byzantine Agreement Secure Against Faulty Majorities
Proc. 21st ACM Symposium on Principles of Distributed Computing — PODC 2002, pp. 118–126, Jul 2002.
Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting
PhD Thesis, ETH Zurich, 2001, Reprint as vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001.
Robustness for Free in Unconditional Multi-Party Computation
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 101–118, Aug 2001.
Efficient Secure Multi-Party Computation
Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000.
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 539–556, May 2000.
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
Journal of Cryptology, Springer-Verlag, vol. 13, no. 1, pp. 31–60, Apr 2000, Extended abstract in Proc. 16th of ACM PODC '97.
General Adversaries in Unconditional Multi-Party Computation
Advances in Cryptology — ASIACRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1716, pp. 232–246, Nov 1999.
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Advances in Cryptology — EUROCRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 311–326, May 1999.
Trading Correctness for Privacy in Unconditional Multi-Party Computation
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 121–136, Aug 1998, Corrected proceedings version.
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation
Proc. 16th ACM Symposium on Principles of Distributed Computing — PODC '97, pp. 25–34, Aug 1997.