Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1706.07575 · IEEE Transactions on Computers

A Generic Construction of Quantum-Oblivious-Key-Transfer-Based Private Query with Ideal Database Security and Zero Failure

Chun‐Yan Wei, Xiao‐Qiu Cai, Bin Liu, Tian‐Yin Wang, Fei Gao

Published Jun 29, 2017• 149 citations
arXivHTMLPDF

Abstract

Higher security and lower failure probability have always been people's pursuits in quantum-oblivious-key-transfer-based private query (QOKT-PQ) protocols since Jacobi et al. [Phys. Rev. A 83, 022301 (2011)] proposed the first protocol of this kind. However, higher database security generally has to be obtained at the cost of a higher failure probability, and vice versa. Recently, based on a round-robin differential-phase-shift quantum key distribution protocol, Liu et al. [Sci. China-Phys. Mech. Astron., 58, 100301 (2015)] presented a private query protocol (RRDPS-PQ protocol) utilizing ideal single-photon signal which realizes both ideal database security and zero failure probability. However, ideal single-photon source is not available today, and for large database the required pulse train is too long to implement. Here, we reexamine the security of RRDPS-PQ protocol under imperfect source and present an improved protocol using a special “low-shift and addition” (LSA) technique, which not only can be used to query from large database but also retains the features of “ideal database security” and “zero-failure” even under weak coherent source. Finally, we generalize the LSA technique and establish a generic QOKT-PQ model in which both “ideal database security” and “zero failure” are achieved via acceptable communications.

DOI
10.1109/tc.2017.2721404

Related papers

Postprocessing of the Oblivious Key in Quantum Private Query

Fei Gao, Bin Liu, Wei Huang +1 more

Private query is a kind of cryptographic protocols to protect both users' privacies in their communication. For instance, Alice wants to buy one item from Bob's database. The aim of private query is to ensure that Alice can get only one item from Bob, and simultaneously, Bob cannot know which one was taken by Alice. In pursuing high security and efficiency, some quantum private query protocols were proposed. As a practical model, Quantum-Oblivious-Key-Transfer (QOKT)-based private query, which utilizes a QOKT protocol to distribute oblivious key between Alice and Bob and then applies the key to achieve the aim of private query, has drawn much attention. Here, we focus on postprocessing of the oblivious key, and the following two contributions are achieved. 1) We analyze three recently proposed dilution methods and find two of them have serious security loophole. That is, Alice can illegally obtain much additional information about Bob's database by multiple queries. For example, Alice can obtain the whole database, which contains 104items, by only 53.4 queries averagely. 2) We present an effective error-correction method for the oblivious key, which can address the realistic scenario with channel noises and make QOKT-based private query more practical.

arXiv:1406.0589•IEEE Journal of Selected Topics in Quantum Electronics•Sep 16, 2014•125 citations

Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution

Jian Li, Yu‐Guang Yang, Xiu‐Bo Chen +2 more

A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security.

Scientific Reports•Aug 19, 2016•26 citations

Security proof for round-robin differential-quadrature-phase-shift quantum key distribution

Yang-Guang Shan, Zhen−Qiang Yin, Hang Liu +5 more

By introducing four-phase modulations into round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) protocol, the round-robin-differential-quadrature-phase-shift (RRDQPS) protocol is proposed. According to the security proof of RRDQPS protocol, it is able to tolerate a higher error rate of key bits. However, its performance with a practical weak coherent source is still unknown since that security proof only applies to a single photon source. In this article, we give the security proof for the general $n$-photon RRDQPS protocol, by which RRDQPS with a practical weak coherent source becomes feasible in the experiment. Through numerical simulation, it is verified that RRDQPS protocol has an advantage over RRDPS protocol on transmission distance, especially when the pulse number is small.

Physical Review A•Mar 24, 2022•2 citations

Security proof for single-photon round-robin differential-quadrature-phase-shift quantum key distribution

Rong Wang, Zhen−Qiang Yin, Chaohan Cui +4 more

Combining the differential-quadrature-phase-shift (DQPS) quantum key distribution (QKD) protocol and the recently proposed round-robin-differential-phase-shift (RRDPS), the round-robin-differential-quadrature-phase-shift (RRDQPS) protocol has been proposed. However, a security proof of the RRDQPS QKD protocol is still missing and its advantage over the original RRDPS protocol is also unknown. Here, we give the security proof of single-photon RRDQPS protocol, by which we clearly show that, if a single photon source is applied, RRDQPS protocol will overwhelm the original RRDPS protocol in terms of tolerable error rate. More interestingly, our proof gives a unified theory covering the well-known Bennett-Brassard 1984 (BB84) protocol and RRDQPS protocol. Thus, it is confirmed that BB84 protocol is indeed a special case of the RRDQPS protocol.

Physical Review A•Dec 26, 2018•6 citations

Security of round-robin differential-phase-shift quantum-key-distribution protocol with correlated light sources

Akihiro Mizutani, Go Kato

Among various quantum-key-distribution (QKD) protocols, the round-robin differential-phase- shift (RRDPS) protocol has a unique feature where its security is guaranteed without monitoring the signal disturbance. Moreover, this protocol has the remarkable property of being robust against source imperfections, assuming that the emitted pulses are independent. Unfortunately, some experiments with high-speed QKD systems confirmed the violation of the independence due to pulse correlations, and therefore the lack of a security proof, without taking into account this effect is an obstacle for guaranteeing the implementation security. In this paper, we show that the RRDPS protocol is secure against any source imperfections by establishing a security proof with the pulse correlations. The proof is simple in the sense that we make only three experimentally simple assumptions on the source. Our numerical simulation based on the proof shows that the long-range pulse correlation does not cause a significant impact on the key rate, which reveals another striking feature of the RRDPS protocol. Our security proof is thus effective and applicable to a wide range of practical sources and paves the way to realizing truly secure QKD in high-speed systems.

arXiv:2107.02593•Physical Review A•Dec 15, 2021•12 citations

Device Independent Quantum Private Queries Based on Quantum Key Distribution

Li Liu, Qingshan Du, Xu Kuo Gao

Symmetric private information retrieval (SPIR) protocol is proposed for users to retrieve items from a database holder without revealing the retrieval address, and meanwhile the users cannot learn any additional entries of the database. Quantum key distribution (QKD)-based quantum private queries (QPQs) are the most practical protocols for the SPIR problem. However, most existing protocols assume ideal devices. To overcome this drawback, we propose a device independent QPQ protocol based on QKD with imperfect sources and detectors. By constructing the semi-definite programming optimization problem, we give the CHSH test threshold and prove the correctness of our protocol. We use the shift and permutation post-processing technique to further improve the security. We compare the performance of our protocol with a recent full device-independent QPQ. and discuss their relative advantages. The simulation results show that our protocol improves database security, user privacy and efficiency. The number of final key bits that Alice knows is close to 1, and Bob’s guessing probability is below 0.15 in our protocol. Moreover, the proposed scheme can be used for any entanglement-based QPQ protocol to remove trust on the devices.

