Private Database Queries Using Quantum States with Limited Coherence Times

We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches.

[1]  Jorge Sánchez,et al.  Entropic uncertainty and certainty relations for complementary observables , 1993 .

[2]  Robert W. Heath,et al.  On quasi-orthogonal signatures for CDMA systems , 2006, IEEE Transactions on Information Theory.

[3]  Tad Hogg,et al.  Quantum Auctions , 2007, 0704.0800.

[4]  Maassen,et al.  Generalized entropic uncertainty relations. , 1988, Physical review letters.

[5]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[6]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Li Zhang,et al.  REDUCED ENTANGLEMENT FOR QUANTUM GAMES , 2003 .

[8]  William I. Gasarch,et al.  A Survey on Private Information Retrieval (Column: Computational Complexity) , 2004, Bull. EATCS.

[9]  Elias M. Stein,et al.  Interpolation of linear operators , 1956 .

[10]  David A. Meyer,et al.  Quantum Communication in Games , 2004 .

[11]  Y. Katznelson.  An Introduction to Harmonic Analysis: Interpolation of Linear Operators , 1968 .

[12]  Pierfrancesco La Mura.  Correlated Equilibria of Classical Strategic Games with Quantum Signals , 2003, ArXiv.

[13]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Ronald de Wolf,et al.  Quantum symmetrically-private information retrieval , 2003, Inf. Process. Lett..

[15]  Ashwin Nayak,et al.  Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  Claude Crépeau,et al.  Oblivious transfer with a memory-bounded receiver , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  A. Calderbank,et al.  Z4‐Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line‐Sets , 1997 .

[18]  Yuval Ishai,et al.  Protecting data privacy in private information retrieval schemes , 1998, STOC '98.

[19]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[20]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[21]  Tad Hogg,et al.  Quantum Solution of Coordination Problems , 2003, Quantum Inf. Process..

[22]  S. J. van Enk,et al.  Classical rules in quantum games , 2002 .

[23]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[24]  Tad Hogg,et al.  QUANTUM AUCTIONS USING ADIABATIC EVOLUTION: THE CORRUPT AUCTIONEER AND CIRCUIT IMPLEMENTATIONS , 2007, 0707.2051.

[25]  Nicholas M. Katz,et al.  Random matrices, Frobenius eigenvalues, and monodromy , 1998 .

[26]  Tad Hogg,et al.  Protecting privacy while revealing data , 2002, Nature Biotechnology.

[27]  Tad Hogg,et al.  A Quantum Treatment of Public Goods Economics , 2002, Quantum Inf. Process..

[28]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[29]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.