Sciweavers

100 search results - page 2 / 20
» Asynchronous Secure Multiparty Computation in Constant Time
Sort
View
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
13 years 10 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
PODC
2010
ACM
13 years 5 months ago
On the theoretical gap between synchronous and asynchronous MPC protocols
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
Zuzana Beerliová-Trubíniová, ...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 5 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 6 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