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

Computers & Security

Reducing the communication complexity of quantum private database queries by subtle classical post-processing with relaxed quantum ability

Yu‐Guang Yang, Xue-Pei Guo, Gang Xu, Xiu‐Bo Chen, Jian Li, Yi‐Hua Zhou, Wei‐Min Shi

Published Oct 14, 2018• 23 citations
Publisher
DOI
10.1016/j.cose.2018.08.012

Related papers

Novel classical post-processing for quantum key distribution-based quantum private query

Yu‐Guang Yang, Zhichao Liu, Xiu‐Bo Chen +3 more

Quantum Information Processing•Jun 18, 2016•46 citations

Practical Quantum Database Private Query Protocol with Classical Database Owner

Lili Yan, Dongmei Liu, Shibin Zhang +2 more

International Journal of Theoretical Physics•Aug 5, 2020•2 citations

Security improvements of several basic quantum private query protocols with O(log N) communication complexity

Fang Yu, Daowen Qiu, Xiaoming Wang +3 more

arXiv:2005.13382•Theoretical Computer Science•Dec 18, 2019•7 citations

Private database queries using one quantum state

Yu‐Guang Yang, Ming-Ou Zhang, Rui Zhe Yang

Quantum Information Processing•Dec 22, 2014•58 citations

Quantum Private Queries

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.

arXiv:0708.2992•Physical Review Letters•Jun 10, 2008•217 citations

Pervasive Vulnerability Analysis and Defense for QKD-based Quantum Private Query

Xiaoyu Peng, Bin Liu, JiaHao Huang +4 more

Quantum Private Query (QPQ) based on Quantum Key Distribution (QKD) is among the most practically viable quantum communication protocols, with application value second only to QKD itself. However, prevalent security vulnerabilities in the post-processing stages of most existing QKD-based QPQ protocols have been severely overlooked. This study focuses on hidden information extraction under undetermined signal bits, revealing that most such QPQ protocols face severe security threats even without complex quantum resources. Specifically, direct observation attack causes incremental information leakage, while the minimum error discrimination attack efficiently steals additional database inforamtion. To address these critical flaws, the proposed multi-encryption defense scheme is compatible with existing QPQ protocols. The study demonstrates the necessity of the multi-encryption strategy for the security of databases in QPQ, providing key theoretical and technical support for constructing practical QPQ protocols resistant to real-world attacks.

quant-pharXiv:2601.01918•Jan 6, 2026•0 citations
We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.
Quantum Private Query (QPQ) based on Quantum Key Distribution (QKD) is among the most practically viable quantum communication protocols, with application value second only to QKD itself. However, prevalent security vulnerabilities in the post-processing stages of most existing QKD-based QPQ protocols have been severely overlooked. This study focuses on hidden information extraction under undetermined signal bits, revealing that most such QPQ protocols face severe security threats even without complex quantum resources. Specifically, direct observation attack causes incremental information leakage, while the minimum error discrimination attack efficiently steals additional database inforamtion. To address these critical flaws, the proposed multi-encryption defense scheme is compatible with existing QPQ protocols. The study demonstrates the necessity of the multi-encryption strategy for the security of databases in QPQ, providing key theoretical and technical support for constructing practical QPQ protocols resistant to real-world attacks.