| 2008 |
|---|
| 21 | EE | Martin Hirt,
Ueli M. Maurer,
Vassilis Zikas:
MPC vs. SFE : Unconditional and Computational Security.
ASIACRYPT 2008: 1-18 |
| 20 | EE | Martin Hirt,
Jesper Buus Nielsen,
Bartosz Przydatek:
Asynchronous Multi-Party Computation with Quadratic Communication.
ICALP (2) 2008: 473-485 |
| 19 | EE | Zuzana Beerliová-Trubíniová,
Martin Hirt:
Perfectly-Secure MPC with Linear Communication Complexity.
TCC 2008: 213-230 |
| 18 | EE | Zuzana Beerliová-Trubíniová,
Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer,
Vassilis Zikas:
MPC vs. SFE: Perfect Security in a Unified Corruption Model.
TCC 2008: 231-250 |
| 2007 |
|---|
| 17 | EE | Zuzana Beerliová-Trubíniová,
Martin Hirt:
Simple and Efficient Perfectly-Secure Asynchronous MPC.
ASIACRYPT 2007: 376-392 |
| 16 | EE | Zuzana Beerliová-Trubíniová,
Martin Hirt,
Micha Riser:
Efficient Byzantine Agreement with Faulty Minority.
ASIACRYPT 2007: 393-409 |
| 2006 |
|---|
| 15 | EE | Martin Hirt,
Jesper Buus Nielsen:
Robust Multiparty Computation with Linear Communication Complexity.
CRYPTO 2006: 463-482 |
| 14 | EE | Matthias Fitzi,
Martin Hirt:
Optimally efficient multi-valued byzantine agreement.
PODC 2006: 163-168 |
| 13 | EE | Zuzana Beerliová-Trubíniová,
Martin Hirt:
Efficient Multi-party Computation with Dispute Control.
TCC 2006: 305-328 |
| 2005 |
|---|
| 12 | EE | Martin Hirt,
Jesper Buus Nielsen:
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.
ASIACRYPT 2005: 79-99 |
| 11 | EE | Martin Hirt,
Jesper Buus Nielsen,
Bartosz Przydatek:
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract).
EUROCRYPT 2005: 322-340 |
| 2003 |
|---|
| 10 | EE | Matthias Fitzi,
Martin Hirt,
Thomas Holenstein,
Jürg Wullschleger:
Two-Threshold Broadcast and Detectable Multi-party Computation.
EUROCRYPT 2003: 51-67 |
| 2002 |
|---|
| 9 | EE | Matthias Fitzi,
Daniel Gottesman,
Martin Hirt,
Thomas Holenstein,
Adam Smith:
Detectable byzantine agreement secure against faulty majorities.
PODC 2002: 118-126 |
| 2001 |
|---|
| 8 | EE | Martin Hirt,
Ueli M. Maurer:
Robustness for Free in Unconditional Multi-party Computation.
CRYPTO 2001: 101-118 |
| 2000 |
|---|
| 7 | EE | Martin Hirt,
Ueli M. Maurer,
Bartosz Przydatek:
Efficient Secure Multi-party Computation.
ASIACRYPT 2000: 143-161 |
| 6 | EE | Martin Hirt,
Kazue Sako:
Efficient Receipt-Free Voting Based on Homomorphic Encryption.
EUROCRYPT 2000: 539-556 |
| 5 | EE | Martin Hirt,
Ueli M. Maurer:
Player Simulation and General Adversary Structures in Perfect Multiparty Computation.
J. Cryptology 13(1): 31-60 (2000) |
| 1999 |
|---|
| 4 | | Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer:
General Adversaries in Unconditional Multi-party Computation.
ASIACRYPT 1999: 232-246 |
| 3 | EE | Ronald Cramer,
Ivan Damgård,
Stefan Dziembowski,
Martin Hirt,
Tal Rabin:
Efficient Multiparty Computations Secure Against an Adaptive Adversary.
EUROCRYPT 1999: 311-326 |
| 1998 |
|---|
| 2 | EE | Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer:
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).
CRYPTO 1998: 121-136 |
| 1997 |
|---|
| 1 | | Martin Hirt,
Ueli M. Maurer:
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).
PODC 1997: 25-34 |
