Flexible quantum private queries based on quantum key distribution

Abstract

We present a flexible quantum-key-distribution-based protocol for quantum private queries. Similar to M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], it is loss tolerant, practical and robust against quantum memory attack. Furthermore, our protocol is more flexible and controllable. We show that, by adjusting the value of $\theta$, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter $k$ is generally smaller (even $k=1$ can be achieved) when $\theta <\pi /4$, which implies lower complexity of both quantum and classical communications. Furthermore, the users can choose a smaller $\theta$ to get better database security, or a larger $\theta$ to obtain a lower probability with which Bob can correctly guess the address of Alice's query.

6 pages, 5 figures

References in corpus (6)

• Quantum Cryptography
• Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations
• Practical private database queries based on a quantum key distribution protocol
• Quantum private queries
• Optimum unambiguous discrimination of two mixed quantum states
• Quantum Private Queries: security analysis

Cited by in corpus (9)

• Post-processing of the oblivious key in quantum private queries
• QKD-based quantum private query without a failure probability
• Performing private database queries in a real-world environment using a quantum protocol
• Device Independent Quantum Private Query
• Multi-user quantum private comparison with scattered preparation and one-way convergent transmission of quantum states
• A Quantum-based Database Query Scheme for Privacy Preservation in Cloud Environment
• Improved and Formal Proposal for Device Independent Quantum Private Query
• Quantum Privacy-Preserving Price E-Negotiation
• Quantum oblivious transfer: a short review