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 retrieve any single bit out of the n bits of data stored in the database. In this model, “privacy” implies that the user retrieves the bit he is interested in but releases to each database nothing about which bit he really tries to get. Chor et. al. proposed 2-PIR with communication complexity 12n1/3 + 2 that is based on the covering codes. Then Ambainis recursively extended the scheme by Chor et. al. and showed that for each k >= 2, there exists k-PIR with communication complexity at most ck · n1/(2k−1) some constant ck > 0. In this paper, we relax the condition for the covering codes and present time-efficient 2-PIR with communication complexity 12n1/3. In addition, we generally formulate the recursive scheme by Ambainis and show that for each k >= 4, there exists k-PIR with communication complexity at most c′ k · n1/(2k−1) for some constant c′ k ck. key words: information retrieval, privacy, communication complexity, time complexity, covering codes
منابع مشابه
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders of magnitude slower than trivially transferring the entire data sets to the inquiring clients. We thus raised the issue of designing efficient PIR mechanisms in practical set-
متن کاملSymmetrically Private Information Retrieval ( Extended Abstract )
In this paper we present a single-round, single-server symmetrically private information retrieval scheme, in which privacy of user follows from intractability of the quadratic residuacity problem and the privacy of the database follows from the XOR assumption for quadratic residues introduced in this paper. The communication complexity of the proposed scheme for retrieving one bit can be made ...
متن کاملSecure quantum private information retrieval using phase-encoded queries
We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. T...
متن کاملA Little Storage Goes a Long Way: Accelerating Private Information Retrieval
The authors have previously shown that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders of magnitude slower than trivially transferring the entire data sets to the inquiring clients. We thus raised the issue of designing efficient PIR mechanisms in practical settings. We introduce exactly s...
متن کاملConstructions for efficient Private Information Retrieval protocols
Private Information Retrieval (PIR) protocols aim at ensuring a user that he can retrieve some part Di of a distributed database D without revealing the index i to the server(s). Most of known PIR protocols focus on decreasing the communication complexity between the client and the server(s). Recently, the use of PIR codes by Fazeli et. al. also lead to a huge reduction of the storage overhead ...
متن کاملOn the Practicality of Private Information Retrieval
We explore the limits of single-server computational private information retrieval (PIR) for the purpose of preserving client access patterns leakage. We show that deployment of non-trivial single server PIR protocols on real hardware of the recent past would have been orders of magnitude less time-efficient than trivially transferring the entire database. We stress that these results are beyon...
متن کامل