Matthias Fitzi

	2009
27		Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. DISC 2009: 449-463
26		Matthias Fitzi, Dominik Raub: Tight Bounds for Protocols with Hybrid Security. IACR Cryptology ePrint Archive 2009: 434 (2009)
	2008
25		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
24		Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Required for Byzantine Agreement. IACR Cryptology ePrint Archive 2008: 414 (2008)
	2007
23		Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen: Secure Protocols with Asymmetric Trust. ASIACRYPT 2007: 357-375
22		Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri: Towards Optimal and Efficient Perfectly Secure Message Transmission. TCC 2007: 311-322
21		Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli Maurer, Vassilis Zikas: MPC vs. SFE: Perfect Security in a Unified Corruption Model. IACR Cryptology ePrint Archive 2007: 78 (2007)
	2006
20		Matthias Fitzi, Martin Hirt: Optimally efficient multi-valued byzantine agreement. PODC 2006: 163-168
19		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
18		Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan: Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342
	2005
17		Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, Tomas Toft: How to Split a Shared Secret into Shared Bits in Constant-Round. IACR Cryptology ePrint Archive 2005: 140 (2005)
16		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)
15		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
14		Matthias Fitzi, Stefan Wolf, Jürg Wullschleger: Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. CRYPTO 2004: 562-578
13		Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger: Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438
	2003
12		Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67
11		Matthias Fitzi, Juan A. Garay: Efficient player-optimal protocols for strong and differential consensus. PODC 2003: 211-220
	2002
10		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
9		Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith: Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126
8		Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Extended Validity and Consistency in Byzantine Agreement. IACR Cryptology ePrint Archive 2002: 53 (2002)
7		Matthias Fitzi, Juan A. Garay: Efficient and Player-Optimal Strong Consensus. IACR Cryptology ePrint Archive 2002: 85 (2002)
	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á	[21] [25]
3	Jeffrey Considine	[15]
4	Ivan Damgård (Ivan Bjerre Damgård)	[17] [19] [23]
5	Yvo Desmedt	[23]
6	Matthew K. Franklin	[15] [22]
7	Juan A. Garay	[6] [7] [11] [16] [18] [22]
8	Nicolas Gisin	[10]
9	Shyamnath Gollakota	[18]
10	Daniel Gottesman	[9]
11	Martin Hirt	[2] [4] [8] [9] [12] [20] [21] [25]
12	Thomas Holenstein	[8] [9] [12] [13]
13	Eike Kiltz	[19]
14	Leonid A. Levin	[15]
15	Ueli Maurer (Ueli M. Maurer)	[1] [2] [3] [4] [5] [6] [10] [15] [16] [21] [25]
16	David Metcalf	[15]
17	Jesper Buus Nielsen	[17] [19] [23] [24] [27]
18	Rafail Ostrovsky	[6] [16]
19	C. Pandu Rangan (Chandrasekaran Pandu Rangan)	[18]
20	Dominik Raub	[26]
21	Oliver von Rotz	[10]
22	Harsha Vardhan Simhadri	[22]
23	Adam Smith (Adam D. Smith)	[9]
24	K. Srinathan (Kannan Srinathan)	[18]
25	Tomas Toft	[17] [19]
26	Stefan Wolf	[14]
27	Jürg Wullschleger	[8] [12] [13] [14]
28	Vassilis Zikas	[21] [25]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page