Information Security and Cryptography Research Group

Martin Hirt's Publications

Anamorphic Encryption, Revisited

Fabio Banfi, Konstantin Gegier, Martin Hirt, Ueli Maurer, and Guilherme Rito
Advances in Cryptology – EUROCRYPT 2024, LNCS, Springer Nature Switzerland, vol. 14652, pp. 3–32, May 2024.

Adaptive Security of Multi-Party Protocols, Revisited

Martin Hirt, Chen-Da Liu Zhang, and Ueli Maurer
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 686–716, Nov 2021.

On Communication-Efficient Asynchronous MPC with Adaptive Security

Annick Chopard, Martin Hirt, and Chen-Da Liu Zhang
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

Giovanni Deligios, Martin Hirt, and Chen-Da Liu Zhang
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 623–653, Nov 2021.

Multi-Threshold Asynchronous Reliable Broadcast and Consensus

Martin Hirt, Ard Kastrati, and Chen-Da Liu Zhang
International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020.

Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus

Martin Hirt, Ard Kastrati, and Chen-Da Liu Zhang
International Symposium on Distributed Computing — DISC 2020, Oct 2020.

From Partial to Global Asynchronous Reliable Broadcast

Diana Ghinea, Martin Hirt, and Chen-Da Liu Zhang
International Symposium on Distributed Computing — DISC 2020, Oct 2020.

Efficient MPC with a Mixed Adversary

Martin Hirt and Marta Mularczyk
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

Assi Barak, Martin Hirt, Lior Koskas, and Yehuda Lindell
Computer and Communications Security — CCS 2018", 2018.

Network-Hiding Communication and Applications to Multi-Party Protocols

Martin Hirt, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
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

Sandro Coretti, Juan Garay, Martin Hirt, and Vassilis Zikas
Advances in Cryptology — ASIACRYPT 2016, Lecture Notes in Computer Science, Springer-Verlag, vol. 10032, 2016.

Multi-Valued Byzantine Broadcast: the $t < n$ Case

Martin Hirt and Pavel Raykov
Advances in Cryptology — ASIACRYPT 2014, Lecture Notes in Computer Science, Springer, vol. 8874, pp. 448–465, Dec 2014.

Anonymous Authentication with Shared Secrets

Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
Progress in Cryptology — LATINCRYPT 2014, Sep 2014.

Key-Indistinguishable Message Authentication Codes

Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
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

Martin Hirt, Ueli Maurer, and Pavel Raykov
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

Martin Hirt and Daniel Tschudi
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

Martin Hirt, Christoph Lucas, and Ueli Maurer
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

Martin Hirt and Pavel Raykov
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

Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer
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

Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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

Martin Hirt and Vassilis Zikas
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

Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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

Zuzana Beerliova-Trubiniova, Martin Hirt, and Jesper Buus Nielsen
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

Martin Hirt
Towards Trustworthy Elections, Lecture Notes in Computer Science, Springer-Verlag, vol. 6000, pp. 64–82, Jun 2010.

Adaptively Secure Broadcast

Martin Hirt and Vassilis Zikas
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

Martin Hirt, Ueli Maurer, and Vassilis Zikas
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

Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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

Zuzana Beerliova-Trubiniova and Martin Hirt
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

Zuzana Beerliova-Trubiniova, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas
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

Zuzana Beerliova-Trubiniova, Martin Hirt, and Micha Riser
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

Zuzana Beerliova-Trubiniova and Martin Hirt
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

Martin Hirt and Jesper Buus Nielsen
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

Matthias Fitzi and Martin Hirt
Proc. 25th ACM Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006.

Efficient Multi-Party Computation with Dispute Control

Zuzana Beerliova-Trubiniova and Martin Hirt
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

Martin Hirt and Jesper Buus Nielsen
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

Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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

Matthias Fitzi, Martin Hirt, Thomas Holenstein, and Jürg Wullschleger
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

Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith
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

Martin Hirt
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

Martin Hirt and Ueli Maurer
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 101–118, Aug 2001.

Efficient Secure Multi-Party Computation

Martin Hirt, Ueli Maurer, and Bartosz Przydatek
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

Martin Hirt and Kazue Sako
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

Martin Hirt and Ueli Maurer
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

Matthias Fitzi, Martin Hirt, and Ueli Maurer
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

Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin
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

Matthias Fitzi, Martin Hirt, and Ueli Maurer
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

Martin Hirt and Ueli Maurer
Proc. 16th ACM Symposium on Principles of Distributed Computing — PODC '97, pp. 25–34, Aug 1997.