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

IEEE Access

Quantum Private Query With Perfect Performance Universally Applicable Against Collective-Noise

Na Li, Jian Li, Xiu‐Bo Chen, Yu‐Guang Yang

Published Jan 1, 2019• 11 citations
Publisher

Abstract

Almost all of the previous quantum private query (QPQ) protocols are always based on an ideal environment without any noise. Nevertheless, due to the defects of the channel, channel noise inevitably exists in the actual transmission process, which will give rise to transmission error and reduce the probability of successful quantum transmission. An eavesdropper may disguise her actions as channel noise to avoid being detected by legitimate parties during security checks. To solve this problem, we present a QPQ protocol with perfect performance universally applicable against collective noise. Concretely, the protocol encodes bits in noiseless subspace and thus can function over a quantum channel subjected to an arbitrary degree of collective noise, as occurs, for instance, due to polarization rotation in an optical fiber. Furthermore, Bob cannot get the information about Alice's choice at all by taking fake entangled attack and by taking fake photon attack, the probability Bob can get the information about Alice's choice is only approximately 6.7%, which is far less than the probability of 25% in Yang et al.'s protocol. Moreover, the conclusiveness of the user Alice's measurement results is subject to quantum randomness rather than allowing Alice to choose by herself to obtain a conclusive result in Wei et al.'s protocol, which prevents Alice's intuitive attack and meanwhile makes it arduous for Bob to perform the joint-measurement attack. Our protocol uses only one state, which reduces the communication complexity, and is, therefore, an effective QPQ solution with the high-security level.

DOI
10.1109/access.2019.2893341

Related papers

Error Tolerance Bound in QKD-Based Quantum Private Query

Chun‐Yan Wei, Xiao‐Qiu Cai, Tian‐Yin Wang +3 more

