Computationally private information retrieval (extended abstract)

Chor, Benny; Gilboa, Niv

doi:10.1145/258533.258609

Cited by 213 publications

(158 citation statements)

References 7 publications

Supporting

Mentioning

152

Contrasting

Unclassified

Order By: Relevance

“…Chor and Gilboa [11] were the first to relax the absolute privacy offered by multi-server information-theoretic PIR by using cryptographic primitives. They proposed a family of 2-server computationally private PIR schemes by making intractability assumptions on the existence of pseudorandom generators or one-way functions.…”

Section: Introductionmentioning

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: Introductionmentioning

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

“…All known PIR protocols realization can be divided into two classes: single-server protocols (see [2][3][4][5][6][7][8][9][10]) and multi-servers ones (see [11][12][13][14]). …”

Section: Existing Schemesmentioning

confidence: 99%

Сomputationally efficient private information retrieval protocol

Afanasyeva¹,

Bezzateev²

2016

Naučno-teh. vestn. inf. tehnol. meh. opt.

View full text Add to dashboard Cite

“…Private Information Retrieval (PIR) [6,11,12,19] allows a client to access a dataset on the server obliviously. Single-server PIR techniques can achieve O(β) bandwidth cost per query using FHE techniques [6] for large enough block sizes β.…”

Section: Related Workmentioning

confidence: 99%

Verifiable Oblivious Storage

Apon

Katz

Shi

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the storage of data to a server while ensuring data confidentiality, access pattern privacy, and integrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM) in that it allows the server to perform computation, and also explicitly considers data integrity and freshness.We show that allowing server-side computation enables us to construct asymptotically more efficient VOS schemes whose bandwidth overhead cannot be matched by any ORAM scheme, due to a known lower bound by Goldreich and Ostrovsky. Specifically, for large block sizes we can construct a VOS scheme with constant bandwidth per query; further, answering queries requires only poly-logarithmic server computation. We describe applications of VOS to Dynamic Proofs of Retrievability, and RAM-model secure multi-party computation.

show abstract

Computationally private information retrieval (extended abstract)

Cited by 213 publications

References 7 publications

Revisiting the Computational Practicality of Private Information Retrieval

Revisiting the Computational Practicality of Private Information Retrieval

Сomputationally efficient private information retrieval protocol

Verifiable Oblivious Storage

Contact Info

Product

Resources

About