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

Mathematics

Authenticated Multi-Party Quantum Private Set Intersection with Single Particles

Gongde Guo, Li Zheng, Kai Yu, Song Lin

Published Jun 18, 2025• 4 citations
Publisher

Abstract

As an important branch of secure multi-party computation, privacy set intersection enables multiple parties to input their private sets and jointly compute the intersection of these sets without revealing any information other than the intersection itself. With the increasing demand for privacy protection of user data, privacy set intersection has been widely used in privacy computing and other fields. In this paper, we utilize the properties of mutually unbiased bases to propose a multi-party quantum private set intersection protocol that incorporates identity authentication mechanisms. A semi-honest third party (TP) is introduced to facilitate the secure execution of this task among the multiple participating parties. The TP establishes a shared master key with each party, which serves as the basis for authenticating the identity of each participant throughout the protocol. Single-particle quantum states, prepared by the TP, act as the information carriers and are sequentially transmitted among the participating parties. Each party performs a local unitary operation on the circulating particle, thereby encoding their private data within the quantum state. At the end of the protocol, the TP announces his measurement result, by which all participants can concurrently ascertain the intersection of their private data sets. Notably, the proposed protocol eliminates the need for long-term storage of single-particle quantum states, thereby rendering it feasible with existing quantum technological capabilities. Furthermore, a comprehensive security analysis demonstrates that the protocol effectively resists some common external and internal attacks, thereby ensuring its theoretical security.

DOI
10.3390/math13122019

Related papers

A secure multi-quantum voting protocol based on GHZ state

Y. H. Zheng, Bai Liu

Private Set Intersection Cardinality (PSI - CA) is a cryptographic primitive through which two or more participants can obtain the intersection cardinality of their private sets and the privacy of the sets is protected. In this paper, we propose a tripartite protocol that utilizes quantum resources to accomplish these tasks, in which each two or more parties can obtain the intersection cardinality of their private sets with the help of semi-honest third parties (TP). Using this property, a voting protocol is designed. In our protocol, the GHZ state is used to encode private information that TP will use to compute the cardinality. We prove that the proposed protocol is secure against well-known quantum attacks. Furthermore, compared with existing quantum voting schemes, the protocol achieves higher efficiency.

International Conference on Generative Artificial Intelligence and Information Security (GAIIS)•May 10, 2024•0 citations

Quantum private set intersection based on single qubits

Cai Zhang, Zhuoxuan Zhan, Zhiwei Sun

Abstract Private Set Intersection (PSI) is a crucial Secure Multi-Party Computation (SMPC) primitive which enables participants to securely obtain the intersection of their private sets without revealing their individual set information. The advent of quantum computing threatens classical PSI protocols, driving the development of Quantum PSI (QPSI) alternatives. We propose a two-party QPSI protocol based on a semi-honest third party. This protocol achieves set intersection using only single-qubit unitary operations and single-qubit states. Security analysis shows that our protocol can resist common attacks. Validation experiments conducted on the IBM Qiskit simulator confirm the protocol's correctness and feasibility. Furthermore, we compare the proposed protocol with existing QPSI protocols in terms of quantum states, unitary operations, measurements, and fairness, demonstrating gains in quantum resource efficiency, fairness, and practical feasibility.

EPJ Quantum Technology•Oct 20, 2026•0 citations

Quantum Private Set Intersection Scheme Based on Bell States

Min Hou, Yue Wu, Shibin Zhang

In this paper, we introduce a quantum private set intersection (QPSI) scheme that leverages Bell states as quantum information carriers. Our approach involves encoding private sets into Bell states using unitary operations, enabling the computation of the intersection between two private sets from different users while keeping their individual sets undisclosed to anyone except for the intersection result. In our scheme, a semi-honest third party (TP) distributes the first and second qubits of the Bell states to the two users. Each user encodes their private sets by applying unitary operations on the received qubits according to predefined encoding rules. The modified sequence is encrypted and then sent back to TP, who can compute the set intersection without learning any information about the users’ private inputs. The simulation outcomes on the IBM quantum platform substantiate the viability of our scheme. We analyze the security and privacy aspects of the sets, showing that both external attacks and internal threats do not compromise the security of the private inputs. Furthermore, our scheme exhibits better practicality by utilizing easily implementable Bell states and unitary operations, rather than relying on multiple encoded states for set intersection calculations.

Axioms•Feb 7, 2025•7 citations

Semi-quantum private set intersection and union cardinality protocol based on single-particle states

Peiyi Zhu, Chong‐Qiang Ye, Yuan Tian

Abstract Quantum private set computation plays a crucial role in secure multi-party computation and privacy-preserving data mining. However, in quantum resource-constrained scenarios, most existing semi-quantum private set computation protocols rely on entangled states, making them difficult to scale effectively to multi-party settings. To address these limitations, this paper proposes a semi-quantum protocol for private set intersection and union cardinality computation. The proposed protocol uses single-particle states as information carriers and establishes the required keys by exploiting the correlations between prepared quantum states and selected measurement bases, thus avoiding the need for entangled states and pre-shared keys. By adopting a star topology, the protocol is further extended to general multiparty scenarios, with resource costs increasing linearly rather than exponentially. Security and performance analyses show that the proposed protocol can resist typical external and internal attacks. Compared with existing protocols, it reduces quantum resource requirements while achieving advantages in qubit efficiency and scalability.

Physica Scripta•Jul 10, 2026•0 citations

Multi-party quantum private size comparison protocol with d-dimensional Bell states

Bing Wang, Li-Hua Gong, Sanqiu Liu

