Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

XPIR : Private Information Retrieval for Everyone

XPIR : Private Information Retrieval for Everyone Abstract A 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 mutuallydistrustful 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

XPIR : Private Information Retrieval for Everyone

Download PDF
20 pages

Loading next page...
 
/lp/de-gruyter/xpir-private-information-retrieval-for-everyone-oxmHIbxaEP
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2016-0010
Publisher site
See Article on Publisher Site

Abstract

Abstract A 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 mutuallydistrustful 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.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Apr 1, 2016

References

  • Practical server privacy with secure coprocessors vol no pp
    Smith
  • III Private Searching on Streaming Data in Advances in - th Annual International Cryptology Conference Santa Barbara California of in
    Ostrovsky
  • Public - key cryptosystems based on composite degree residuosity classes in th Annual Eurocrypt Conference Republic vol of in
    Paillier
  • Replication is not needed : Single database computationally - private information retrieval extended abstract in on Foundations of Computer pp
    Kushilevitz
  • Cryptanalysis of a somewhat additively homomorphic encryption scheme used in pir in rd Workshop on Encrypted
    Lepoint
  • and private media consumption with popcorn Cryptology ePrint Archive Report http eprint iacr org
    Gupta
  • Oblivious Functions of in
    Freedman
  • anonymous communication using private information retrieval in
    Mittal
  • Marc All - or - Nothing Disclosure of Secrets in ed vol of in pp
    Gilles Brassard
  • Internet packet size distributions Some observations Rep ISI Institute released as web page http netweb usc edu rsinha pkt sizes
    Sinha
  • One block size fits all and spir with variable - length records via multi - block queries Proceedings of
    Henry
  • The best of both worlds : Combining information - theoretic and computational pir for communication efficiency in
    Devet
  • Bandwidth efficient pir from ntru in nd Workshop on and Encrypted
    Doröz
  • Goldwasser Probabilistic encryption of and System vol no pp
    Micali
  • Faster arithmetic for number - theoretic transforms
    Harvey
  • On the Computational Practicality of Private in th ISOC Network and Distributed Systems San CA
    Sion
  • Fully homomorphic encryption from ring - lwe and security for key dependent messages in Advances in Cryptology - st Annual Cryptology Conference vol
    Brakerski
  • Practical server privacy with secure coprocessors vol no pp
    Smith
  • Efficient private file retrieval by combining in Proceedings of Annual Network Distributed System
    Mayberry
  • On ideal lattices and learning with errors over rings in of in
    Lyubashevsky
  • Public - key cryptosystems based on composite degree residuosity classes in th Annual Eurocrypt Conference Republic vol of in
    Paillier
  • chiffrement asymétrique et la sécurité prouvée Habilitation à diriger des recherches Université Paris VII
    Pointcheval
  • ISO High efficiency coding and media delivery in heterogeneous environments - part High efficiency video coding Rep ISO International Standards Organization Publication
  • and private media consumption with popcorn Cryptology ePrint Archive Report http eprint iacr org
    Gupta
  • III Private Searching on Streaming Data in Advances in - th Annual International Cryptology Conference Santa Barbara California of in
    Ostrovsky
  • Secure Games with Polynomial Expressions in International Colloquium on Automata and
    Kiayias
  • Oblivious Functions of in
    Freedman
  • Comparison of the coding efficiency of video coding standards ; including high efficiency video coding hevc Circuits and Systems for Video Technology IEEE Transactions on
    Ohm
  • New lattice based cryptographic constructions of the vol no pp
    Regev
  • implementation of a homomorphic - encryption
    Halevi
  • Software speed records for lattice - based signatures in Post - Quantum ed vol of in pp Springer Verlag Document ID aa a de a http cryptojedi org papers lattisigns
    Güneysu
  • Faster arithmetic for number - theoretic transforms
    Harvey
  • III Private searching on streaming data vol no pp
    Ostrovsky
  • Comparison of the coding efficiency of video coding standards ; including high efficiency video coding hevc Circuits and Systems for Video Technology IEEE Transactions on
    Ohm
  • New Efficient All - Or - Nothing Disclosure of Secrets Protocol in th Annual International Conference on the Theory and Application of Cryptology Beijing China vol of in
    Stern
  • On the Computational Practicality of Private in th ISOC Network and Distributed Systems San CA
    Sion
  • Achieving efficient query privacy for location based services in eds of in pp
    Olumofin
  • Private Stream Search at the same communication cost as a regular search : Role of LDPC codes in Information Theory Proceedings International on pp
    Finiasz
  • On the design of hardware building blocks for modern lattice - based encryption schemes in and - eds of in
    Göttert
  • Computational inexpensive Draft available online at http www cs umd edu arkady pir pirComp pdf
    Gasarch
  • implementation of a homomorphic - encryption
    Halevi
  • On the design of hardware building blocks for modern lattice - based encryption schemes in and - eds of in
    Göttert
  • ISO High efficiency coding and media delivery in heterogeneous environments - part High efficiency video coding Rep ISO International Standards Organization Publication
  • Fully homomorphic encryption from ring - lwe and security for key dependent messages in Advances in Cryptology - st Annual Cryptology Conference vol
    Brakerski
  • Pietro Prism - privacy - preserving search in mapreduce in eds vol of in pp
    Blass
  • Pietro Prism - privacy - preserving search in mapreduce in eds vol of in pp
    Blass
  • Survey on Private of the European Association for vol pp Feb Columns
    Gasarch
  • Computational inexpensive Draft available online at http www cs umd edu arkady pir pirComp pdf
    Gasarch
  • Goldwasser Probabilistic encryption of and System vol no pp
    Micali
  • Sudan Reconstructing curves in three higher dimensional space from noisy data in Proceedings of the th Annual ACM Symposium on Theory of San California New York
    Coppersmith
  • Cryptanalysis of a homomorphic encryption scheme from isit in Information Theory Proceedings International on
    Bi
  • Sudan Reconstructing curves in three higher dimensional space from noisy data in Proceedings of the th Annual ACM Symposium on Theory of San California New York
    Coppersmith
  • Cryptanalysis of a homomorphic encryption scheme from isit in Information Theory Proceedings International on
    Bi
  • New algorithms for learning in presence of errors in Automata Languages and th International Colloquium Eindhoven The Netherlands pp
    Arora
  • Revisiting the computational practicality of private information in and ed vol of in pp
    Olumofin
  • Chor Goldreich Kushilevitz Sudan Private in th on Foundations of Pittsburgh PA pp
    FOCS
  • New Efficient All - Or - Nothing Disclosure of Secrets Protocol in th Annual International Conference on the Theory and Application of Cryptology Beijing China vol of in
    Stern
  • New algorithms for learning in presence of errors in Automata Languages and th International Colloquium Eindhoven The Netherlands pp
    Arora
  • Efficient computationally private information retrieval from anonymity or trapdoor groups in and eds of in
    Trostle
  • leveled fully homomorphic encryption without bootstrapping in Proceedings of the rd Innovations in New York
    Brakerski
  • Efficient computationally private information retrieval from anonymity or trapdoor groups in and eds of in
    Trostle
  • The best of both worlds : Combining information - theoretic and computational pir for communication efficiency in
    Devet
  • Private Stream Search at the same communication cost as a regular search : Role of LDPC codes in Information Theory Proceedings International on pp
    Finiasz
  • Privacy - preserving queries over relational databases in eds vol of in pp
    Olumofin
  • anonymous communication using private information retrieval in
    Mittal
  • Chor Goldreich Kushilevitz Sudan Private in th on Foundations of Pittsburgh PA pp
    FOCS
  • chiffrement asymétrique et la sécurité prouvée Habilitation à diriger des recherches Université Paris VII
    Pointcheval
  • Revisiting the computational practicality of private information in and ed vol of in pp
    Olumofin
  • Achieving efficient query privacy for location based services in eds of in pp
    Olumofin
  • III Private searching on streaming data vol no pp
    Ostrovsky
  • Secure Games with Polynomial Expressions in International Colloquium on Automata and
    Kiayias
  • Replication is not needed : Single database computationally - private information retrieval extended abstract in on Foundations of Computer pp
    Kushilevitz
  • Cryptanalysis of a somewhat additively homomorphic encryption scheme used in pir in rd Workshop on Encrypted
    Lepoint
  • Privacy - preserving queries over relational databases in eds vol of in pp
    Olumofin
  • Optimal rate private information retrieval from homomorphic encryption vol no pp
    Kiayias
  • Optimal rate private information retrieval from homomorphic encryption vol no pp
    Kiayias
  • Better key sizes attacks for lwe based encryption in ed vol of in pp
    Lindner
  • Internet packet size distributions Some observations Rep ISI Institute released as web page http netweb usc edu rsinha pkt sizes
    Sinha
  • On ideal lattices and learning with errors over rings in of in
    Lyubashevsky
  • Efficient private file retrieval by combining in Proceedings of Annual Network Distributed System
    Mayberry
  • New lattice based cryptographic constructions of the vol no pp
    Regev
  • Marc All - or - Nothing Disclosure of Secrets in ed vol of in pp
    Gilles Brassard
  • One block size fits all and spir with variable - length records via multi - block queries Proceedings of
    Henry
  • leveled fully homomorphic encryption without bootstrapping in Proceedings of the rd Innovations in New York
    Brakerski
  • Software speed records for lattice - based signatures in Post - Quantum ed vol of in pp Springer Verlag Document ID aa a de a http cryptojedi org papers lattisigns
    Güneysu
  • Bandwidth efficient pir from ntru in nd Workshop on and Encrypted
    Doröz
  • Better key sizes attacks for lwe based encryption in ed vol of in pp
    Lindner
  • Survey on Private of the European Association for vol pp Feb Columns
    Gasarch