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

Scientific Reports

Three-party quantum private computation of cardinalities of set intersection and union based on GHZ states

Cai Zhang, Yinxiang Long, Zhiwei Sun, Qin Li, Qiong Huang

Published Dec 17, 2020• 20 citations
Publisher

Abstract

Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA) are two cryptographic primitives whereby two or more parties are able to obtain the cardinalities of the intersection and the union of their respective private sets, and the privacy of their sets is preserved. In this paper, we propose a three-party protocol to finish these tasks by using quantum resources, where every two, as well as three, parties can obtain the cardinalities of the intersection and the union of their private sets with the help of a semi-honest third party (TP). In our protocol, GHZ states play a role in encoding private information that will be used by TP to compute the cardinalities. We show that the presented protocol is secure against well-known quantum attacks. In addition, we analyze the influence of six typical kinds of Markovian noise on our protocol.

DOI
10.1038/s41598-020-77579-w

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

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

A New Protocol for Semi‐quantum Private Set of Intersection and Union Mixed Cardinality for Any Tripartite Based on Bell States

Yue‐Ping Chi, Yu Zhang, Kejia Zhang +2 more

Abstract The cardinality of the private set allows multiple parties to jointly compute the cardinality of the intersection and union without revealing their respective private sets. It plays an important role in data mining and data analysis to protect privacy. However, existing studies only focus on computing the cardinality of the intersection or union of private sets. To extend its application in various scenes, a private‐set intersection and union mixed cardinality protocol are proposed for any tripartite based on Bell states for the first time. During the protocol, participants are supposed to be semi‐quantum to reduce the consumption of quantum resources and improve the realizability of the protocol. Furthermore, correctness and security analysis show that the protocol can withstand internal and external attacks. Additionally, the IBM Quantum Simulator (IBMQS) is also applied to illustrate the fundamentals of the protocol and verify the availability of the protocol. The results are expected have positive effects on the further development of secure multiparty computation.

Advanced Quantum Technologies•Jun 21, 2024•8 citations

Quantum Secure Multi-party Private Set Intersection Cardinality

Bai Liu, Mingwu Zhang, Runhua Shi

Abstract As we know that data sharing, a critical element in social networks, has the benefits of exploring important information, while also has the disadvantage of information leakage. Therefore, without the reliable third party arbitration agency, it is impossible to share information privately by distrustful multi-party. In this paper, we proposed a protocol called Quantum Secure Multi-party Private Set Intersection Cardinality (QSMS-IC), which has the capability of resisting quantum attacks. QSMS-IC, the extension of two-parity private set intersection cardinality which was proposed in Information Sciences(2016,147-158), utilizes quantum transformation, quantum measurements and quantum parallelism to solve multi-party private set intersection cardinality problems. Compared with two-party PSI-CA protocols, our proposed protocol can solve the data sharing among multi-party without the reliable third party arbitration agency. It also can be used in numerous applications and more suitable to the actual cases. For instance, large-scale social networks and privacy-preserving data ming.

International Journal of Theoretical Physics•May 7, 2020•20 citations

A Feasible Quantum Protocol for Private Set Intersection Cardinality

Runhua Shi, Mingwu Zhang

Private Set Intersection Cardinality (PSI-CA) is to compute privately the cardinality of the intersection of two sets, and there are many practical applications of PSI-CA, e.g., data mining and data analysis with the privacy protection. The current classical protocols for PSI-CA could not resist the attacks of quantum computers. In this paper, we present a novel quantum protocol for PSI-CA based on the basic laws of quantum mechanics, which can resist well-known quantum attacks. This protocol utilizes single photons as quantum resources and only needs to apply simple single-photon operators and measurements. Therefore, it is more feasible to implement this protocol, compared with the related quantum protocols, which require entangled states and other complicated operators.

IEEE Access•Jan 1, 2019•19 citations

A multi-party quantum private set intersection based on greatest common divisor

Muhammad Imran

