Almost Optimal Private Information Retrieval

Asonov, Dmitri; Freytag, Johann-Christoph

doi:10.1007/3-540-36467-6_16

Cited by 44 publications

(33 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, the databases can respond to users' queries in a less computationally expensive manner using the extra bits. Asonov et al [4,5] and Smith et al [41] similarly explore preprocessing for reducing server-side computation. However, the specialized hardware requirement at the server makes this solution less desirable.…”

Section: Related Workmentioning

confidence: 99%

Revisiting the Computational Practicality of Private Information Retrieval

Olumofin

Goldberg

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The retrieval of information from a remote database server typically demands providing the server with some search terms to assist with the retrieval task. However, keeping the search terms private without undermining the server's ability to retrieve the information is desirable for many privacy-preserving systems. Private information retrieval (PIR) provides a cryptographic means for retrieving data from a database without the database or database administrator learning any information about which particular item was retrieved. A study of the computational practicality of PIR by Sion and Carbunar in 2007 concluded that no existing construction is as efficient as the trivial PIR scheme -the server transferring its entire database to the client. While often cited as evidence that PIR is impractical, that paper did not examine multi-server information-theoretic PIR schemes, which are orders of magnitude more computationally efficient; further, a single-server lattice-based scheme by Aguilar-Melchor and Gaborit has recently been introduced, which is also much more computationally efficient than the schemes examined by Sion and Carbunar. In this paper, we report on a performance analysis of the above single-server lattice-based PIR scheme as well as two multi-server information-theoretic PIR schemes by Chor et al. and by Goldberg. Using analytical and experimental techniques, we find the end-to-end response times of these schemes to be one to three orders of magnitude (10-1000 times) smaller than the trivial scheme for realistic computation power and network bandwidth. Our results extend and clarify the conclusions of Sion and Carbunar for multi-server PIR schemes and single-server PIR schemes that do not rely heavily on number theory.

show abstract

Section: Related Workmentioning

confidence: 99%

Revisiting the Computational Practicality of Private Information Retrieval

Olumofin

Goldberg

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Asonov and Freytag's scheme [34] also assumes the SC inside the server and SC first shuffles the entire database according to a random permutation π. When the client request the data item i 1 , the SC fetches the item from π(i 1 ).…”

Section: Private Information Retrievalmentioning

confidence: 99%

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

Nakano

Kiyomoto

Miyake

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYOblivious RAM (ORAM) schemes, the concept introduced by Goldreich and Ostrovsky, are very useful technique for protecting users' privacy when storing data in remote untrusted servers and running software on untrusted systems. However they are usually considered impractical due to their huge overhead. In order to reduce overhead, many improvements have been presented. Thanks to these improvements, ORAM schemes can be considered practical on cloud environment where users can expect huge storage and high computational power. Especially for private information retrieval (PIR), some literatures demonstrated they are usable. Also dedicated PIRs have been proposed and shown that they are usable in practice. Yet, they are still impractical for protecting software running on untrusted systems. We first survey recent researches on ORAM and PIR. Then, we present a practical software-based memory protection scheme applicable to several environments. The main feature of our scheme is that it records the history of accesses and uses the history to hide the access pattern. We also address implementing issues of ORAM and propose practical solutions for these issues.

show abstract

“…Secure query processing (including the SNN problem) is related to but different from another well known problem called private information retrieval (PIR) [3], [10], [20]. In PIR, the objective is to prevent the server from knowing anything about which records have been retrieved/accessed by a user query, while the server is allowed to know all of the tuples in the database.…”

Section: Related Workmentioning

confidence: 99%

Secure nearest neighbor revisited

Yao

Xiao

2013

2013 IEEE 29th International Conference on Data Engineering (ICDE)

View full text Add to dashboard Cite

Abstract-In this paper, we investigate the secure nearest neighbor (SNN) problem, in which a client issues an encrypted query point E(q) to a cloud service provider and asks for an encrypted data point in E(D) (the encrypted database) that is closest to the query point, without allowing the server to learn the plaintexts of the data or the query (and its result). We show that efficient attacks exist for existing SNN methods [15], [21], even though they were claimed to be secure in standard security models (such as indistinguishability under chosen plaintext or ciphertext attacks). We also establish a relationship between the SNN problem and the order-preserving encryption (OPE) problem from the cryptography field [5], [6], and we show that SNN is at least as hard as OPE. Since it is impossible to construct secure OPE schemes in standard security models [5], [6], our results imply that one cannot expect to find the exact (encrypted) nearest neighbor based on only E(q) and E(D). Given this hardness result, we design new SNN methods by asking the server, given only E(q) and E(D), to return a relevant (encrypted) partition E(G) from E(D) (i.e., G ⊆ D), such that that E(G) is guaranteed to contain the answer for the SNN query. Our methods provide customizable tradeoff between efficiency and communication cost, and they are as secure as the encryption scheme E used to encrypt the query and the database, where E can be any well-established encryption schemes.

show abstract

Almost Optimal Private Information Retrieval

Cited by 44 publications

References 15 publications

Revisiting the Computational Practicality of Private Information Retrieval

Revisiting the Computational Practicality of Private Information Retrieval

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

Secure nearest neighbor revisited

Contact Info

Product

Resources

About