Next Article in Journal
From Topological Optimization to Spline Layouts: An Approach for Industrial Real-Wise Parts
Previous Article in Journal
Roles Played by Critical Potentials in the Study of Poisson–Nernst–Planck Models with Steric Effects Under Relaxed Neutral Boundary Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quantum Private Comparison Protocol with Cluster States

1
School of Computer Science, Sichuan University Jinjiang College, Meishan 620860, China
2
Network and Data Security Key Laboratory of Sichuan Province, University of Electronic Science and Technology of China, Chengdu 610054, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(1), 70; https://doi.org/10.3390/axioms14010070
Submission received: 21 November 2024 / Revised: 26 December 2024 / Accepted: 17 January 2025 / Published: 19 January 2025
(This article belongs to the Section Mathematical Physics)

Abstract

:
In this paper, we introduce a quantum private comparison (QPC) protocol designed for two players to securely and privately assess the equality of their private information. The protocol utilizes four-particle cluster states prepared by a semi-honest third party (TP), who strictly adheres to the protocol without deviation or collusion with any participant. The TP facilitates the private comparison by enabling users to encode their information through bit-flip or phase-shift operators applied to the received quantum sequences. Once the information is encoded, the sequences are returned to the TP, who can derive the comparison results without accessing any details of the private information. This design ensures correctness, privacy, and fairness throughout the process. The QPC protocol is robust against both external threats and participant attacks due to the incorporation of the decoy-state method and quantum key distribution techniques. Additionally, the protocol employs unitary operations and Bell-basis measurements, enhancing its technical feasibility for practical implementation. Notably, the proposed protocol achieves a qubit efficiency of up to 50%. This efficiency, combined with its strong security features, establishes the QPC protocol as a promising solution for private information comparisons within the realm of quantum cryptography.

1. Introduction

The rise of the Internet has spurred the growth of cooperative computation applications, where participants collaborate to perform tasks based on their private inputs. A significant challenge in this context is conducting joint computations without compromising the privacy of those inputs, known as the secure multi-party computation (SMC) problem [1]. This area has become a crucial focus of research in modern cryptography. SMC has a wide array of applications, including privacy-preserving data mining, secure auctions, and bidding. Goldreich [2] notes that general results in SMC may not be universally applicable, leading to inefficiencies when directly implemented across diverse contexts. Consequently, specialized protocols tailored to the specific needs of particular applications are often developed to enhance both efficiency and practicality. Colbeck showed that unconditional security cannot be achieved in two-party classical computation for numerous classes of functions [3]. In contrast, quantum mechanics provides a framework that allows for the potential of achieving unconditional security. This paradigm shift opens new avenues for designing secure protocols that leverage the unique properties of quantum systems. The integration of quantum mechanics into secure computation has led to significant advancements that were previously unattainable within classical frameworks. These developments not only bolster security but also facilitate innovative applications in quantum information processing and cryptography. Notable examples include quantum key distribution [4,5,6], quantum key agreement [7,8,9], quantum secure direct communication [10,11,12,13], and quantum private set intersection [14,15,16].
Despite the advantages offered by quantum mechanics, the impossibility of unconditionally secure quantum multi-party computation protocols, as noted by Lo [17], underscores the challenges in achieving absolute security. However, by introducing specific assumptions or conditions, it is possible to enhance security in quantum multi-party computation scenarios. In 2009, Yang and Wen [18] were the first to utilize decoy particles and EPR (Einstein–Podolsky–Rosen) pairs to facilitate a secure private comparison known as the quantum private comparison (QPC) protocol. This protocol enables participants to assess the equality of their inputs while ensuring that any dishonest party cannot access sensitive information. Subsequently, Chen et al. [19] introduced an improved version of the QPC protocol, which leverages triplet entangled states and implements straightforward single-particle measurements, thereby increasing efficiency and practicality in secure comparisons. Since then, researchers have explored a variety of quantum states as resources for QPC protocols, including single photons [20,21,22,23,24,25], Bell states [26,27,28,29,30], multi-qubit entangled states [31,32,33,34,35,36], and d-level quantum states [37,38,39,40]. Additionally, various quantum technologies, such as entanglement swapping and unitary operations, have been integrated into these protocols to facilitate private comparisons.
In the context of cluster states as quantum resources, the QPC protocol proposed by Xu et al. [41] utilizes a four-qubit cluster state to provide a secure and efficient method for comparing private information. By capitalizing on the robustness and symmetry inherent in cluster states, this protocol effectively upholds participant privacy while producing reliable comparison results. Similarly, Sun and Long [42] introduce a novel QPC protocol that employs four-particle cluster states as information carriers, supported by a semi-honest third party (TP). This design allows all participants, including the TP, to perform only single-particle measurements, significantly simplifying technical implementation and enhancing the protocol’s accessibility for practical applications. Chang et al. [43] propose another innovative QPC protocol that utilizes a five-particle cluster state, also with the assistance of a semi-honest TP. This protocol enables the simultaneous comparison of private information from two groups, each consisting of two users, thereby enhancing scalability. Li et al. [44] present an efficient QPC protocol that incorporates entanglement swapping between four-qubit cluster states and extended Bell states. This approach allows for the comparison of three bits of secret inputs during each comparison, thus improving the protocol’s efficiency. Collectively, these advancements in QPC protocols illustrate the potential of cluster states to serve as effective resources for secure and efficient private information comparisons in quantum cryptography.
The four-particle cluster state demonstrates considerable robustness against decoherence. Once a four-qubit cluster state is generated, universal quantum computation can be performed using only measurements and simple local operations. Given these advantageous properties, the application of four-qubit cluster states in quantum private comparison (QPC) protocols is particularly significant. In this paper, we propose a QPC protocol that employs four-particle cluster states, involving a semi-honest third party (TP). The protocol consists of three parties: TP, Alice, and Bob. This framework enables Alice and Bob to securely determine the equality of their private information while ensuring the confidentiality of their inputs. Each participant encodes their information using bit-flip or phase-shift operators on the quantum sequences they receive. After encoding, these sequences are sent back to TP, which can ascertain the comparison results without gaining any insight into the private information. This design ensures correctness, privacy, and fairness throughout the process. It is resilient against both external threats and participant attacks, due to the integration of the decoy-state method and quantum key distribution techniques. Additionally, the protocol employs unitary operations and Bell-basis measurements, enhancing its technical feasibility for implementation. Importantly, our proposed QPC protocol achieves a qubit efficiency of up to 50%.
The remainder of this paper is structured as follows: In Section 2, we provide a detailed description of the QPC protocol. Section 3 presents an analysis of the proposed protocol. Following that, Section 4 offers a comparison. Finally, Section 5 concludes this paper with a summary of our findings.

