Download:
|
by Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
JCSS
http://www.ussrback.com/cryptopapers/1998/www.cs.technion.ac.il/~eyalk/GIKM.ps.Z
Add To MetaCart
Abstract:
Private Information Retrieval (PIR) schemes allow a user to retrieve the i-th bit of a data string x, replicated in k 2 databases (in the information-theoretic setting) or k 1 databases (in the computational setting), while keeping the value of i private. The main cost measure for such a scheme is its communication complexity. In this paper we introduce a model of SymmetricallyPrivate Information Retrieval (SPIR), where the privacy of the data, as well as of the user, is guaranteed. That is, in every invocation of a SPIR protocol, the user learns only a single (physical) bit of x and no other information about the data. Currently known PIR schemes fail to meet this goal. We show how to transform PIR schemes into SPIR schemes (with information theoretic privacy), paying at most a logarithmic factor in communication complexity. To this end, we introduce and utilize a new cryptographic primitive, denoted conditional disclosure of secrets, which we believe may be a useful building block for the design of more general cryptographic protocols. In particular, we get a k-database SPIR scheme of complexity O(log n \Delta n
Citations
|
1095
|
How to share a secret
– Shamir
- 1979
|
|
533
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
517
|
How to generate cryptographically strong sequences of pseudo-random bits
– Blum, Micali
- 1984
|
|
514
|
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation
– Ben-Or, Goldwasser, et al.
- 1988
|
|
455
|
Theory and applications of trapdoor functions
– Yao
- 1982
|
|
409
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
366
|
A Randomized Protocol for Signing Contracts
– Even, Goldreich, et al.
- 1985
|
|
326
|
Multiparty unconditionally secure protocols
– Chaum, Crepeau, et al.
- 1988
|
|
315
|
The Complexity of Boolean Functions
– Wegener
- 1987
|
|
256
|
Private information retrieval
– Chor, Goldreich, et al.
- 1995
|
|
228
|
How to exchange secrets by oblivious transfer
– Rabin
- 1981
|
|
174
|
Founding cryptography on oblivious transfer
– Kilian
- 1988
|
|
167
|
Hiding instances in multioracle queries
– Beaver, Feigenbaum
- 1990
|
|
161
|
Computationally private information retrieval with polylogarithmic communication
– Cachin, Micali, et al.
- 1999
|
|
155
|
Oblivious transfer and polynomial evaluation
– Naor, Pinkas
- 1999
|
|
122
|
Generalized secret sharing and monotone functions
– Benaloh, Leichter
- 1990
|
|
113
|
On span programs
– Karchmer, Wigderson
- 1993
|
|
93
|
Upper bound on the communication complexity of private information retrieval
– Ambainis
- 1997
|
|
90
|
Secret Sharing Scheme Realizing General Access Structure
– Ito, Saito, et al.
- 1987
|
|
84
|
Non-Interactive Zero-Knowledge and its Applications
– Blum, Feldman, et al.
- 1988
|
|
65
|
Information theoretic reductions among disclosure problems
– Brassard, Cr'epeau, et al.
- 1986
|
|
61
|
A Zero-One Law for Boolean Privacy
– Chor, Kushilevitz
- 1991
|
|
39
|
Oblivious transfers and intersecting codes
– Brassard, Crepeau, et al.
- 1996
|
|
37
|
Private information storage
– Ostrovsky, Shoup
- 1997
|
|
33
|
Perfect Privacy for Two-Party Protocols
– Beaver
- 1989
|
|
29
|
Single-database private information retrieval implies oblivious transfer
– Crescenzo, Malkin, et al.
- 2000
|
|
27
|
Improved upper bounds on information-theoretic private information retrieval
– Ishai, Kushilevitz
- 1999
|
|
19
|
Private simultaneous messages protocols with applications
– Ishai, Kushilevitz
- 1997
|
|
17
|
Single-database computationally private information retrieval
– Kushilevitz, Ostrovsky
- 1997
|
|
17
|
How to share a secret, Commun
– Shamir
- 1979
|
|
12
|
A minimal model for secure computation (extended abstract
– Feige, Kilian, et al.
- 1994
|
|
3
|
One-way functions are essential for single database private information retrieval
– Beimel, Ishai, et al.
- 1999
|
|
1
|
Upper bound on the communicationcomplexity of private information retrieval
– Ambainis
- 1997
|
