Private information retrieval

@article{Chor1998PrivateIR,
  title={Private information retrieval},
  author={Benny Chor and Eyal Kushilevitz and Oded Goldreich and Madhu Sudan},
  journal={J. ACM},
  year={1998},
  volume={45},
  pages={965-981}
}
Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole… 

Tables from this paper

Private Information Retrieval
This book deals with Private Information Retrieval (PIR), a technique allowing a user to retrieve an element from a server in possession of a database without revealing to the server which element is
Efficient Private Information Retrieval
Informally, private information retrieval for k >= 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately
On Lower Bounds for the Communication Complexity of Private Information Retrieval
TLDR
This paper classifies (k, )-PIR into a linear type, a multilinear type, and an aÆne type with respect to the relationship between queries to each database and answers to the user, and shows that the lower bound for the communication complexity of any multil inear type is Ω( +1 √ n).
A Novel Scheme for Single Database Symmetric Private Information Retrieval
TLDR
This paper presents a single round single database SPIR scheme with communication complexity O(n), for any > 0, providing a new approach to the open problem posed by Kushilevitz and Ostrovsky in [1].
Private access to distributed information
TLDR
A simple proof shows that if the authors want information theoretic privacy and have only a single server, the trivial solution is the best they can hope for, and shows that no PIR scheme for 2 servers that achieves informationtheoretic privacy could have communication complexity of at most (4 ) logn.
Information-Theoretic Private Information Retrieval: A Unified Construction
TLDR
A unified general construction of Private Information Retrieval protocols, whose abstract components can be instantiated to yield both old and new families of PIR protocols, and a main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.
XPIR : Private Information Retrieval for Everyone
TLDR
This paper shows that the conclusion of Sion and Carbunar is not valid anymore: cPIR is of practical value: this is achieved without compromising security, using standard crytosystems, and conservative parameter choices.
Information-Theoretic Private Information Retrieval: A Unied Construction (Extended Abstract)
TLDR
This work addresses the information-theoretic setting for PIR, in which the user's privacy should be unconditionally protected from collusions of servers, and presents a unied general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols.
The capacity of private information retrieval with colluding databases
  • Hua Sun, S. Jafar
  • Computer Science
    2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
  • 2016
TLDR
T-private PIR is a generalization of PIR to include the requirement that even if any T of the N databases collude, the identity of the retrieved message remains completely unknown to them.
On the Capacity of Leaky Private Information Retrieval
  • I. Samy, R. Tandon, L. Lazos
  • Computer Science, Mathematics
    2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
TLDR
This paper begins the study of leaky private information retrieval (L-PIR), where a bounded amount of privacy leakage is allowed and measured through a parameter ϵ, and derives new upper and lower bounds on the download cost.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
Private Information Retrieval by Keywords
TLDR
A simple, modular way to privately access data by keywords that combines any conventional search structure with any underlying PIR scheme (including single server schemes) and requires no modiication in the way that the search structure is maintained.
Computationally private information retrieval (extended abstract)
TLDR
Improved efficiency is achieved by a combination of a novel balancing technique, together with careful application of pseudo random generators, and it is shown that the computational approach leads to substantial savings.
Private information retrieval
TLDR
Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
Private Information Storage
TLDR
The result yields a solution to the problem of information-theoretically secure Oblivious RAM simulation with poly-log overhead in the above setting and implies that eecient instance-hiding schemes where the state can be altered are possible.
Protecting data privacy in private information retrieval schemes
TLDR
This paper shows how to transform PIR schemes into SPIR schemes (with information-theoretic privacy), paying a constant factor in communication complexity, and introduces a new cryptographic primitive, called conditional disclosure of secrets, which it is believed may be a useful building block for the design of other cryptographic protocols.
Private information storage (extended abstract)
TLDR
This paper shows a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/ write schemes could be implemented as efficiently (up topoly-log factors) as read-onfy schemes.
On hiding information from an oracle
TLDR
The framework defined in this paper enables us to prove precise statements about what an encrypted instance hides and what it leaks, in an information-theoretic sense, about some natural problems in NP ⋒ CoNP.
On Hiding Information from an Oracle
Security problems on inference control for SUM, MAX, and MIN queries
TLDR
Two applications concerning the security of the statistical database (SDB) are considered and efficient algorithms are designed for some of these situations while others are shown to be NP-hard.
ON DATA BANKS AND PRIVACY HOMOMORPHISMS
TLDR
It appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations.
...
1
2
3
4
5
...