Avoiding Theoretical Optimality to Efficiently and Privately Retrieve Security Updates

Cappos, Justin

doi:10.1007/978-3-642-39884-1_33

Cited by 11 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Olumofin showed that Goldberg's system [20] can be one to three orders of magnitude faster than transferring the entire database. Cappos [3] also demonstrated that Chor's PIR scheme can be implemented with high computational efficiency and that its performance is similar to non-private protocols such as HTTP and FTP in practice.…”

Section: Related Workmentioning

confidence: 92%

“…Using fast XOR operations allows us to reuse the same high performance PIR mirror infrastructure that has been shown to have similar goodput to FTP on realistic datasets and deployment environments [3]. However, using multiple block requests has benefits over this existing PIR scheme.…”

Section: Introductionmentioning

confidence: 94%

“…To understand the scope of issues that our work will address, we use the following threat model which comes from prior work [3], [9].…”

Section: B Threat Modelmentioning

confidence: 99%

“…Computational PIR [4]- [7], which leverages a single database server, is known to be impractical [8]. However, recent results have shown that information-theoretic PIR [9], which uses multiple mirrors that containing copies of the server data, can, in some cases, perform in a similar manner to non-PIR systems [3], [10].…”

Section: Introductionmentioning

confidence: 99%

“…For example, an inventor may want to query a patent database without revealing which patents she wants to retrieve [1], a trader may want to get specific stock quotes without revealing the investment she may have or want to make [2], or a client may want to download a security update without revealing which unpatched vulnerability the update addresses [3]. Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing the queries to anyone, including the database server itself.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Fast Multi-Server, Multi-Block Private Information Retrieval Protocol

Wang

Kuppusamy

Liu

et al. 2014

2015 IEEE Global Communications Conference (GLOBECOM)

Self Cite

View full text Add to dashboard Cite

Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing which information in the database was queried. The traditional information-theoretic PIR schemes utilize multiple servers to download a single data block, thus incurring high communication overhead and high computation burdens. In this paper, we develop an information-theoretic multi-block PIR scheme that significantly reduces client communication and computation overheads by downloading multiple data blocks at a time. The design of k-safe binary matrices insures the information will not be revealed even if up to k servers collude. Our scheme has much lower overhead than classic PIR schemes. The implementation of fast XOR operations benefits both servers and clients in reducing coding and decoding time. Our work demonstrates that multiblock PIR scheme can be optimized to simultaneously achieve low communication and computation overhead, comparable to even non-PIR systems, while maintaining a high level of privacy.

show abstract

Section: Related Workmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 94%

“…To understand the scope of issues that our work will address, we use the following threat model which comes from prior work [3], [9].…”

Section: B Threat Modelmentioning

confidence: 99%