2. The QPC Protocol

The QPC protocol involves three parties: a third party (TP), Alice, and Bob. A critical assumption is that the TP is semi-honest, meaning it follows the protocol correctly and does not deviate from its specified operations, but may attempt to extract additional information about the participants’ private inputs during the execution of the protocol. Furthermore, the TP cannot collude with either participant.
The protocol we present guarantees the following properties:
Privacy: No participant should gain any information beyond their designated output. Additionally, any external eavesdropping on private inputs will fail.
Correctness: Each participant obtains a correct output.
Fairness: No player can gain an advantage over the other during the comparison process.
A four-particle cluster state can be defined as follows:
C 4 = 1 2 0000 1234 + 0011 1234 + 1100 1234 + 1111 1234               = 1 2 00 23 00 14 + 01 23 01 14 + 10 23 10 14 + 11 23 11 14               = 1 2 φ + 23 φ + 14 + φ 23 φ 14 + ψ + 23 ψ + 14 + ψ 23 ψ 14
where four Bell states φ + , φ , ψ + and ψ + are defined as follows:
φ + = 1 2 0 0 + 1 1
φ = 1 2 0 0 1 1
ψ + = 1 2 0 1 + 1 0
ψ = 1 2 0 1 1 0
Meanwhile, the four-particle cluster state consists of maximally entangled states, meaning it exhibits a high degree of entanglement among its constituent qubits.
The bit-flip and phase-shift operations are defined as follows:
X = 0 1 1 0 ,   Z = 1 0 0 1
When applying the operations X a 1 Z a 2 and X b 1 Z b 2 (where a 1 , a 2 , b 1 , b 2 0,1 ) to qubits 2 and 3 of the four-particle cluster state, and then performing a Bell measurement on qubits 2 and 3, we can conclude that the measurement results of qubits 2 and 3 will be identical to those of qubits 1 and 4 if, and only if, a 1 a 2 = b 1 b 2 .
The detailed steps of the proposed QPC protocol can be outlined as follows:
Alice and Bob each possess a private integer: Alice has X and Bob has Y. The binary representations of these integers in F 2 L can be expressed as follows:
X = x L 1 , , x 1 , x 0
Y = y L 1 , , y 1 , y 0
where x i , y i 0,1 for i = 0,1 , , L 1 . The objective of this protocol is to determine whether X is equal to Y without revealing any additional information about X or Y.

2.1. Preparing Step

(1)
Alice and Bob split their binary representations of X and Y into L / 2 groups, respectively, with each group containing two-bit classical information. If L is odd (i.e., L mod 2 = 1 ), Alice and Bob will add a zero to the last group to ensure it contains two bits. After grouping, X and Y can be rewritten as X = x L / 2 1 , x L / 2 2 , , x 0 and Y = y L / 2 1 , y L / 2 2 , , y 0 , respectively. Where x j = ( x 2 j + 1 , x 2 j ) and y j = ( y 2 j + 1 , y 2 j ) for j = 0,1 , , L / 2 2 , L / 2 1 .
(2)
Alice and Bob share a secret key sequence K A B = k L 1 k L 2 k 0 = k L / 2 1 , k L / 2 2 , , k 0 via a QKD protocol, where each k j = k 2 j + 1 k 2 j 00,01,10,11   for j = 0,1 , , L / 2 2 , L / 2 1 .
(3)
TP prepares an ordered sequence of four-qubit cluster states, which can be represented as follows:
p 2 0 , p 3 0 , p 1 0 , p 4 0 , p 2 1 , p 3 1 , p 1 1 , p 4 1 , , p 2 L / 2 1 , p 3 L / 2 1 , p 1 L / 2 1 , p 4 L / 2 1
(4)
TP picks up particles 2 and 3 from each cluster state to form two ordered photon sequences: T A = p 2 0 , p 2 1 , , p 2 L / 2 1 and T B = p 3 0 , p 3 1 , , p 3 L / 2 1 . The remaining particles from each cluster state form another ordered sequence T T P = p 14 0 , p 14 1 , , p 14 L / 2 1 .
(5)
To enhance the security of the protocol and prevent eavesdropping, TP prepares two sets of decoy-photon sequences D A and D B randomly chosen from four nonorthogonal states 0 , 1 , + , , and inserts D A into T A and D B into T B at random positions, After the insertion, the new sequences are denoted as T A and T B , respectively. Then, TP sends T A and T B to Alice and Bob, respectively.

2.2. Checking Step

After Bob and Charlie confirm the receipt of their respective photon sequences T A and T B , TP, along with Bob and Charlie, conducts a series of checks to detect any potential eavesdropping during the transmission. The procedures are as follows:
(1)
The TP publicly announces the positions and the measuring bases (Z-basis and X-basis) of the decoy-photon sequences D A and D B .
(2)
Alice and Bob measure the states of the decoy-photon sequence D A and D B according to the bases published by the TP, and announce their measurement outcomes to the TP.
(3)
The TP calculates the error rate based on the announced outcomes. Specifically, it compares the results obtained by Bob and Charlie with the prepared decoy-photon sequence D A and D B . If the error rate exceeds a predetermined threshold, this indicates a potential eavesdropping attempt or other transmission issues. In such a case, the TP will abort the protocol and return to the preparation step. Otherwise, the protocol can proceed to the next steps.

2.3. Coding Step

(1)
Alice (Bob) discards all decoy photons D A ( D B ) from T A   ( T B ) to recover T A ( T B ).
(2)
Alice (Bob) performs X a 2 j + 1 Z a 2 j ( X b 2 j + 1 Z b 2 j ) on T A ( T B ) to generate a new sequence S A ( S B ), where a 2 j + 1 = x 2 j + 1 k 2 j + 1 , a 2 j = x 2 j k 2 j , b 2 j + 1 = y 2 j + 1 k 2 j + 1 and b 2 j = y 2 j k 2 j for j = 0,1 , , L / 2 2 , L / 2 1 .
(3)
Alice (Bob) prepares a decoy-photon sequence D A   D B whose states are chosen from four nonorthogonal states 0 , 1 , + , and inserts D A   D B into S A ( S B ) to generate a new sequence denoted as S A   S B .
(4)
Alice (Bob) sends S A   S B to the TP.

2.4. Decoding Step

(1)
Upon receiving their sequences S A (from Alice) and S B (from Bob), the TP interacts with Alice and Bob to verify the presence of any eavesdroppers in the same manner as previously described. If the checks confirm that there is no eavesdropper (i.e., the error rates are acceptable), the TP discards all decoy photons D A from S A and D B from S B to recover S A and S B . Otherwise, they abort the protocol and return to the preparation step.
(2)
The TP performs Bell measurements on S A and S B to get a result sequence R A B and performs Bell measurements on T T P to get a result sequence R T .
(3)
The TP compares R A B and R T to obtain the comparison result. If R A B is completely consistent with R T , the TP can conclude that X = Y . Otherwise, X Y .
(4)
The TP informs the comparison result to both Alice and Bob.

3. Analysis

3.1. Correctness

In fact, we can know that qubits 2 and 3 can be considered a Bell state in one of four forms φ + , φ , ψ + and ψ + from Equation (1). When applying the operations X a 2 j + 1 Z a 2 j ( X b 2 j + 1 Z b 2 j ) to qubits 2 and 3 of the four-particle cluster state, followed by performing a Bell measurement on these qubits, we obtain the resulting states, which are summarized in Table 1.
From Table 1, we observe that the resulting states remain unchanged only when the same operations are performed on the first and second particles of the Bell states. From Equation (1), we note that, when performing Bell measurements on qubits (2, 3) and (1, 4), the measurement results are identical. Therefore, we can deduce that if, and only if, the same operations are applied to qubits 2 and 3 of the four-particle cluster state, the measurement results from performing Bell measurements on qubits (2, 3) and (1, 4) will be identical. The same operation is equivalent to encoding using the same secret, allowing us to further determine whether the secret is indeed identical.

3.2. Privacy

In our protocol, an external eavesdropper, Eve, may perform quantum attacks such as intercept–resend, entangle–measure, and Trojan horse attacks to gain information about the private inputs of the participants. Since our protocol is designed within a semi-honest model, all participants, including the TP, adhere strictly to the protocol’s rules. They perform their roles correctly without deviating from the prescribed operations. Despite their compliance, participants may still seek to infer additional information about others’ secret inputs. This could involve analyzing the results of their own computations and any public announcements made during the protocol. We will consider the following attacks: (1) an external adversary attempting to intercept communication between the participants to gain access to their private inputs, X or Y; (2) one participant (either Alice or Bob) behaving dishonestly with the intent to learn the other participant’s private input; and (3) the TP attempting to deduce the private inputs, X or Y.
Case I An external adversary attempts to intercept communication between the participants to gain access to their private inputs, X or Y.
If Eve, the external adversary, attempts to intercept the particles sent from the TP to either Alice or Bob and replace them with fake particles, she will inadvertently introduce an increased error rate in the communication. This is due to her lack of knowledge regarding the precise positions and original states of the decoy photons. If m decoy photons used for eavesdropping detection, the probability of detecting Eve can be calculated as follows [45]:
P = 1 3 4 m
Here, 3 4 m represents the probability that Eve successfully avoids detection by randomly guessing the states of the decoy photons. As m (the number of decoy photons) increases, the probability of detecting Eve increases. Given this framework, if Eve attempts to eavesdrop by intercepting and replacing particles, the protocol is designed to reveal her presence through increased error rates. Therefore, this attack is unlikely to succeed, as the participants can effectively detect her interference through the eavesdropping detection mechanism built into the protocol.
If Eve intercepts the qubits transmitted in the TP–Alice or TP–Bob quantum channel, entangles intercepted qubits with ancillary particles prepared, and performs measurements on the ancillary particles to gain access to the participant’s secret data, she will fail. Eve’s unitary operation U acts on both states 0 , 1 and her ancillary particles can be expressed as follows:
U a 0 = δ 00 a 00 0 + δ 01 a 01 1
U a 1 = δ 10 a 10 0 + δ 11 a 11 1
where a is the ancillary particle, a 00 , a 01 , a 10 , a n d a 11 are four pure states determined by unitary operation U, and the parameters δ 00 , δ 01 , δ 10 , a n d   δ 11 satisfy δ 00 2 + δ 01 2 = 1 , δ 10 2 + δ 11 2 = 1 . When Eve’s unitary operation U acts on both states + , and her ancillary particles, we can obtain the following:
U + a = 1 2 δ 00 a 00 0 + δ 01 a 01 1 + δ 10 a 10 0 + δ 11 a 11 1                             = 1 2 + δ 00 a 00 + δ 01 a 01 + δ 10 a 10 + δ 11 a 11                             + 1 2 δ 00 a 00 δ 01 a 01 + δ 10 a 10 δ 11 a 11
U a = 1 2 δ 00 a 00 0 + δ 01 a 01 1 δ 10 a 10 0 δ 11 a 11 1                             = 1 2 + δ 00 a 00 + δ 01 a 01 δ 10 a 10 δ 11 a 11                             + 1 2 δ 00 a 00 δ 01 a 01 δ 10 a 10 + δ 11 a 11
If Eve aims to conduct her eavesdropping without introducing any detectable errors during the eavesdropping check, her unitary operation U must satisfy δ 01 = δ 10 = 0 and δ 00 a 00 = δ 11 a 11 . If Eve’s unitary operation U acts on Alice’s qubits of C 4 and her ancillary particles, we can obtain the following:
U C 4 A a = 1 2 δ 00 a 00 0 2 + δ 01 a 01 1 2 0 3 00 14 + δ 00 a 00 0 2 + δ 01 a 01 1 2 1 3 01 14 + δ 10 a 10 0 2 + δ 11 a 11 1 2 0 3 10 14 + δ 10 a 10 0 2 + δ 11 a 11 1 2 1 3 11 14                             = 1 2 δ 00 a 00 00 23 00 14 + δ 00 a 00 01 23 01 14 + δ 00 a 00 10 23 10 14 + δ 00 a 00 11 3 11 14                             = δ 00 a 00 00 23 00 14
Similarly, if Eve’s unitary operation U acts on Bob’s qubits of C 4 and her ancillary particles, we can obtain the following:
U C 4 B a = 1 2 0 2 δ 00 a 00 0 3 + δ 01 a 01 1 3 00 14 + 0 2 δ 10 a 10 0 3 + δ 11 a 11 1 3 01 14 + 1 2 δ 00 a 00 0 3 + δ 01 a 01 1 3 10 14 + 1 2 δ 10 a 10 0 3 + δ 11 a 11 1 3 1 3 11 14                             = 1 2 δ 00 a 00 00 23 00 14 + δ 00 a 00 01 23 01 14 + δ 00 a 00 10 23 10 14 + δ 00 a 00 11 3 11 14                             = δ 00 a 00 00 23 00 14
If the intercepted particles and the ancillary particles are entangled instead of being in a product state, the interaction could introduce no error. However, from Equations (15) and (16), we observe that the intercepted particles and the ancillary particles are in a product state form. This indicates that Eve’s strategy is ineffective.
Case II One participant (either Alice or Bob) behaves dishonestly with the intent to learn the other participant’s private input.
In this quantum protocol, both Alice and Bob are positioned as legitimate participants. However, each participant may behave dishonestly with the intent to learn the other participant’s private input. The protocol treats Alice and Bob as having equivalent roles; we assume that Bob may try to uncover Alice’s secrets encoded in the quantum sequence T A through quantum operations such as bit flip and phase shift operations. For Bob to access Alice’s secrets, he would need both the transformed quantum sequence T A and S A . However, since Alice and Bob do not communicate directly, Bob’s only option to obtain T A is by intercepting the quantum communication between the TP and Alice. If Bob intercepts and modifies the quantum signals, deviations from the expected outcomes will occur, and this interception behavior will be undoubtedly detected, resulting in the failure of Bob’s eavesdropping attempt. Similarly, if Alice attempts to infer information regarding Bob’s private inputs, an analysis can be carried out in the same manner. Therefore, the secrets of both participants are safeguarded, even in the presence of potential attacks from either side.
Case III The TP attempts to deduce the private inputs, X or Y.
The TP follows the protocol correctly and does not deviate from its specified operations but may attempt to glean additional information about the participants’ private inputs during the execution of the protocol. Its primary tasks include preparing the four-particle cluster states and performing Bell-basis measurements. Although the TP knows the initial prepared four-particle cluster states and the measurement results R A B and R T , she still cannot derive the users’ secrets due to different combinations of bit flip and phase shift operations can yield the same result. The TP may prepare single photons instead of four-particle cluster states, measure the received single photons, and analyze the measurement results to infer some operations performed by Alice and Bob. However, the TP cannot derive the users’ secrets without access to the private key K A B , which is vital for encrypting the participants’ private messages X and Y . Therefore, the actual secret inputs of Alice and Bob remain confidential for the TP.

3.3. Fairness

Fairness is effectively ensured through the involvement of the TP. Once the TP publishes the comparison result, Alice and Bob can receive this information simultaneously, ensuring that each party has equal access to the result, preventing any participant from gaining an undue advantage.

4. Comparison

The qubit efficiency [46,47,48,49] is crucial for evaluating the performance of quantum protocols, which can be defined as follows:
η e = q c q t
where q c denotes the number of classical bits that can be compared and q t represents the total number of photons used. In the proposed protocol, L four-qubit cluster states serve as quantum information carriers that can be utilized to compare 2L classical bits of information. Therefore, the qubit efficiency of the proposed protocol is η e = 2 L 4 L = 50 % . The comparison results between our protocol and those based on cluster states in Refs. [41,42,43,44] are summarized in Table 2.
Ref. [41] requires L + k four-qubit cluster states as quantum resources to compare 2L classical-bit information, where k four-qubit cluster states are used to verify whether Bob shares the cluster state with Alice. Thus, the qubit efficiency is η e = 2 L 4 ( L + k ) < 50 % . Additionally, the users will measure their qubits using the bases 00 , 01 , 10 , 11 , single particle, and the Bell basis and 0 , 1 . Alice and the TP, Bob and the TP, and Alice and Bob will share a secret key. These processes increase the consumption of quantum resources, quantum measurements, and additional particles in key distribution.
Ref. [42] utilized L four-qubit cluster states as quantum resources to compare L classical-bit information, resulting in a qubit efficiency of η e = L 4 L = 25 % . This efficiency is relatively lower than many QPC protocols.
Ref. [43] utilized L + k five-qubit cluster states as quantum resources to compare 2L classical-bit information, where k five-qubit cluster states are used for resisting the TP’s malicious behavior by executing the second eavesdropping check. Thus, the qubit efficiency is η e = 2 L 5 ( L + k ) < 40 % .
Ref. [44] utilized the L extended Bell state and four-qubit cluster states as quantum resources to compare 3L classical-bit information, achieving a qubit efficiency of η e = 3 L 6 L = 50 % . Quantum measurements need to be performed by users and the TP. Alice and Bob, Alice and the TP, and Bob and the TP all need to negotiate a key with each other, which increases consumption. Importantly, the entanglement swapping of extended Bell states and four-qubit cluster states is more challenging to implement compared to unitary operations.
Our protocol also has a qubit efficiency of 50%, and the users perform Z and X operations; only Alice and Bob need to share a secret key. This further reduces additional resource consumption.

5. Conclusions

In this paper, we propose a quantum private comparison (QPC) protocol that utilizes four-particle cluster states as quantum resources. In this framework, a semi-honest third party (TP) facilitates the comparison of private information between two participants without revealing any private data. Each user encodes their information using bit-flip or phase-shift operators applied to the received quantum sequences. These modified sequences are then returned to the TP, who can derive and announce the comparison results while maintaining the confidentiality of the users’ information. Our protocol ensures correctness, privacy, and fairness throughout the entire process. It is specifically designed to withstand both external threats and attacks from participants, owing to the integration of the decoy-state method and quantum key distribution (QKD) techniques. Additionally, the use of unitary operations and Bell-basis measurements enhances the technical feasibility of the protocol, making it suitable for real-world applications. A comparative analysis demonstrates that our scheme outperforms the existing QPC protocols based on the four-qubit cluster state in terms of efficiency. In the future, we will focus on developing methods to compare numerical sizes rather than simply determining equality, and we will design semi-quantum private comparison protocols to reduce users’ demand for quantum capabilities.

Author Contributions

Conceptualization, M.H.; methodology, M.H.; writing—original draft, M.H.; writing—review and editing, Y.W.; supervision, M.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Open Fund of Network and Data Security Key Laboratory of Sichuan Province (Grant No. NDS2024-1) and Gongga Plan for the “Double World-class Project”.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Yao, A.C. Protocols for secure computations. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS’ 82), Washington, DC, USA, 3–5 November 1982; p. 160. [Google Scholar]
  2. Goldreich, O. Foundations of Cryptography, Volume 2; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  3. Colbeck, R. Impossibility of secure two-party classical computation. Phys. Rev. A—At. Mol. Opt. Phys. 2007, 76, 062308. [Google Scholar] [CrossRef]
  4. Mehic, M.; Niemiec, M.; Rass, S.; Ma, J.; Peev, M.; Aguado, A.; Martin, V.; Schauer, S.; Poppe, A.; Pacher, C.; et al. Quantum key distribution: A networking perspective. ACM Comput. Surv. (CSUR) 2020, 53, 1–41. [Google Scholar] [CrossRef]
  5. Liao, S.K.; Cai, W.Q.; Liu, W.Y.; Zhang, L.; Li, Y.; Ren, J.G.; Yin, J.; Shen, Q.; Cao, Y.; Li, Z.P.; et al. Satellite-to-ground quantum key distribution. Nature 2017, 549, 43–47. [Google Scholar] [CrossRef] [PubMed]
  6. Xu, F.; Ma, X.; Zhang, Q.; Lo, H.-K.; Pan, J.-W. Secure quantum key distribution with realistic devices. Rev. Mod. Phys. 2020, 92, 025002. [Google Scholar] [CrossRef]
  7. Lin, S.; Zhang, X.; Guo, G.D.; Wang, L.L.; Liu, X.F. Multiparty quantum key agreement. Phys. Rev. A 2021, 104, 042421. [Google Scholar] [CrossRef]
  8. Cao, H.; Ma, W. Multiparty quantum key agreement based on quantum search algorithm. Sci. Rep. 2017, 7, 45046. [Google Scholar] [CrossRef]
  9. Huang, X.; Zhang, S.B.; Chang, Y.; Qiu, C.; Liu, D.M.; Hou, M. Quantum key agreement protocol based on quantum search algorithm. Int. J. Theor. Phys. 2021, 60, 838–847. [Google Scholar] [CrossRef]
  10. Sheng, Y.B.; Zhou, L.; Long, G.L. One-step quantum secure direct communication. Sci. Bull. 2022, 67, 367–374. [Google Scholar] [CrossRef]
  11. Qi, R.; Sun, Z.; Lin, Z.; Niu, P.; Hao, W.; Song, L.; Huang, Q.; Gao, J.; Yin, L.; Long, G.L. Implementation and security analysis of practical quantum secure direct communication. Light Sci. Appl. 2019, 8, 22. [Google Scholar] [CrossRef]
  12. Zhu, F.; Zhang, W.; Sheng, Y.; Huang, Y. Experimental long-distance quantum secure direct communication. Sci. Bull. 2017, 62, 1519–1524. [Google Scholar] [CrossRef]
  13. Huang, X.; Zhang, S.; Chang, Y.; Yang, F.; Hou, M.; Cheng, W. Quantum secure direct communication based on quantum homomorphic encryption. Mod. Phys. Lett. A 2021, 36, 2150263. [Google Scholar] [CrossRef]
  14. Debnath, S.K.; Dey, K.; Kundu, N.; Choudhury, T. Feasible private set intersection in quantum domain. Quantum Inf. Process. 2021, 20, 41. [Google Scholar] [CrossRef]
  15. Huang, X.; Zhang, W.; Zhang, S. Quantum multi-party private set intersection using single photons. Phys. A Stat. Mech. Its Appl. 2024, 649, 129974. [Google Scholar] [CrossRef]
  16. Liu, W.; Yin, H.W. A novel quantum protocol for private set intersection. Int. J. Theor. Phys. 2021, 60, 2074–2083. [Google Scholar] [CrossRef]
  17. Lo, H.K. Insecurity of quantum secure computations. Phys. Rev. A 1997, 56, 1154–1162. [Google Scholar] [CrossRef]
  18. Yang, Y.G.; Wen, Q.Y. An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement. J. Phys. A Math. Theor. 2009, 42, 055305. [Google Scholar] [CrossRef]
  19. Chen, X.B.; Xu, G.; Niu, X.X.; Wen, Q.Y.; Yang, Y.X. An efficient protocol for the private comparison of equal information based on the triplet entangled state and single-particle measurement. Opt. Commun. 2010, 283, 1561–1565. [Google Scholar] [CrossRef]
  20. Liu, B.; Gao, F.; Jia, H.; Huang, W.; Zhang, W.W.; Wen, Q.Y. Efficient quantum private comparison employing single photons and collective detection. Quantum Inf. Process. 2013, 12, 887–897. [Google Scholar] [CrossRef]
  21. Liu, B.; Xiao, D.; Huang, W.; Jia, H.Y.; Song, T.T. Quantum private comparison employing single-photon interference. Quantum Inf. Process. 2017, 16, 1–13. [Google Scholar] [CrossRef]
  22. Huang, X.; Zhang, W.F.; Zhang, S.B. Efficient multiparty quantum private comparison protocol based on single photons and rotation encryption. Quantum Inf. Process. 2023, 22, 272. [Google Scholar] [CrossRef]
  23. Kou, T.Y.; Che, B.C.; Dou, Z.; Chen, X.B.; Lai, Y.P.; Li, J. Efficient quantum private comparison protocol utilizing single photons and rotational encryption. Chin. Phys. B 2022, 31, 060307. [Google Scholar] [CrossRef]
  24. Hou, M.; Wu, Y. Single-photon-based quantum secure protocol for the socialist millionaires’ problem. Front. Phys. 2024, 12, 1364140. [Google Scholar] [CrossRef]
  25. Pan, H.M. Two-party quantum private comparison using single photons. Int. J. Theor. Phys. 2018, 57, 3389–3395. [Google Scholar] [CrossRef]
  26. Tseng, H.Y.; Lin, J.; Hwang, T. New quantum private comparison protocol using EPR pairs. Quantum Inf. Process. 2012, 11, 373–384. [Google Scholar] [CrossRef]
  27. Lang, Y.F. Quantum gate-based quantum private comparison. Int. J. Theor. Phys. 2020, 59, 833–840. [Google Scholar] [CrossRef]
  28. Hou, M.; Sun, S.Y.; Zhang, W. Quantum private comparison for the socialist millionaire problem. Front. Phys. 2024, 12, 1408446. [Google Scholar] [CrossRef]
  29. Huang, X.; Zhang, S.B.; Chang, Y.; Hou, M.; Cheng, W. Efficient quantum private comparison based on entanglement swapping of bell states. Int. J. Theor. Phys. 2021, 60, 3783–3796. [Google Scholar] [CrossRef]
  30. Hou, M.; Wu, Y. New Quantum Private Comparison Using Bell States. Entropy 2024, 26, 682. [Google Scholar] [CrossRef]
  31. Ji, Z.; Zhang, H.; Wang, H. Quantum private comparison protocols with a number of multi-particle entangled states. IEEE Access 2019, 7, 44613–44621. [Google Scholar] [CrossRef]
  32. Hou, M.; Wu, Y.; Zhang, S. Efficient Quantum Private Comparison Based on GHZ States. Entropy 2024, 26, 413. [Google Scholar] [CrossRef]
  33. Wang, Q.L.; Sun, H.X.; Huang, W. Multi-party quantum private comparison protocol with n-level entangled states. Quantum Inf. Process. 2014, 13, 2375–2389. [Google Scholar] [CrossRef]
  34. Fan, P.; Rahman, A.U.; Ji, Z.; Ji, X.; Hao, Z.; Zhang, H. Two-party quantum private comparison based on eight-qubit entangled state. Mod. Phys. Lett. A 2022, 37, 2250026. [Google Scholar] [CrossRef]
  35. Ji, Z.X.; Zhang, H.G.; Fan, P.R. Two-party quantum private comparison protocol with maximally entangled seven-qubit state. Mod. Phys. Lett. A 2019, 34, 1950229. [Google Scholar] [CrossRef]
  36. Sun, Q. Quantum private comparison with six-particle maximally entangled states. Mod. Phys. Lett. A 2022, 37, 2250149. [Google Scholar] [CrossRef]
  37. Ji, Z.-X.; Ye, T.-Y. Multi-party quantum private comparison based on the entanglement swapping of d-level cat states and d-level Bell states. Quantum Inf. Process. 2017, 16, 177. [Google Scholar]
  38. Lin, S.; Sun, Y.; Liu, X.F.; Yao, Z.Q. Quantum private comparison protocol with d-dimensional Bell states. Quantum Inf. Process. 2013, 12, 559–568. [Google Scholar] [CrossRef]
  39. Guo, F.Z.; Gao, F.; Qin, S.J.; Zhang, J.; Wen, Q.Y. Quantum private comparison protocol based on entanglement swapping of-level Bell states. Quantum Inf. Process. 2013, 12, 2793–2802. [Google Scholar] [CrossRef]
  40. Wu, W.Q.; Zhao, Y.X. Quantum private comparison of size using d-level Bell states with a semi-honest third party. Quantum Inf. Process. 2021, 20, 155. [Google Scholar] [CrossRef]
  41. Xu, G.A.; Chen, X.B.; Wei, Z.H.; Li, M.J.; Yang, Y.X. An efficient protocol for the quantum private comparison of equality with a four-qubit cluster state. Int. J. Quantum Inf. 2012, 10, 1250045. [Google Scholar] [CrossRef]
  42. Sun, Z.; Long, D. Quantum private comparison protocol based on cluster states. Int. J. Theor. Phys. 2013, 52, 212–218. [Google Scholar] [CrossRef]
  43. Chang, Y.; Zhang, W.B.; Zhang, S.B.; Wang, H.C.; Yan, L.L.; Han, G.H.; Sheng, Z.W.; Huang, Y.Y.; Suo, W.; Xiong, J.X. Quantum private comparison of equality based on five-particle cluster state. Commun. Theor. Phys. 2016, 66, 621. [Google Scholar] [CrossRef]
  44. Li, C.; Chen, X.; Li, H.; Yang, Y.; Li, J. Efficient quantum private comparison protocol based on the entanglement swapping between four-qubit cluster state and extended Bell state. Quantum Inf. Process. 2019, 18, 158. [Google Scholar] [CrossRef]
  45. Huang, X.; Zhang, W.; Zhang, S. Practical quantum protocols for blind millionaires’ problem based on rotation encryption and swap test. Phys. A Stat. Mech. Its Appl. 2024, 637, 129614. [Google Scholar] [CrossRef]
  46. Hou, M.; Wu, Y. Efficient Quantum Private Comparison with Unitary Operations. Mathematics 2024, 12, 3541. [Google Scholar] [CrossRef]
  47. Huang, X.; Zhang, S.B.; Cheng, W. Quantum Private Comparison Based on GHZ-type States. In Proceedings of the 2021 IEEE AFRICON, Arusha, United Republic of Tanzania, 13–15 September 2021; IEEE: Piscataway, NJ, USA, 2021; pp. 1–4. [Google Scholar]
  48. Huang, X.; Zhang, S.; Xia, J. Efficient Quantum Private Comparison Using Locally Indistinguishable Orthogonal Product States. In Proceedings of the 8th International Conference on Artificial Intelligence and Security, ICAIS 2022, Qinghai, China, 15–20 July 2022; Springer International Publishing: Cham, Switzerland, 2022; pp. 260–273. [Google Scholar]
  49. Hou, M.; Wu, Y.; Zhang, S. New Quantum Private Comparison Using Four-Particle Cluster State. Entropy 2024, 26, 512. [Google Scholar] [CrossRef]
Table 1. The resulting states.
Table 1. The resulting states.
Operations φ + φ ψ + ψ
X 0 Z 0 X 0 Z 0 φ + φ ψ + ψ
X 0 Z 0 X 0 Z 1 φ φ + ψ ψ +
X 0 Z 0 X 1 Z 0 ψ + ψ φ + φ
X 0 Z 0 X 1 Z 1 ψ ψ + φ φ +
X 0 Z 1 X 0 Z 0 φ φ + ψ ψ
X 0 Z 1 X 0 Z 1 φ + φ ψ + ψ +
X 0 Z 1 X 1 Z 0 ψ ψ + φ φ +
X 0 Z 1 X 1 Z 1 ψ + ψ φ + φ
X 1 Z 0 X 0 Z 0 ψ + ψ φ + φ
X 1 Z 0 X 0 Z 1 ψ ψ + φ φ +
X 1 Z 0 X 1 Z 0 φ + φ ψ + ψ
X 1 Z 0 X 1 Z 1 φ φ + ψ ψ +
X 1 Z 1 X 0 Z 0 ψ ψ + φ φ +
X 1 Z 1 X 0 Z 1 ψ + ψ φ + φ
X 1 Z 1 X 1 Z 0 φ φ + ψ ψ +
X 1 Z 1 X 1 Z 1 φ + φ ψ + ψ
Table 2. Comparison among similar QPC protocols.
Table 2. Comparison among similar QPC protocols.
Ref. [41]Ref. [42]Ref. [43]Ref. [44]Ours
Consumption of quantum resources(L + k) Four-qubit
cluster states for comparing 2L bits
L Four-particle cluster states for comparing L bits(L + k) Five-particle
cluster states for comparing 2L bits
L Four-qubit cluster states and L extended Bell states for comparing 3L bits L   Four-particle cluster state for comparing 2L bits
Whether needs
the entanglement swapping
NoNoNoYesNo
Unitary
operation for TP
NoNo I   and   i δ y NoNo
Unitary
operation for users
I and XFour Pauli operatorsNoNoZ and X
Quantum
Measurement for TP
NoZ basisZ basis and X basisBell basisBell-basis
Quantum
measurement for users
Single-particle, Bell basis and 00 , 01 , 10 , 11 basisZ basisZ basis and X basisBell-basis and extend Bell basisNo
QKD method between two usersYesNoNoYesYes
QKD method between users and TPYesNoNoYesNo
Qubit efficiency<50%25%<40%50%50%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Hou, M.; Wu, Y. Quantum Private Comparison Protocol with Cluster States. Axioms 2025, 14, 70. https://doi.org/10.3390/axioms14010070

AMA Style

Hou M, Wu Y. Quantum Private Comparison Protocol with Cluster States. Axioms. 2025; 14(1):70. https://doi.org/10.3390/axioms14010070

Chicago/Turabian Style

Hou, Min, and Yue Wu. 2025. "Quantum Private Comparison Protocol with Cluster States" Axioms 14, no. 1: 70. https://doi.org/10.3390/axioms14010070

APA Style

Hou, M., & Wu, Y. (2025). Quantum Private Comparison Protocol with Cluster States. Axioms, 14(1), 70. https://doi.org/10.3390/axioms14010070

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop