Avoiding theoretical optimality to efficiently and privately retrieve security updates

Justin Cappos

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

Avoiding theoretical optimality to efficiently and privately retrieve security updates

Justin Cappos

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This work demonstrates the feasibility of building a PIR system with performance similar to non-PIR systems in real situations. Prior Chor PIR systems have chosen block sizes that are theoretically optimized to minimize communication. This (ironically) reduces the throughput of the resulting system by roughly 50x. We constructed a Chor PIR system called upPIR that is efficient by choosing block sizes that are theoretically suboptimal (from a communications standpoint), but fast and efficient in practice. For example, an upPIR mirror running on a threeyear- old desktop provides security updates from Ubuntu 10.04 (1.4 GB of data) fast enough to saturate a T3 link. Measurements run using mirrors distributed around the Internet demonstrate that a client can download software updates with upPIR about as quickly as with FTP.

Original language	English (US)
Title of host publication	Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers
Pages	386-394
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-39884-1_33
State	Published - 2013
Event	17th International Conference on Financial Cryptography and Data Security, FC 2013 - Okinawa, Japan Duration: Apr 1 2013 → Apr 5 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7859 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	17th International Conference on Financial Cryptography and Data Security, FC 2013
Country/Territory	Japan
City	Okinawa
Period	4/1/13 → 4/5/13

Keywords

Performance
Practical Security
Private Information Retrieval

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Cappos, J. (2013). Avoiding theoretical optimality to efficiently and privately retrieve security updates. In Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers (pp. 386-394). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7859 LNCS). https://doi.org/10.1007/978-3-642-39884-1_33

Avoiding theoretical optimality to efficiently and privately retrieve security updates. / Cappos, Justin.
Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers. 2013. p. 386-394 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7859 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cappos, J 2013, Avoiding theoretical optimality to efficiently and privately retrieve security updates. in Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7859 LNCS, pp. 386-394, 17th International Conference on Financial Cryptography and Data Security, FC 2013, Okinawa, Japan, 4/1/13. https://doi.org/10.1007/978-3-642-39884-1_33

Cappos J. Avoiding theoretical optimality to efficiently and privately retrieve security updates. In Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers. 2013. p. 386-394. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-39884-1_33

@inproceedings{8b794dc889544496874eba0ffa5ad802,

title = "Avoiding theoretical optimality to efficiently and privately retrieve security updates",

abstract = "This work demonstrates the feasibility of building a PIR system with performance similar to non-PIR systems in real situations. Prior Chor PIR systems have chosen block sizes that are theoretically optimized to minimize communication. This (ironically) reduces the throughput of the resulting system by roughly 50x. We constructed a Chor PIR system called upPIR that is efficient by choosing block sizes that are theoretically suboptimal (from a communications standpoint), but fast and efficient in practice. For example, an upPIR mirror running on a threeyear- old desktop provides security updates from Ubuntu 10.04 (1.4 GB of data) fast enough to saturate a T3 link. Measurements run using mirrors distributed around the Internet demonstrate that a client can download software updates with upPIR about as quickly as with FTP.",

keywords = "Performance, Practical Security, Private Information Retrieval",

author = "Justin Cappos",

year = "2013",

doi = "10.1007/978-3-642-39884-1_33",

language = "English (US)",

isbn = "9783642398834",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "386--394",

booktitle = "Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers",

note = "17th International Conference on Financial Cryptography and Data Security, FC 2013 ; Conference date: 01-04-2013 Through 05-04-2013",

}

TY - GEN

T1 - Avoiding theoretical optimality to efficiently and privately retrieve security updates

AU - Cappos, Justin

PY - 2013

Y1 - 2013

N2 - This work demonstrates the feasibility of building a PIR system with performance similar to non-PIR systems in real situations. Prior Chor PIR systems have chosen block sizes that are theoretically optimized to minimize communication. This (ironically) reduces the throughput of the resulting system by roughly 50x. We constructed a Chor PIR system called upPIR that is efficient by choosing block sizes that are theoretically suboptimal (from a communications standpoint), but fast and efficient in practice. For example, an upPIR mirror running on a threeyear- old desktop provides security updates from Ubuntu 10.04 (1.4 GB of data) fast enough to saturate a T3 link. Measurements run using mirrors distributed around the Internet demonstrate that a client can download software updates with upPIR about as quickly as with FTP.

AB - This work demonstrates the feasibility of building a PIR system with performance similar to non-PIR systems in real situations. Prior Chor PIR systems have chosen block sizes that are theoretically optimized to minimize communication. This (ironically) reduces the throughput of the resulting system by roughly 50x. We constructed a Chor PIR system called upPIR that is efficient by choosing block sizes that are theoretically suboptimal (from a communications standpoint), but fast and efficient in practice. For example, an upPIR mirror running on a threeyear- old desktop provides security updates from Ubuntu 10.04 (1.4 GB of data) fast enough to saturate a T3 link. Measurements run using mirrors distributed around the Internet demonstrate that a client can download software updates with upPIR about as quickly as with FTP.

KW - Performance

KW - Practical Security

KW - Private Information Retrieval

UR - http://www.scopus.com/inward/record.url?scp=84883302938&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883302938&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39884-1_33

DO - 10.1007/978-3-642-39884-1_33

M3 - Conference contribution

AN - SCOPUS:84883302938

SN - 9783642398834

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 386

EP - 394

BT - Financial Cryptography and Data Security - 17th International Conference, FC 2013, Revised Selected Papers

T2 - 17th International Conference on Financial Cryptography and Data Security, FC 2013

Y2 - 1 April 2013 through 5 April 2013

ER -

Avoiding theoretical optimality to efficiently and privately retrieve security updates

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this