Verifiable Single-Server Private Information Retrieval

Single-server Private Information Retrieval (SPIR) allows a client to privately retrieve some data from a database stored on a server. While many SPIR schemes exist, these previous SPIR schemes are generally under the honest-but-curious server model. This model however is not suitable for many real world scenarios such as involving the untrusted cloud server. In this paper, we first propose an SPIR scheme that is based on the learning with (binary) errors assumption under the honest-but-curious server model. Specifically, compared with some previous SPIR schemes, our proposal provides a low communication complexity. Then, according to the above warm-up scheme, we introduce a Verifiable SPIR (VSPIR) scheme under the malicious server model where the server may provide some fraudulent answers. To the best of our knowledge, our scheme is the first practical VSPIR scheme that employs the probabilistic verification process. Finally, for our proposal, we present the theoretical analyses of the properties (i.e., correctness, privacy and security), and give the detailed implementation results.

[1]  Chris Peikert,et al.  Generating Shorter Bases for Hard Random Lattices , 2009, STACS.

[2]  Reihaneh Safavi-Naini,et al.  Verifiable Multi-server Private Information Retrieval , 2014, ACNS.

[3]  Johannes A. Buchmann,et al.  On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack , 2016, AFRICACRYPT.

[4]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[5]  Sanjeev Kumar Mishra On Symmetrically Private Information Retrieval , 2000, IACR Cryptol. ePrint Arch..

[6]  Daniele Micciancio,et al.  Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions , 2011, CRYPTO.

[7]  Yael Tauman Kalai,et al.  Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..

[8]  Craig Gentry,et al.  A Simple BGN-Type Cryptosystem from LWE , 2010, EUROCRYPT.

[9]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.

[10]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Chris Peikert,et al.  Hardness of SIS and LWE with Small Parameters , 2013, CRYPTO.

[13]  Ian Goldberg,et al.  Improving the Robustness of Private Information Retrieval , 2007 .

[14]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[15]  Noboru Kunihiro,et al.  Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem , 2015, SAC.

[16]  Chris Peikert,et al.  Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.