Download:
|
by Amos Beimel, Tal Malkin, Silvio Micali
In Proc. of CRYPTO 99
http://theory.lcs.mit.edu/~cis/pubs/malkin/BMM.ps
Add To MetaCart
Abstract:
Abstract. A function f is computationally securely computable if two computationally-bounded parties Alice, having a secret input x, and Bob, having a secret input y, can talk back and forth so that (even if one of them is malicious) (1) Bob learns essentially only f(x; y) while (2) Alice learns essentially nothing. We prove that, if any non-trivial function can be so computed, then so can every function. Consequently, the complexity assumptions sufficient and/or required for computationally securely computing f are the same for every non-trivial function f. 1
Citations
|
692
|
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract
– Goldwasser, Micali, et al.
- 1985
|
|
474
|
A pseudorandom generator from any one-way function
– stad, Impagliazzo, et al.
- 1999
|
|
468
|
Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations
– Ben-Or, Goldwasser, et al.
|
|
466
|
How to generate Cryptographically Strong Sequences of Pseudo-Random Bits
– Blum, Micali
- 1984
|
|
374
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
340
|
A simple protocol for signing contracts
– Goldreich
|
|
304
|
How to generate and exchange secrets
– Yao
- 1986
|
|
303
|
Multiparty unconditionally secure protocols
– Chaum, Crépeau, et al.
- 1988
|
|
266
|
How to Play Any Mental Game
– Goldreich, Micali, et al.
|
|
265
|
Protocols for secure computations
– Yao
- 1982
|
|
241
|
Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems
– Goldreich, Micali, et al.
- 1991
|
|
208
|
How to exchange secrets by oblivious transfer
– Rabin
- 1981
|
|
161
|
Founding cryptography on oblivious transfer
– Kilian
- 1988
|
|
106
|
Limits on the provable consequences of one-way permutations
– Impagliazzo, Rudich
- 1989
|
|
90
|
Secure computation
– Micali, Rogaway
|
|
85
|
Secure multi-party computation (working draft). www.wisdom.weizmann.ac.il/oded/pp.html
– Goldreich
- 2000
|
|
83
|
Achieving oblivious transfer using weakened security assumptions
– Cr'epeau, Kilian
- 1988
|
|
77
|
One-way functions are essential for complexity based cryptography
– Impagliazzo, Luby
- 1989
|
|
59
|
A zero–one law for Boolean privacy
– Chor, Kushilevitz
- 1991
|
|
40
|
Coin Flipping by Phone
– Blum
- 1982
|
|
39
|
Bit Commitment using Pseudorandom Generators
– Naor
- 1991
|
|
34
|
Uses of Randomness in Algorithms and Protocols
– Kilian
- 1990
|
|
31
|
Reducibility and Completeness In Multi-Party Private Computations
– Kushilevitz, Micali, et al.
- 1994
|
|
30
|
Equivalence between two flavors of oblivious transfer
– Cr'epeau
- 1988
|
|
25
|
A general completeness theorem for two-party games
– Kilian
- 1991
|
|
20
|
Reducibility and completeness in private computations
– Kilian, Kushilevitz, et al.
- 2000
|
|
10
|
Equivalence between two of oblivious transfers
– Crepeau
- 1988
|
|
8
|
A secure protocol for the oblivious transfer
– Fischer, Micali, et al.
- 1996
|
|
7
|
How to solve any protocol problem---an efficiency improvement
– Goldreich, Vainish
- 1988
|
|
6
|
Limits on the security of coin when half the processors are faulty
– Cleve
- 1986
|
|
3
|
Coin by phone
– Blum
- 1982
|