Most existing quantum private query (QPQ) protocols can hardly work in the presence of noise. The user Alice may obtain a false database item in noisy environments and both participants may cheat under the disguise of noise, so dealing with the noise needs an overall consideration of error correction, user privacy and database security. However, the only two existing protocols aiming to correct errors in QPQ lack such an overall consideration (at least one party's privacy can be revealed), and they did not estimate what extent of errors can be tolerated (actually, noise is seldom discussed in quantum two-party secure computations, and to the best of our knowledge, relevant bounds on tolerable errors remain unattainable so far). To solve this problem, we first exemplify how one participant reveals the other party's privacy in the existing QPQ protocols aiming to correct errors. Then we propose a practical protocol which can really work via noisy channel, that is, the error rate of the retrieved database item is reduced significantly and both parties' privacy are well protected. Besides, we deduce that the final error rate, user privacy and database security are pairwise in a “trade-off” relationship. By balancing them according to the required level of security and reliability, we obtain an upper bound on tolerable errors.

IEEE Journal on Selected Areas in Communications•Jan 23, 2020•60 citations

Quantum private information retrieval over a collective noisy channel

Yu‐Guang Yang, Peng-Ze Yang, Guang‐Bao Xu +2 more

Quantum Private Information Retrieval (QPIR) allows a user (Alice) to retrieve a database item from the database owned by the database holder (Bob) in such a way that Alice can query only the database item she wants, but cannot get other items, and Bob does not know which item Alice queries. However, the real quantum channel between Alice and Bob is noisy, and the noise may result in not only the chance that Alice obtains a false item, but also that both parties may cheat by camouflaging themselves with noise. In this paper, we use the decoherence-free subspace (DFS) for QPIR, which we call DFS-QPIR. The DFS-QPIR protocol removes the effect of the channel noise on the errors in the retrieved item so that two parties cannot cheat by replacing the noisy channel with a noiseless one. It can work over a collective noisy channel while retaining high reliability, database security and user privacy simultaneously. While only the collective unitary noise is taken into account, the proposed DFS-QPIR protocol can be straightforwardly extended to more general collective noise channel.

Modern Physics Letters A•Jan 10, 2023•6 citations

Practical quantum private query with better performance in resisting joint-measurement attack

Chun‐Yan Wei, Tian‐Yin Wang, Fei Gao

As a kind of practical protocol, quantum-key-distribution (QKD)-based quantum private queries (QPQs) have drawn lots of attention. However, joint-measurement (JM) attack poses a noticeable threat to the database security in such protocols. That is, by JM attack a malicious user can illegally elicit many more items from the database than the average amount an honest one can obtain. Taking Jacobi et al.'s protocol as an example, by JM attack a malicious user can obtain as many as 500 bits, instead of the expected 2.44 bits, from a ${10}^{4}$-bit database in one query. It is a noticeable security flaw in theory, and would also arise in application with the development of quantum memories. To solve this problem, we propose a QPQ protocol based on a two-way QKD scheme, which behaves much better in resisting JM attack. Concretely, the user Alice cannot get more database items by conducting JM attack on the qubits because she has to send them back to Bob (the database holder) before knowing which of them should be jointly measured. Furthermore, JM attack by both Alice and Bob would be detected with certain probability, which is quite different from previous protocols. Moreover, our protocol retains the good characters of QKD-based QPQs, e.g., it is loss tolerant and robust against quantum memory attack.

Physical Review A•Apr 12, 2016•140 citations

Quantum private query protocol based on counterfactual quantum key distribution with noiseless attack

Dongmei Liu, Jian Li, Xiu‐Bo Chen +2 more

Abstract To save quantum resources and improve efficiency, this article proposes an efficient counterfactual quantum privacy query protocol. Counterfactual quantum privacy query refers to the identification of secure detection and key screening based on the detector's response results without the actual transmission of quantum information between user Bob and database Alice. Alice completes key transmission through a counterfactual device, while Bob measures the photon's polarization with a probability of 1/2 to obtain the encoded classical information, followed by traditional post-processing and privacy query operations. Additionally, to withstand the noise impact during the communication process, a modified counterfactual QKD protocol proposed by Rao (2021) is utilized, where communication parties randomly select a quantum bit flip with a specified probability \textit{f}, and then complete the quantum privacy query.

Quantum Information Processing•Oct 17, 2024•1 citation

Practical quantum private query based on Bell state

Tao Zheng, Shibin Zhang, Xiang Gao +1 more

Quantum private query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitivity, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a practical QKD-based QPQ protocol with better user privacy protection than cheat-sensitivity based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter (PNS) equipped with auxiliary monitoring detectors.

Modern Physics Letters A•Jun 14, 2019•15 citations

Decoy-state quantum-key-distribution-based quantum private query with error tolerance bound

Bin Liu, Zhonghao Liang, Wei Huang +3 more

Quantum private query (QPQ) faces many challenges in practical applications. At present, some scholars have made substantial work on overcoming channel loss, channel noise, and nonideal light sources, respectively. However, a protocol that would overcome all three of these problems has yet to materialize. We review a practical QPQ protocol that can actually work in noisy channels. This protocol has an upper bound on tolerable errors based on the required level of security and reliability. Then, we study the security of the above QPQ protocol under weak coherent pulses. The results indicate that the multiphoton pulses have induced significant vulnerabilities, which seriously threatens the privacy of users. Finally, we propose a decoy-state method to solve the serious threat to user security caused by multiphoton pulses. The analysis shows that the decoy-state method significantly improves the security of the QPQ protocol under weak coherent pulses. The improved protocol can not only tolerate transmission losses and channel noise, but also overcome the security vulnerability caused by a nonideal light source.

Physical Review A•May 30, 2024•10 citations
Almost all of the previous quantum private query (QPQ) protocols are always based on an ideal environment without any noise. Nevertheless, due to the defects of the channel, channel noise inevitably exists in the actual transmission process, which will give rise to transmission error and reduce the probability of successful quantum transmission. An eavesdropper may disguise her actions as channel noise to avoid being detected by legitimate parties during security checks. To solve this problem, we present a QPQ protocol with perfect performance universally applicable against collective noise. Concretely, the protocol encodes bits in noiseless subspace and thus can function over a quantum channel subjected to an arbitrary degree of collective noise, as occurs, for instance, due to polarization rotation in an optical fiber. Furthermore, Bob cannot get the information about Alice's choice at all by taking fake entangled attack and by taking fake photon attack, the probability Bob can get the information about Alice's choice is only approximately 6.7%, which is far less than the probability of 25% in Yang et al.'s protocol. Moreover, the conclusiveness of the user Alice's measurement results is subject to quantum randomness rather than allowing Alice to choose by herself to obtain a conclusive result in Wei et al.'s protocol, which prevents Alice's intuitive attack and meanwhile makes it arduous for Bob to perform the joint-measurement attack. Our protocol uses only one state, which reduces the communication complexity, and is, therefore, an effective QPQ solution with the high-security level.
Most existing quantum private query (QPQ) protocols can hardly work in the presence of noise. The user Alice may obtain a false database item in noisy environments and both participants may cheat under the disguise of noise, so dealing with the noise needs an overall consideration of error correction, user privacy and database security. However, the only two existing protocols aiming to correct errors in QPQ lack such an overall consideration (at least one party's privacy can be revealed), and they did not estimate what extent of errors can be tolerated (actually, noise is seldom discussed in quantum two-party secure computations, and to the best of our knowledge, relevant bounds on tolerable errors remain unattainable so far). To solve this problem, we first exemplify how one participant reveals the other party's privacy in the existing QPQ protocols aiming to correct errors. Then we propose a practical protocol which can really work via noisy channel, that is, the error rate of the retrieved database item is reduced significantly and both parties' privacy are well protected. Besides, we deduce that the final error rate, user privacy and database security are pairwise in a “trade-off” relationship. By balancing them according to the required level of security and reliability, we obtain an upper bound on tolerable errors.
Quantum Private Information Retrieval (QPIR) allows a user (Alice) to retrieve a database item from the database owned by the database holder (Bob) in such a way that Alice can query only the database item she wants, but cannot get other items, and Bob does not know which item Alice queries. However, the real quantum channel between Alice and Bob is noisy, and the noise may result in not only the chance that Alice obtains a false item, but also that both parties may cheat by camouflaging themselves with noise. In this paper, we use the decoherence-free subspace (DFS) for QPIR, which we call DFS-QPIR. The DFS-QPIR protocol removes the effect of the channel noise on the errors in the retrieved item so that two parties cannot cheat by replacing the noisy channel with a noiseless one. It can work over a collective noisy channel while retaining high reliability, database security and user privacy simultaneously. While only the collective unitary noise is taken into account, the proposed DFS-QPIR protocol can be straightforwardly extended to more general collective noise channel.
As a kind of practical protocol, quantum-key-distribution (QKD)-based quantum private queries (QPQs) have drawn lots of attention. However, joint-measurement (JM) attack poses a noticeable threat to the database security in such protocols. That is, by JM attack a malicious user can illegally elicit many more items from the database than the average amount an honest one can obtain. Taking Jacobi et al.'s protocol as an example, by JM attack a malicious user can obtain as many as 500 bits, instead of the expected 2.44 bits, from a 104{10}^{4}104-bit database in one query. It is a noticeable security flaw in theory, and would also arise in application with the development of quantum memories. To solve this problem, we propose a QPQ protocol based on a two-way QKD scheme, which behaves much better in resisting JM attack. Concretely, the user Alice cannot get more database items by conducting JM attack on the qubits because she has to send them back to Bob (the database holder) before knowing which of them should be jointly measured. Furthermore, JM attack by both Alice and Bob would be detected with certain probability, which is quite different from previous protocols. Moreover, our protocol retains the good characters of QKD-based QPQs, e.g., it is loss tolerant and robust against quantum memory attack.
Abstract To save quantum resources and improve efficiency, this article proposes an efficient counterfactual quantum privacy query protocol. Counterfactual quantum privacy query refers to the identification of secure detection and key screening based on the detector's response results without the actual transmission of quantum information between user Bob and database Alice. Alice completes key transmission through a counterfactual device, while Bob measures the photon's polarization with a probability of 1/2 to obtain the encoded classical information, followed by traditional post-processing and privacy query operations. Additionally, to withstand the noise impact during the communication process, a modified counterfactual QKD protocol proposed by Rao (2021) is utilized, where communication parties randomly select a quantum bit flip with a specified probability \textit{f}, and then complete the quantum privacy query.
Quantum private query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitivity, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a practical QKD-based QPQ protocol with better user privacy protection than cheat-sensitivity based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter (PNS) equipped with auxiliary monitoring detectors.
Quantum private query (QPQ) faces many challenges in practical applications. At present, some scholars have made substantial work on overcoming channel loss, channel noise, and nonideal light sources, respectively. However, a protocol that would overcome all three of these problems has yet to materialize. We review a practical QPQ protocol that can actually work in noisy channels. This protocol has an upper bound on tolerable errors based on the required level of security and reliability. Then, we study the security of the above QPQ protocol under weak coherent pulses. The results indicate that the multiphoton pulses have induced significant vulnerabilities, which seriously threatens the privacy of users. Finally, we propose a decoy-state method to solve the serious threat to user security caused by multiphoton pulses. The analysis shows that the decoy-state method significantly improves the security of the QPQ protocol under weak coherent pulses. The improved protocol can not only tolerate transmission losses and channel noise, but also overcome the security vulnerability caused by a nonideal light source.