A feasible multi-party quantum private comparison (MQPC) protocol based on d -dimensional Bell states was proposed. In the protocol, all participants can independently encrypt their privacies and send them to a semi-honest quantum third party (TP) through authenticated channels. Then, the TP can determine the size relationship among all participants’ privacies without gaining access to the private information. We verified correctness and effectiveness of the proposed protocol with some examples. In addition, compared with other similar protocols, it is not necessary to perform unitary operation on particles and only single-particle measurement is required. Furthermore, the relatively high qubit efficiency is promised. The security analysis verifies that the proposed protocol can counteract external and internal attacks in theory.

Frontiers in Physics•Aug 22, 2022•14 citations

Efficient quantum secure multi-party greatest common divisor protocol and its applications in private set operations

Zixian Li, Wenjie Liu, Bing-Mei Su

Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv: 2303.17196v3 , 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran’s. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc.

EPJ Quantum Technology•Sep 9, 2024•6 citations
As an important branch of secure multi-party computation, privacy set intersection enables multiple parties to input their private sets and jointly compute the intersection of these sets without revealing any information other than the intersection itself. With the increasing demand for privacy protection of user data, privacy set intersection has been widely used in privacy computing and other fields. In this paper, we utilize the properties of mutually unbiased bases to propose a multi-party quantum private set intersection protocol that incorporates identity authentication mechanisms. A semi-honest third party (TP) is introduced to facilitate the secure execution of this task among the multiple participating parties. The TP establishes a shared master key with each party, which serves as the basis for authenticating the identity of each participant throughout the protocol. Single-particle quantum states, prepared by the TP, act as the information carriers and are sequentially transmitted among the participating parties. Each party performs a local unitary operation on the circulating particle, thereby encoding their private data within the quantum state. At the end of the protocol, the TP announces his measurement result, by which all participants can concurrently ascertain the intersection of their private data sets. Notably, the proposed protocol eliminates the need for long-term storage of single-particle quantum states, thereby rendering it feasible with existing quantum technological capabilities. Furthermore, a comprehensive security analysis demonstrates that the protocol effectively resists some common external and internal attacks, thereby ensuring its theoretical security.
Private Set Intersection Cardinality (PSI - CA) is a cryptographic primitive through which two or more participants can obtain the intersection cardinality of their private sets and the privacy of the sets is protected. In this paper, we propose a tripartite protocol that utilizes quantum resources to accomplish these tasks, in which each two or more parties can obtain the intersection cardinality of their private sets with the help of semi-honest third parties (TP). Using this property, a voting protocol is designed. In our protocol, the GHZ state is used to encode private information that TP will use to compute the cardinality. We prove that the proposed protocol is secure against well-known quantum attacks. Furthermore, compared with existing quantum voting schemes, the protocol achieves higher efficiency.
Abstract Private Set Intersection (PSI) is a crucial Secure Multi-Party Computation (SMPC) primitive which enables participants to securely obtain the intersection of their private sets without revealing their individual set information. The advent of quantum computing threatens classical PSI protocols, driving the development of Quantum PSI (QPSI) alternatives. We propose a two-party QPSI protocol based on a semi-honest third party. This protocol achieves set intersection using only single-qubit unitary operations and single-qubit states. Security analysis shows that our protocol can resist common attacks. Validation experiments conducted on the IBM Qiskit simulator confirm the protocol's correctness and feasibility. Furthermore, we compare the proposed protocol with existing QPSI protocols in terms of quantum states, unitary operations, measurements, and fairness, demonstrating gains in quantum resource efficiency, fairness, and practical feasibility.
In this paper, we introduce a quantum private set intersection (QPSI) scheme that leverages Bell states as quantum information carriers. Our approach involves encoding private sets into Bell states using unitary operations, enabling the computation of the intersection between two private sets from different users while keeping their individual sets undisclosed to anyone except for the intersection result. In our scheme, a semi-honest third party (TP) distributes the first and second qubits of the Bell states to the two users. Each user encodes their private sets by applying unitary operations on the received qubits according to predefined encoding rules. The modified sequence is encrypted and then sent back to TP, who can compute the set intersection without learning any information about the users’ private inputs. The simulation outcomes on the IBM quantum platform substantiate the viability of our scheme. We analyze the security and privacy aspects of the sets, showing that both external attacks and internal threats do not compromise the security of the private inputs. Furthermore, our scheme exhibits better practicality by utilizing easily implementable Bell states and unitary operations, rather than relying on multiple encoded states for set intersection calculations.
Abstract Quantum private set computation plays a crucial role in secure multi-party computation and privacy-preserving data mining. However, in quantum resource-constrained scenarios, most existing semi-quantum private set computation protocols rely on entangled states, making them difficult to scale effectively to multi-party settings. To address these limitations, this paper proposes a semi-quantum protocol for private set intersection and union cardinality computation. The proposed protocol uses single-particle states as information carriers and establishes the required keys by exploiting the correlations between prepared quantum states and selected measurement bases, thus avoiding the need for entangled states and pre-shared keys. By adopting a star topology, the protocol is further extended to general multiparty scenarios, with resource costs increasing linearly rather than exponentially. Security and performance analyses show that the proposed protocol can resist typical external and internal attacks. Compared with existing protocols, it reduces quantum resource requirements while achieving advantages in qubit efficiency and scalability.
A feasible multi-party quantum private comparison (MQPC) protocol based on d -dimensional Bell states was proposed. In the protocol, all participants can independently encrypt their privacies and send them to a semi-honest quantum third party (TP) through authenticated channels. Then, the TP can determine the size relationship among all participants’ privacies without gaining access to the private information. We verified correctness and effectiveness of the proposed protocol with some examples. In addition, compared with other similar protocols, it is not necessary to perform unitary operation on particles and only single-particle measurement is required. Furthermore, the relatively high qubit efficiency is promised. The security analysis verifies that the proposed protocol can counteract external and internal attacks in theory.
Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv: 2303.17196v3 , 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran’s. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc.