Efficient Secure Multi-Party Computation

Efficient Secure Multi-Party Computation (2000)

Cached

Download Links

[ftp.inf.ethz.ch]

Other Repositories/Bibliography

DBLP

by Martin Hirt , Ueli Maurer , Bartosz Przydatek

Citations:

24 - 3 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Secure Multi-Party Computation	user correction - Legacy Corrections
AUTHOR NAME	Martin Hirt	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	Ueli Maurer	user correction - Legacy Corrections
AUTHOR NAME	Bartosz Przydatek	user correction - Legacy Corrections
AUTHOR AFFIL	; 1; 2; Carnegie Mellon University, USA,	user correction - Legacy Corrections
AUTHOR ADDR	; ETH Zurich, Switzerland,	user correction - Legacy Corrections
ABSTRACT	) Martin Hirt 1 , Ueli Maurer 1 , and Bartosz Przydatek 2?? 1 ETH Zurich, Switzerland, fhirt,maurerg@inf.ethz.ch 2 Carnegie Mellon University, USA, bartosz@cs.cmu.edu Asiacrypt 2000 Abstract. Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suer from very high communication complexities. The most ecient unconditionally secure protocols among n players, tolerating cheating by up to t < n=3 of them, require communicating O(n 6 ) eld elements for each multiplication of two elements, even if only one player cheats. In this paper, we propose a perfectly secure multi-party protocol which requires communicating O(n 3 ) eld elements per multiplication. In this protocol, the number of invocations of the broadcast primitive is independent of the size of the circuit to be computed. The proposed techniques are generic and apply to other protocols for robust distributed computations. Furthe...	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	31 found	ParsCit 1.0