521 search results - page 14 / 105 » Scalable Secure Multiparty Computation |
137
click to vote
CRYPTO
2005
Springer
15 years 8 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
105
Voted
ASIACRYPT
2005
Springer
15 years 8 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...
162
Voted
IACR
2011
14 years 2 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
133
Voted
CRYPTO
2012
Springer
13 years 5 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
106
click to vote
CRYPTO
2001
Springer
15 years 7 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/...