Sciweavers

4 search results - page 1 / 1
» Near-Linear Unconditionally-Secure Multiparty Computation wi...
Sort
View
IACR
2011
127views more  IACR 2011»
12 years 3 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
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...
Matthias Fitzi, Stefan Wolf, Jürg Wullschlege...
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
13 years 7 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...