vix.ing · top · new · best · stats

QKD-based quantum private query without a failure probability

2015/09/04 by Bin Liu, Fei Gao, Wei Huang +2 · 106 citations
Computer Science · Physics and Astronomy · #Cryptographic protocol #Database security #Noise (video) #Private information retrieval #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Stability (learning theory) #Upper and lower bounds #quant-ph

paper · pdf · doi:10.1007/s11433-015-5714-3

published in Science China Physics Mechanics and Astronomy 58(10) (Springer Science+Business Media) · 7 pages, 1 figure

openalex publication_date 2015/09/04 · arxiv created 2015/11/17 · arxiv updated 2015/11/20 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

In this paper, we present a quantum-key-distribution (QKD)-based quantum private query (QPQ) protocol utilizing single-photon signal of multiple optical pulses. It maintains the advantages of the QKD-based QPQ, i.e., easy to implement and loss tolerant. In addition, different from the situations in the previous QKD-based QPQ protocols, in our protocol, the number of the items an honest user will obtain is always one and the failure probability is always zero. This characteristic not only improves the stability (in the sense that, ignoring the noise and the attack, the protocol would always succeed), but also benefits the privacy of the database (since the database will no more reveal additional secrets to the honest users). Furthermore, for the user's privacy, the proposed protocol is cheat sensitive, and for security of the database, we obtain an upper bound for the leaked information of the database in theory.

Citations