80 search results - page 5 / 16 » Zero-knowledge from secure multiparty computation |
182
click to vote
IACR
2011
14 years 4 months ago
2011
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...
130
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
132
click to vote
CRYPTO
2001
Springer
15 years 9 months ago
2001
Springer
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/...
160
click to vote
CSE
2009
IEEE
16 years 1 days ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
185
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...