Paper 2017/813
Industrial Feasibility of Private Information Retrieval
Angela Jäschke, Björn Grohmann, Frederik Armknecht, and Andreas Schaad
Abstract
A popular security problem in database management is how to guarantee to a querying party that the database owner will not learn anything about the data that is retrieved --- a problem known as Private Information Retrieval (PIR). While a variety of PIR schemes are known, they are rarely considered for practical use cases yet. We investigate the feasibility of PIR in the telecommunications world to open up data of carriers to external parties. To this end, we first provide a comparative survey of the current PIR state of the art (including ORAM schemes as a generalized concept) as well as implementation and analysis of two PIR schemes for the considered use case. While an overall conclusion is that PIR techniques are not too far away from practical use in specific cases, we see ORAM as a more suitable candidate for further R\&D investment.
Note: Revised: Citations were not compiled properly
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Published elsewhere. Major revision. SECRYPT
- DOI
- 10.5220/0006382003950400
- Keywords
- Private Information retrievalSurveyImplementation
- Contact author(s)
- jaeschke @ uni-mannheim de
- History
- 2017-09-01: revised
- 2017-08-31: received
- See all versions
- Short URL
- https://ia.cr/2017/813
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/813, author = {Angela Jäschke and Björn Grohmann and Frederik Armknecht and Andreas Schaad}, title = {Industrial Feasibility of Private Information Retrieval}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/813}, year = {2017}, doi = {10.5220/0006382003950400}, url = {https://eprint.iacr.org/2017/813} }