Private set intersection (PSI) is a cryptographic primitive that allows two or more parties to learn the intersection of their input sets and nothing else. In this paper, we introduce a new secure multi-party quantum computation for the greatest common divisor (GCD) and a PSI protocol based on it. The protocol extends the recent least common multiple (LCM)-based quantum private set union protocol by Liu et al. Performance analysis verifies the correctness and demonstrates the entire security of the suggested protocols in the semi-honest model. Additionally, it has been demonstrated that the complexity is efficient in terms of the input set size.

International Journal of Quantum Information•Dec 19, 2024•0 citations
Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA) are two cryptographic primitives whereby two or more parties are able to obtain the cardinalities of the intersection and the union of their respective private sets, and the privacy of their sets is preserved. In this paper, we propose a three-party protocol to finish these tasks by using quantum resources, where every two, as well as three, parties can obtain the cardinalities of the intersection and the union of their private sets with the help of a semi-honest third party (TP). In our protocol, GHZ states play a role in encoding private information that will be used by TP to compute the cardinalities. We show that the presented protocol is secure against well-known quantum attacks. In addition, we analyze the influence of six typical kinds of Markovian noise on our protocol.
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 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.
Abstract The cardinality of the private set allows multiple parties to jointly compute the cardinality of the intersection and union without revealing their respective private sets. It plays an important role in data mining and data analysis to protect privacy. However, existing studies only focus on computing the cardinality of the intersection or union of private sets. To extend its application in various scenes, a private‐set intersection and union mixed cardinality protocol are proposed for any tripartite based on Bell states for the first time. During the protocol, participants are supposed to be semi‐quantum to reduce the consumption of quantum resources and improve the realizability of the protocol. Furthermore, correctness and security analysis show that the protocol can withstand internal and external attacks. Additionally, the IBM Quantum Simulator (IBMQS) is also applied to illustrate the fundamentals of the protocol and verify the availability of the protocol. The results are expected have positive effects on the further development of secure multiparty computation.
Abstract As we know that data sharing, a critical element in social networks, has the benefits of exploring important information, while also has the disadvantage of information leakage. Therefore, without the reliable third party arbitration agency, it is impossible to share information privately by distrustful multi-party. In this paper, we proposed a protocol called Quantum Secure Multi-party Private Set Intersection Cardinality (QSMS-IC), which has the capability of resisting quantum attacks. QSMS-IC, the extension of two-parity private set intersection cardinality which was proposed in Information Sciences(2016,147-158), utilizes quantum transformation, quantum measurements and quantum parallelism to solve multi-party private set intersection cardinality problems. Compared with two-party PSI-CA protocols, our proposed protocol can solve the data sharing among multi-party without the reliable third party arbitration agency. It also can be used in numerous applications and more suitable to the actual cases. For instance, large-scale social networks and privacy-preserving data ming.
Private Set Intersection Cardinality (PSI-CA) is to compute privately the cardinality of the intersection of two sets, and there are many practical applications of PSI-CA, e.g., data mining and data analysis with the privacy protection. The current classical protocols for PSI-CA could not resist the attacks of quantum computers. In this paper, we present a novel quantum protocol for PSI-CA based on the basic laws of quantum mechanics, which can resist well-known quantum attacks. This protocol utilizes single photons as quantum resources and only needs to apply simple single-photon operators and measurements. Therefore, it is more feasible to implement this protocol, compared with the related quantum protocols, which require entangled states and other complicated operators.
Private set intersection (PSI) is a cryptographic primitive that allows two or more parties to learn the intersection of their input sets and nothing else. In this paper, we introduce a new secure multi-party quantum computation for the greatest common divisor (GCD) and a PSI protocol based on it. The protocol extends the recent least common multiple (LCM)-based quantum private set union protocol by Liu et al. Performance analysis verifies the correctness and demonstrates the entire security of the suggested protocols in the semi-honest model. Additionally, it has been demonstrated that the complexity is efficient in terms of the input set size.