Sciweavers

404 search results - page 1 / 81
» Robust Multiparty Computation with Linear Communication Comp...
Sort
View
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
ASIACRYPT
2005
Springer
13 years 10 months ago
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
Zhifang Zhang, Mulan Liu, Liangliang Xiao
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
IACR
2011
127views more  IACR 2011»
12 years 4 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ICALP
2007
Springer
13 years 11 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...