Sciweavers

3 search results - page 1 / 1
» Multiparty Computation for Dishonest Majority: From Passive ...
Sort
View
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 4 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 4 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
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