Martin Hirt

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Martin Hirt authored at least 55 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Adaptive Security of Multi-Party Protocols, Revisited.
IACR Cryptol. ePrint Arch., 2021

Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2021

On Communication-Efficient Asynchronous MPC with Adaptive Security.
IACR Cryptol. ePrint Arch., 2021

2020
Efficient MPC with a Mixed Adversary.
IACR Cryptol. ePrint Arch., 2020

Multi-Threshold Asynchronous Reliable Broadcast and Consensus.
IACR Cryptol. ePrint Arch., 2020

From Partial to Global Asynchronous Reliable Broadcast.
IACR Cryptol. ePrint Arch., 2020

Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

2018
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.
IACR Cryptol. ePrint Arch., 2018

2016
Network-Hiding Communication and Applications to Multi-Party Protocols.
IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2014
Key-Indistinguishable Message Authentication Codes.
IACR Cryptol. ePrint Arch., 2014

Anonymous Authentication with Shared Secrets.
IACR Cryptol. ePrint Arch., 2014

2013
Efficient General-Adversary Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2013

Multi-Valued Byzantine Broadcast: the t<n Case.
IACR Cryptol. ePrint Arch., 2013

On the Complexity of Broadcast Setup.
IACR Cryptol. ePrint Arch., 2013

Broadcast Amplification.
IACR Cryptol. ePrint Arch., 2013

A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2013

Asynchronous Multiparty Computation with Linear Communication Complexity.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Passive Corruption in Statistical Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Resource-Restricted Indifferentiability.
IACR Cryptol. ePrint Arch., 2012

Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.
IACR Cryptol. ePrint Arch., 2012

Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract).
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
Graceful Degradation in Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2011

Graceful Degradation in Multi-Party Computation (Extended Abstract).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Player-Centric Byzantine Agreement.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Receipt-Free <i>K</i>-out-of-<i>L</i> Voting Based on ElGamal Encryption.
Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

On the theoretical gap between synchronous and asynchronous MPC protocols.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Adaptively Secure Broadcast.
IACR Cryptol. ePrint Arch., 2009

2008
Almost-Asynchronous MPC with Faulty Minority.
IACR Cryptol. ePrint Arch., 2008

Perfectly-Secure MPC with Linear Communication Complexity.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Asynchronous Multi-Party Computation with Quadratic Communication.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

MPC vs. SFE : Unconditional and Computational Security.
Proceedings of the Advances in Cryptology, 2008

2007
MPC vs. SFE: Perfect Security in a Unified Corruption Model.
IACR Cryptol. ePrint Arch., 2007

Efficient Byzantine Agreement with Faulty Minority.
Proceedings of the Advances in Cryptology, 2007

Simple and Efficient Perfectly-Secure Asynchronous MPC.
Proceedings of the Advances in Cryptology, 2007

2006
Efficient Multi-party Computation with Dispute Control.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Optimally efficient multi-valued byzantine agreement.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Robust Multiparty Computation with Linear Communication Complexity.
Proceedings of the Advances in Cryptology, 2006

2005
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract).
Proceedings of the Advances in Cryptology, 2005

2004
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2004

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.
IACR Cryptol. ePrint Arch., 2004

2003
Two-Threshold Broadcast and Detectable Multi-party Computation.
Proceedings of the Advances in Cryptology, 2003

2002
Extended Validity and Consistency in Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2002

Detectable byzantine agreement secure against faulty majorities.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Multi party computation: efficient protocols, general adversaries, and voting.
PhD thesis, 2001

Robustness for Free in Unconditional Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2001

2000
Player Simulation and General Adversary Structures in Perfect Multiparty Computation.
J. Cryptol., 2000

Efficient Receipt-Free Voting Based on Homomorphic Encryption.
Proceedings of the Advances in Cryptology, 2000

Efficient Secure Multi-party Computation.
Proceedings of the Advances in Cryptology, 2000

1999
Efficient Multiparty Computations Secure Against an Adaptive Adversary.
Proceedings of the Advances in Cryptology, 1999

General Adversaries in Unconditional Multi-party Computation.
Proceedings of the Advances in Cryptology, 1999

1998
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998

1997
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997


  Loading...