Matthias Fitzi

	2009
21		Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. DISC 2009: 449-463
	2008
20		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
19		Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen: Secure Protocols with Asymmetric Trust. ASIACRYPT 2007: 357-375
18		Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, S. Harsha Vardhan: Towards Optimal and Efficient Perfectly Secure Message Transmission. TCC 2007: 311-322
	2006
17		Matthias Fitzi, Martin Hirt: Optimally efficient multi-valued byzantine agreement. PODC 2006: 163-168
16		Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. TCC 2006: 285-304
15		Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan: Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342
	2005
14		Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky: Minimal Complete Primitives for Secure Multi-Party Computation. J. Cryptology 18(1): 37-61 (2005)
13		Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf: Byzantine Agreement Given Partial Broadcast. J. Cryptology 18(3): 191-217 (2005)
	2004
12		Matthias Fitzi, Stefan Wolf, Jürg Wullschleger: Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. CRYPTO 2004: 562-578
11		Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger: Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438
	2003
10		Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67
9		Matthias Fitzi, Juan A. Garay: Efficient player-optimal protocols for strong and differential consensus. PODC 2003: 211-220
	2002
8		Matthias Fitzi, Nicolas Gisin, Ueli M. Maurer, Oliver von Rotz: Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. EUROCRYPT 2002: 482-501
7		Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith: Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126
	2001
6		Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky: Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100
	2000
5		Matthias Fitzi, Ueli M. Maurer: From partial consistency to global broadcast. STOC 2000: 494-503
	1999
4		Matthias Fitzi, Martin Hirt, Ueli M. Maurer: General Adversaries in Unconditional Multi-party Computation. ASIACRYPT 1999: 232-246
3		Bernd Altmann, Matthias Fitzi, Ueli M. Maurer: Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. DISC 1999: 123-137
	1998
2		Matthias Fitzi, Martin Hirt, Ueli M. Maurer: Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). CRYPTO 1998: 121-136
1		Matthias Fitzi, Ueli M. Maurer: Efficient Byzantine Agreement Secure Against General Adversaries. DISC 1998: 134-148

Coauthor Index

1	Bernd Altmann	[3]
2	Zuzana Beerliová-Trubíniová	[20]
3	Jeffrey Considine	[13]
4	Ivan Damgård	[16] [19]
5	Yvo Desmedt	[19]
6	Matthew K. Franklin	[13] [18]
7	Juan A. Garay	[6] [9] [14] [15] [18]
8	Nicolas Gisin	[8]
9	Shyamnath Gollakota	[15]
10	Daniel Gottesman	[7]
11	Martin Hirt	[2] [4] [7] [10] [17] [20]
12	Thomas Holenstein	[7] [10] [11]
13	Eike Kiltz	[16]
14	Leonid A. Levin	[13]
15	Ueli M. Maurer	[1] [2] [3] [4] [5] [6] [8] [13] [14] [20]
16	David Metcalf	[13]
17	Jesper Buus Nielsen	[16] [19] [21]
18	Rafail Ostrovsky	[6] [14]
19	C. Pandu Rangan (Chandrasekaran Pandu Rangan)	[15]
20	Oliver von Rotz	[8]
21	Adam Smith	[7]
22	K. Srinathan (Kannan Srinathan)	[15]
23	Tomas Toft	[16]
24	S. Harsha Vardhan	[18]
25	Stefan Wolf	[12]
26	Jürg Wullschleger	[10] [11] [12]
27	Vassilis Zikas	[20]