90 search results - page 2 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
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...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
JCIT
2010
12 years 11 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
CRYPTO
2005
Springer
13 years 10 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...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...