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

Quantum Information Processing

Privacy-preserving point-inclusion protocol for an arbitrary area based on phase-encoded quantum private query

Runhua Shi, Yi Mu, Hong Zhong, Jie Cui, Shun Zhang

Published Dec 10, 2016• 12 citations
Publisher
DOI
10.1007/s11128-016-1476-8

Related papers

Quantum Privacy-preserving Two-party Circle Intersection Protocol Based on Phase-encoded Query

Zixian Li, Qi Yang, Feng Bao +1 more

arXiv:2309.17293•International Journal of Theoretical Physics•Jun 28, 2023•6 citations

Quantum Scheme for Privacy-Preserving Range MAX/MIN Query in Edge-Based Internet of Things

Runhua Shi, Xia-qin Fang

Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.

IEEE Transactions on Network and Service Management•Aug 13, 2024•9 citations

Quantum‐Secure Point‐Circle, Circle‐Circle Relation Determination Protocol With Application to Privacy‐Preserving Geometric Range Query

Yi Zhou, Yao‐Fei Wu, Xiang-Rui Li +2 more

ABSTRACT As an important branch of quantum‐secure multi‐party computation, quantum‐secure multi‐party computational geometry aims to solve geometric computation problems without revealing the parties' geometric inputs. Privacy‐preserving point‐circle and circle‐circle positional relationships are classic problems in secure multi‐party computational geometry, with broad applications in privacy‐preserving queries, collision detection, and clustering. Building on the quantum two‐party summation and multiplication protocols proposed by Sutradhar and Om, this paper presents the first quantum‐secure protocols for determining point‐circle and circle‐circle positional relationships, enabling accurate relationship determination without disclosing private geometric parameters. Security analysis and simulation experiments on the IBM Qiskit platform demonstrate the security and feasibility of the proposed protocols. Furthermore, since existing quantum privacy‐preserving range query protocols are limited to one‐dimensional linear spaces, we build on the proposed protocols to present the first quantum‐secure privacy‐preserving geometric range query protocol, which enables arbitrary geometric range search for private coordinates in the two‐dimensional space while protecting the privacy of the query range and data points.

Advanced Quantum Technologies•May 1, 2026•0 citations

A New Protocol for Quantum Private Query Against Joint-Measurement Attack

Ying Wang, Fen-Zhuo Guo, Li Liu +2 more

International Journal of Theoretical Physics•Mar 15, 2019•5 citations

Quantum private query with perfect user privacy against a joint-measurement attack

Yu‐Guang Yang, Zhichao Liu, Jian Li +4 more

Physics Letters A•Oct 17, 2016•53 citations

Quantum‐Key‐Distribution‐Based Quantum Private Query with Phase Encoding

Bin Liu, Xingyu Li, Bei Gong +2 more

ABSTRACT Quantum private query (QPQ) as the quantum version of the symmetrically private information retrieval problem, is recognized as a new quantum cryptographic protocol with great practical potential. Compared to classical schemes, QPQ protocols provide higher security and lower complexity. However, most of the existing protocols are polarization encoding ones, which are incompatible with current optical fiber communication quantum networks. Moreover, the high demands for quantum capabilities and the scarcity of affordable quantum resources present challenges. This paper proposes a QPQ protocol with phase encoding of two‐way communication, enhancing the stability and reducing quantum resources expenditure. The security analysis demonstrates that this protocol is capable of effectively resisting several common attacks, safeguarding the privacy security of the database and user. Furthermore, the protocol has the potential to be implemented in existing phase‐encoding quantum systems, promoting progress in the practical application of QPQ.

Advanced Quantum Technologies•Nov 11, 2025•3 citations
Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.
ABSTRACT As an important branch of quantum‐secure multi‐party computation, quantum‐secure multi‐party computational geometry aims to solve geometric computation problems without revealing the parties' geometric inputs. Privacy‐preserving point‐circle and circle‐circle positional relationships are classic problems in secure multi‐party computational geometry, with broad applications in privacy‐preserving queries, collision detection, and clustering. Building on the quantum two‐party summation and multiplication protocols proposed by Sutradhar and Om, this paper presents the first quantum‐secure protocols for determining point‐circle and circle‐circle positional relationships, enabling accurate relationship determination without disclosing private geometric parameters. Security analysis and simulation experiments on the IBM Qiskit platform demonstrate the security and feasibility of the proposed protocols. Furthermore, since existing quantum privacy‐preserving range query protocols are limited to one‐dimensional linear spaces, we build on the proposed protocols to present the first quantum‐secure privacy‐preserving geometric range query protocol, which enables arbitrary geometric range search for private coordinates in the two‐dimensional space while protecting the privacy of the query range and data points.
ABSTRACT Quantum private query (QPQ) as the quantum version of the symmetrically private information retrieval problem, is recognized as a new quantum cryptographic protocol with great practical potential. Compared to classical schemes, QPQ protocols provide higher security and lower complexity. However, most of the existing protocols are polarization encoding ones, which are incompatible with current optical fiber communication quantum networks. Moreover, the high demands for quantum capabilities and the scarcity of affordable quantum resources present challenges. This paper proposes a QPQ protocol with phase encoding of two‐way communication, enhancing the stability and reducing quantum resources expenditure. The security analysis demonstrates that this protocol is capable of effectively resisting several common attacks, safeguarding the privacy security of the database and user. Furthermore, the protocol has the potential to be implemented in existing phase‐encoding quantum systems, promoting progress in the practical application of QPQ.