Download:
|
by Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky
http://www.argreenhouse.com/papers/rafail/54.ps
Add To MetaCart
Abstract:
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of complete primitives for the case of two players has been thoroughly studied. However, in the multi-party setting, when there are n? 2 players and t of them are corrupted, the question of what are the simplest complete primitives remained open for t n=3. We consider this question, and introduce complete primitives of minimal cardinality for secure multi-party computation. The cardinality issue (number of players accessing the primitive) is essential in settings where the primitives are implemented by some other means, and the simpler the primitive the easier it is to realize it. We show that our primitives are complete and of minimal cardinality possible. 1
Citations
|
468
|
Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations
– Ben-Or, Goldwasser, et al.
|
|
367
|
Reaching Agreement in the Presence of Faults
– Pease, Shostak, et al.
- 1980
|
|
303
|
Multiparty unconditionally secure protocols
– Chaum, Crépeau, et al.
- 1988
|
|
256
|
The dining cryptographers problem: Unconditional sender and recipient untraceability
– Chaum
- 1988
|
|
208
|
How to exchange secrets by oblivious transfer
– Rabin
- 1981
|
|
161
|
Founding cryptography on oblivious transfer
– Kilian
- 1988
|
|
159
|
Verifiable secret sharing and multiparty protocols with honest majority
– Rabin, Ben-Or
- 1989
|
|
111
|
Foundations of Secure Interactive Computing
– Beaver
|
|
90
|
Secure computation
– Micali, Rogaway
|
|
85
|
Secure multi-party computation (working draft). www.wisdom.weizmann.ac.il/oded/pp.html
– Goldreich
- 2000
|
|
65
|
Easy impossibility proofs for distributed consensus problems
– Fischer, Lynch, et al.
- 1986
|
|
65
|
Fair computation of general functions in presence of immoral majority
– Goldwasser, Levin
- 1990
|
|
63
|
Perfectly Secure Message Transmission
– Dolev, Dwork, et al.
- 1990
|
|
31
|
The tail of the hypergeometric distribution
– Chvátal
- 1979
|
|
31
|
Reducibility and Completeness In Multi-Party Private Computations
– Kushilevitz, Micali, et al.
- 1994
|
|
26
|
Efficient multiparty computations secure against an adaptive adversary
– Cramer, Damg˚ard, et al.
- 1999
|
|
25
|
A general completeness theorem for two-party games
– Kilian
- 1991
|
|
24
|
The all-or-nothing nature of two-party secure computation
– Beimel, Malkin, et al.
- 1999
|
|
20
|
Reducibility and completeness in private computations
– Kilian, Kushilevitz, et al.
- 2000
|
|
16
|
Holographic circuits
– Valiant
- 1976
|
|
14
|
From partial consistency to global broadcast
– Fitzi, Maurer
|
|
10
|
Oblivious key escrow
– Blaze
- 1996
|
