Optimal Rate Private Information Retrieval from Homomorphic Encryption

Kiayias, Aggelos; Leonardos, Nikos; Lipmaa, Helger; Pavlyk, Kateryna; Tang, Qiang

doi:10.1515/popets-2015-0016

Cited by 31 publications

(17 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, in [32] Kiayias et al present a new cPIR scheme based on a number-theoretic homomorphic en-cryption scheme. The communication performance is extremely interesting, but again computational performance is still an issue.…”

Section: Related Workmentioning

confidence: 99%

XPIR : Private Information Retrieval for Everyone

Aguilar-Melchor

Barrier

Fousse

et al. 2015

Proceedings on Privacy Enhancing Technologies

116

134

View full text Add to dashboard Cite

International audienceA Private Information Retrieval (PIR) scheme is a protocol in which a user retrieves a record from a database while hiding which from the database administrators. PIR can be achieved using mutually-distrustful replicated databases, trusted hardware, or cryptography. In this paper we focus on the later setting which is known as single-database computationally-Private Information Retrieval (cPIR). Classic cPIR protocols require that the database server executes an algorithm over all the database content at very low speeds which impairs their usage. In [1], given certain assumptions , realistic at the time, Sion and Carbunar showed that cPIR schemes were not practical and most likely would never be. To this day, this conclusion is widely accepted by researchers and practitioners. Using the paradigm shift introduced by lattice-based cryptography , we show 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

show abstract

Section: Related Workmentioning

confidence: 99%

XPIR : Private Information Retrieval for Everyone

Aguilar-Melchor

Barrier

Fousse

et al. 2015

Proceedings on Privacy Enhancing Technologies

116

134

View full text Add to dashboard Cite

show abstract

“…Before concluding, we brie y highlight a few of the most closely related efforts in this space. Kiayias, Leonardos, Lipmaa, Pavlyk, and Tang [25] propose a single-server PIR protocol with asymptotically optimal download cost. For su ciently large records-beyond around 1 GiB each-the download overhead of their scheme is at most a few percent; however, their reliance on number-theoretic assumptions yields computation costs that are prohibitively high for large-scale deployment [29].…”

Section: A Related Workmentioning

confidence: 99%

A Bit More Than a Bit Is More Than a Bit Better

Hafiz

Henry

2019

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

We study both the practical and theoretical efficiency of private information retrieval (PIR) protocols in a model wherein several untrusted servers work to obliviously service remote clients’ requests for data and yet no pair of servers colludes in a bid to violate said obliviousness. In exchange for such a strong security assumption, we obtain new PIR protocols exhibiting remarkable efficiency with respect to every cost metric—download, upload, computation, and round complexity—typically considered in the PIR literature. The new constructions extend a multiserver PIR protocol of Shah, Rashmi, and Ramchandran (ISIT 2014), which exhibits a remarkable property of its own: to fetch a b-bit record from a collection of r such records, the client need only download b + 1 bits total. We find that allowing “a bit more” download (and optionally introducing computational assumptions) yields a family of protocols offering very attractive trade-offs. In addition to Shah et al.’s protocol, this family includes as special cases (2-server instances of) the seminal protocol of Chor, Goldreich, Kushilevitz, and Sudan (FOCS 1995) and the recent DPF-based protocol of Boyle, Gilboa, and Ishai (CCS 2016). An implicit “folklore” axiom that dogmatically permeates the research literature on multiserver PIR posits that the latter protocols are the “most efficient” protocols possible in the perfectly and computationally private settings, respectively. Yet our findings soundly refute this supposed axiom: These special cases are (by far) the least performant representatives of our family, with essentially all other parameter settings yielding instances that are significantly faster.

show abstract

“…There are two major types of PIR protocols. The first type is computational PIR (CPIR) [16], [36], [2], [1], [12], [13], [22], [32], [38], [50], [4] in which the security of the protocol relies on the computational difficulty of solving a mathematical problem in polynomial time by the servers, e.g., factorization of large numbers. Most of the CPIR protocols are designed to be run by a single database server, and therefore to minimize privacy leakage they perform their heavy computations on the whole database (even if a single entry has been queried).…”

Section: Introductionmentioning

confidence: 99%

“…Consequently, single-server and multi-server protocols are suited to different application scenarios. Note that this is a different classification than computational PIR (CPIR) versus information-theoretic PIR (ITPIR), but all single-server PIR protocols fall in the category of computational PIR (CPIR) [16], [36], [2], [1], [12], [13], [22], [32], [38], [50], [4], as proved by Chor et al [17].…”

Section: Introducing Heterogeneous Pirmentioning

confidence: 99%

Heterogeneous Private Information Retrieval

Mozaffari

Houmansadr

2020

Proceedings 2020 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

Private information retrieval (PIR) enables clients to query and retrieve data from untrusted servers without the untrusted servers learning which data was retrieved. In this paper, we present a new class of multi-server PIR protocols, which we call heterogeneous PIR (HPIR). In such multi-server PIR protocols, the computation and communication overheads imposed on the PIR servers are non-uniform, i.e., some servers handle higher computation/communication burdens than the others. This enables heterogeneous PIR protocols to be suitable for a range of new PIR applications. What enables us to enforce such heterogeneity is a unique PIR-tailored secret sharing algorithm that we leverage in building our PIR protocol. We have implemented our HPIR protocol and evaluated its performance in comparison with regular (i.e., homogenous) PIR protocols. Our evaluations demonstrate that a querying client can trade off the computation and communication loads of the (heterogeneous) PIR servers by adjusting some parameters. For example in a two server scenario with a heterogeneity degree of 4/1, to retrieve a 456KB file from a 0.2GB database, the rich (i.e., resourceful) PIR server will do 1.1 seconds worth of computation compared to 0.3 seconds by the poor (resourceconstrained) PIR server; this is while each of the servers would do the same 1 seconds of computation in a homogeneous settings. Also, for this given example, our HPIR protocol will impose a 912KB communication bandwidth on the rich server compared to 228KB on the poor server (by contrast to 456KB overheads on each of the servers for a traditional homogeneous design).

show abstract

Optimal Rate Private Information Retrieval from Homomorphic Encryption

Cited by 31 publications

References 38 publications

XPIR : Private Information Retrieval for Everyone

XPIR : Private Information Retrieval for Everyone

A Bit More Than a Bit Is More Than a Bit Better

Heterogeneous Private Information Retrieval

Contact Info

Product

Resources

About