Mathematics•Mar 13, 2025•1 citation
Higher security and lower failure probability have always been people's pursuits in quantum-oblivious-key-transfer-based private query (QOKT-PQ) protocols since Jacobi et al. [Phys. Rev. A 83, 022301 (2011)] proposed the first protocol of this kind. However, higher database security generally has to be obtained at the cost of a higher failure probability, and vice versa. Recently, based on a round-robin differential-phase-shift quantum key distribution protocol, Liu et al. [Sci. China-Phys. Mech. Astron., 58, 100301 (2015)] presented a private query protocol (RRDPS-PQ protocol) utilizing ideal single-photon signal which realizes both ideal database security and zero failure probability. However, ideal single-photon source is not available today, and for large database the required pulse train is too long to implement. Here, we reexamine the security of RRDPS-PQ protocol under imperfect source and present an improved protocol using a special “low-shift and addition” (LSA) technique, which not only can be used to query from large database but also retains the features of “ideal database security” and “zero-failure” even under weak coherent source. Finally, we generalize the LSA technique and establish a generic QOKT-PQ model in which both “ideal database security” and “zero failure” are achieved via acceptable communications.
Private query is a kind of cryptographic protocols to protect both users' privacies in their communication. For instance, Alice wants to buy one item from Bob's database. The aim of private query is to ensure that Alice can get only one item from Bob, and simultaneously, Bob cannot know which one was taken by Alice. In pursuing high security and efficiency, some quantum private query protocols were proposed. As a practical model, Quantum-Oblivious-Key-Transfer (QOKT)-based private query, which utilizes a QOKT protocol to distribute oblivious key between Alice and Bob and then applies the key to achieve the aim of private query, has drawn much attention. Here, we focus on postprocessing of the oblivious key, and the following two contributions are achieved. 1) We analyze three recently proposed dilution methods and find two of them have serious security loophole. That is, Alice can illegally obtain much additional information about Bob's database by multiple queries. For example, Alice can obtain the whole database, which contains 104items, by only 53.4 queries averagely. 2) We present an effective error-correction method for the oblivious key, which can address the realistic scenario with channel noises and make QOKT-based private query more practical.
A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security.
By introducing four-phase modulations into round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) protocol, the round-robin-differential-quadrature-phase-shift (RRDQPS) protocol is proposed. According to the security proof of RRDQPS protocol, it is able to tolerate a higher error rate of key bits. However, its performance with a practical weak coherent source is still unknown since that security proof only applies to a single photon source. In this article, we give the security proof for the general nnn-photon RRDQPS protocol, by which RRDQPS with a practical weak coherent source becomes feasible in the experiment. Through numerical simulation, it is verified that RRDQPS protocol has an advantage over RRDPS protocol on transmission distance, especially when the pulse number is small.
Combining the differential-quadrature-phase-shift (DQPS) quantum key distribution (QKD) protocol and the recently proposed round-robin-differential-phase-shift (RRDPS), the round-robin-differential-quadrature-phase-shift (RRDQPS) protocol has been proposed. However, a security proof of the RRDQPS QKD protocol is still missing and its advantage over the original RRDPS protocol is also unknown. Here, we give the security proof of single-photon RRDQPS protocol, by which we clearly show that, if a single photon source is applied, RRDQPS protocol will overwhelm the original RRDPS protocol in terms of tolerable error rate. More interestingly, our proof gives a unified theory covering the well-known Bennett-Brassard 1984 (BB84) protocol and RRDQPS protocol. Thus, it is confirmed that BB84 protocol is indeed a special case of the RRDQPS protocol.
Among various quantum-key-distribution (QKD) protocols, the round-robin differential-phase- shift (RRDPS) protocol has a unique feature where its security is guaranteed without monitoring the signal disturbance. Moreover, this protocol has the remarkable property of being robust against source imperfections, assuming that the emitted pulses are independent. Unfortunately, some experiments with high-speed QKD systems confirmed the violation of the independence due to pulse correlations, and therefore the lack of a security proof, without taking into account this effect is an obstacle for guaranteeing the implementation security. In this paper, we show that the RRDPS protocol is secure against any source imperfections by establishing a security proof with the pulse correlations. The proof is simple in the sense that we make only three experimentally simple assumptions on the source. Our numerical simulation based on the proof shows that the long-range pulse correlation does not cause a significant impact on the key rate, which reveals another striking feature of the RRDPS protocol. Our security proof is thus effective and applicable to a wide range of practical sources and paves the way to realizing truly secure QKD in high-speed systems.
Symmetric private information retrieval (SPIR) protocol is proposed for users to retrieve items from a database holder without revealing the retrieval address, and meanwhile the users cannot learn any additional entries of the database. Quantum key distribution (QKD)-based quantum private queries (QPQs) are the most practical protocols for the SPIR problem. However, most existing protocols assume ideal devices. To overcome this drawback, we propose a device independent QPQ protocol based on QKD with imperfect sources and detectors. By constructing the semi-definite programming optimization problem, we give the CHSH test threshold and prove the correctness of our protocol. We use the shift and permutation post-processing technique to further improve the security. We compare the performance of our protocol with a recent full device-independent QPQ. and discuss their relative advantages. The simulation results show that our protocol improves database security, user privacy and efficiency. The number of final key bits that Alice knows is close to 1, and Bob’s guessing probability is below 0.15 in our protocol. Moreover, the proposed scheme can be used for any entanglement-based QPQ protocol to remove trust on the devices.