ETH Zürich » Computer Science » Theory » Cryptography

Martin Hirt's Publications

Martin Hirt and Daniel Tschudi
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Pavel Raykov
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Vassilis Zikas
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Martin Hirt, and Jesper Buus Nielsen
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Vassilis Zikas
Adaptively Secure Broadcast
Advances in Cryptology — EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 466–485, May 2010.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, and Vassilis Zikas
{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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas
{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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Martin Hirt, and Micha Riser
Efficient {B}yzantine Agreement with Faulty Minority
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 - 409, Dec 2007.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Jesper Buus Nielsen
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi and Martin Hirt
Optimally Efficient Multi-Valued {B}yzantine Agreement
Proc. 25th {ACM} Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Jesper Buus Nielsen
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, Thomas Holenstein, and J{ü}rg Wullschleger
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith
Detectable {B}yzantine {A}greement Secure Against Faulty Majorities
Proc. 21st {ACM} Symposium on Principles of Distributed Computing — PODC 2002, pp. 118–126, Jul 2002.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt
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, {H}artung-{G}orre {V}erlag, {K}onstanz, 2001.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, and Bartosz Przydatek
Efficient Secure Multi-Party Computation
Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Kazue Sako
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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}.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, Stefan Dziembowski, Martin Hirt, and Tal Rabin
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE