Next Article in Journal
Evolution Dynamics Model of Private Enterprises under Simultaneous and Sequential Innovation Decisions
Next Article in Special Issue
Efficient Integration of Rate-Adaptive Reconciliation with Syndrome-Based Error Estimation and Subblock Confirmation for Quantum Key Distribution
Previous Article in Journal
FLPP: A Federated-Learning-Based Scheme for Privacy Protection in Mobile Edge Computing
Previous Article in Special Issue
Quantum Obfuscation of Generalized Quantum Power Functions with Coefficient
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Efficient Quantum Private Comparison without Sharing a Key

1
School of Information Engineering, Ningxia University, Yinchuan 750021, China
2
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China
3
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing 100876, China
*
Author to whom correspondence should be addressed.
Entropy 2023, 25(11), 1552; https://doi.org/10.3390/e25111552
Submission received: 13 October 2023 / Revised: 13 November 2023 / Accepted: 14 November 2023 / Published: 17 November 2023
(This article belongs to the Special Issue Quantum and Classical Physical Cryptography)

Abstract

:
Quantum private comparison (QPC) allows at least two users to compare the equality of their secret information, for which the security is based on the properties of quantum mechanics. To improve the use of quantum resources and the efficiency of private comparison, a new QPC protocol based on GHZ-like states is proposed. The protocol adopts unitary operations to encode the secret information instead of performing quantum key distribution (QKD), which can reduce the amount of computation required to perform QKD and improve the utilization of quantum resources. The decoy photon technique used to detect channel eavesdropping ensures that the protocol is resistant to external attacks. The quantum efficiency of the protocol reaches 66%. Compared with many previous QPC schemes, the proposed protocol does not need to share a key and has advantages in quantum efficiency and quantum resources.

1. Introduction

In the traditional field of information security, encryption technology has been the key to protecting sensitive information. However, with the rapid development of computing power, especially the development of quantum computing, securing traditional encryption methods has been substantially challenging. In this context, research on quantum cryptography, including quantum key distribution (QKD), quantum digital signature [1], quantum communication [2], and quantum private comparison (QPC), has become a research hotspot.
QKD technology primarily relies on the fundamental principles of quantum mechanics to ensure that users generate secure and dependable keys during the communication progress [3,4]. Moreover, the goal of quantum private comparison is to enable both parties to compare their secret data without revealing any information about the data to each other or any potential eavesdropper [5,6,7]. QPC has potential applications in a variety of fields, including secure online voting, financial transactions, and data sharing between government agencies. However, the majority of QPC protocols have a common feature that the protocols need to perform QKD [8] and then encrypt and compare secret information. Using QKD to avoid possible security risks can make the protocol simpler and easier at the physical implementation level; nevertheless, this type of QPC protocol has room for improvement in quantum efficiency and utilization of quantum resources [9].
For a QPC protocol, the privacy security issue is an unavoidable research focus. A qualified QPC protocol should meet the following two conditions: (1) the security of the private information and (2) the fairness of the comparison results. Both parties need to know the final result of the comparison and ensure that the result is the same as that of the actual calculation. Therefore, it is imperative to process or encrypt the secret information, guaranteeing that the parties involved in the comparison do not have direct access to each other’s secret data and eliminating the possibility of inferring secret information from measurement results. Furthermore, the involvement of a third party in the protocol can facilitate secure and equitable private comparison by assisting the two parties in comparing their secret data and publicly publishing the comparison result. However, the integrity and trustworthiness of the third party are crucial considerations. Ensuring the credibility of the third party and the smooth progress of the protocol necessitates the implementation of necessary measures to safeguard and regulate the behavior of the third party.
Based on the above analysis, we propose a new quantum privacy comparison protocol without a shared key. With the assistance of a semi-honest third party, this protocol ensures fairness in comparing users’ secret information without the necessity for key sharing or direct user-to-user communication. This results in heightened privacy protection capabilities. Furthermore, the protocol incorporates decoy photon technology and hash functions to defend against internal and external attacks, effectively securing the performance of this protocol. Notably, this protocol boasts a higher quantum efficiency compared to the majority of previous QPC protocols.
The structure of this paper is as follows: the related work and the knowledge preparation are introduced in Section 2. The steps and description of the protocol are presented in Section 3. An example of the correctness of the protocol is shown in Section 4. The security analysis is explained in detail in Section 5. The quantum efficiency is analyzed in Section 6. Finally, a summary of this work is provided.

2. Preliminaries

2.1. Related Work

The earliest QPC protocol was inspired by quantum secret sharing protocols, and the privacy comparison problem originating from Yao’s millionaires problem. In this problem, two millionaires sought to ascertain their relative wealth without revealing specific assets. The first QPC protocol was introduced by Yang and Wen in 2009 [10]. This protocol harnessed the entanglement exchange properties of EPR states and employed unitary operations to facilitate the comparison of private information. Additionally, the involvement of a third-party participant effectively ensured the security and fairness of the protocol. In current research, QPC protocols aim to compare the equality or the relative sizes of private information. The research predominantly focuses on using different quantum states and various encoding methods (whether to distribute keys) to implement comparison protocols.
In 2020, Lang [11] introduced a QPC protocol that leveraged quantum gates, simplifying the process by eliminating the classical computation in a QPC protocol. In the same year, Wu et al. [12] proposed a protocol that does not require the involvement of a third party, and Ji et al. [13] designed several QPC protocols with various quantum states, using dense coding instead of key distribution methods. In 2021, Huang et al. [14] introduced a semi-honest third party to assist in comparison. Lang [15] also proposed a QPC protocol using a single Bell state rather than multiple Bell states as the quantum resource. Chen et al. designed a QPC protocol that does not require the use of quantum entangled states as quantum resources [16]. In 2022, Fan et al. [17] utilized an eight-qubit entangled state for private data comparison through quantum key distribution and joint computation. In 2023, Liu [18] employed high-dimensional GHZ-like states as quantum resources, and Zhang et al. [19] introduced a QPC protocol based on homomorphic encryption, allowing multiple participants to engage in simultaneous comparisons.

2.2. Theoretical Basis of GHZ-like States

GHZ-like states are a class of quantum states that have certain similarities to GHZ states, such as multi-partite entanglement, where the entanglement between these qubits of GHZ-like states is multipartite rather than just bipartite. Moreover, the GHZ-like state is not limited to specific forms of GHZ states.
The three-particle GHZ-like states used in the proposed QPC protocol are transformed from ordinary GHZ states. An n-particle GHZ state is a kind of quantum entanglement, which can be described as
G H Z = 1 2 q 1 , q 2 , , q n + 1 Δ | q 1 , q 2 , , q n ¯
where q 1 = 0 , q 2 , q 3 , , q n 0 , 1 and Δ 0 , 1 .
According to Equation (1), an n-particle GHZ-like state [20] transformed from the GHZ state can be written as
G H Z = 1 2 n 1 k = 1 2 n 1 1 δ z 1 , z 2 , , z n n u m 1
where δ = j | z j = 1 q j m o d 2 , z j 0 , 1 , and n u m 1 = even ,   if   Δ = 0 odd ,   if   Δ = 1 . When the parameter num(1) is an even value, the number of 1 in each vector z 1 , z 2 , , z n is even. When the parameter num(1) is an odd value, the number of 1 in each vector z 1 , z 2 , , z n is odd.
According to Equation (1), an n-particle GHZ state can exit 2 n different states. It should be noted that the state is a Bell state when n takes the value of 2. The Bell state is the simplest quantum entangled state of a two-qubit system, consisting of four specific maximum entangled quantum states, which can be expressed as Equations (3) and (4). For a three-particle GHZ state, there are eight possible states and eight corresponding GHZ-like states. The one used in the proposed protocol is G H Z 1 , in which the Δ has a value of 0 and q 2 = q 3 = 0 . G H Z 1 is a GHZ state, which is shown as Equation (5).
Φ + = 1 2 00 + 11 , Φ = 1 2 00 11
Ψ + = 1 2 01 + 10 , | Ψ = 1 2 01 10
| G H Z 1 = 1 2 000 + 111
According to Equations (1) and (2), the GHZ-like state | G H Z 1 used in the proposed protocol can be described as
| G H Z 1 = 1 2 2 k = 1 2 2 1 δ z 1 , z 2 , , z n e v e n = 1 2 1 0 000 + 1 0 0 011 + 1 0 0 101 + 1 0 0 110 = 1 2 000 + 011 + 101 + 110
The | G H Z 1 also can be written as
| G H Z 1 = 1 2 0 00 + 11 + 1 01 + 10 = 1 2 0 Φ + + 1 Ψ +
According to Equation (7), when the state of the first particle of | G H Z 1 is 0 , the state of the other two particles of | G H Z 1 corresponds to the Bell state Φ + . When the state of the first particle of | G H Z 1 is 1 , the state of the rest particles of | G H Z 1 corresponds to the Bell state Ψ + . These properties of | G H Z 1 are used in our proposed protocol.

2.3. Unitary Operations

The unitary operations used in the proposed protocol are Pauli gates. Pauli gates (X, Y, Z) are three quantum gates, which operate on a single qubit. The Pauli-X gate flips the state of a qubit from 0 to 1 and vice versa. The Pauli-Y gate changes the state of a qubit from 0 to 1 and 1 to 0 . The Pauli-Z gate changes the state of a qubit from 1 to 0 and 1 to 1 . Shown in Table 1, the outcomes of the state of a qubit, which passes through a Pauli gate or Identity gate, are listed.

3. QPC Protocol Description

The protocol participants are introduced as follows:
TP: TP is a semi-honesty third party that can help compare the equality of the secret information. TP needs to honestly execute the steps specified in the protocol but allows it to attempt to obtain secret information through some illegal means.
Alice (Bob): Alice (Bob) is a quantum user with complete quantum capabilities who can achieve the preparation and complete measurement of quantum states.
Assume the length of the secret information that Alice and Bob need to compare is L. The secret information of Alice can be expressed as X = x 1 , x 2 , , x L , and the secret information of Bob can be expressed as Y = y 1 , y 2 , , y L , where x i and y i consist of the classical bits 0 and 1, and i represents the i-th particle of the particle sequence X or Y. Moreover, the protocol is described in detail as follows (also shown in Figure 1).
Step 1: TP prepares n  | G H Z 1 states and divides them into three sequences S 1   , S 2   , and S 3   , where S i   includes all of the i-th particles of each state.
Step 2: TP generates 2m decoy photons. Each photon is prepared randomly from four states of single particles | 0 , | 1 , | + , and | . Thereafter, TP chooses m decoy photons and randomly inserts them into S 2   and then randomly inserts the remaining m decoy photons into S 3   . The position of insertion is random. After completing the insertion, the total number of particles of the particle string is n + m. TP records the location and state of these decoy photons. The value of m can be an arbitrary number, but it should be large enough to improve the performance of eavesdropping detection.
Step 3: TP keeps the sequence S 1   for his/her own and sends S 2   and S 3   to Alice and Bob, respectively.
Step 4: Upon receiving the sequences sent by TP, both Alice and Bob immediately conduct eavesdropping detection. Meanwhile, TP announces the location and basis of each decoy photon. Then, Alice and Bob perform the corresponding measurement on these decoy photons, send the measurement results to TP, and discard the decoy photons in S 2   and S 3   . Thereafter, TP determines whether the eavesdropper is on the transmission channel based on the received measurement results. If the error ratio of the measurement results exceeds a predefined threshold, it indicates the presence of eavesdroppers on the communication channel and the protocol needs to be terminated immediately.
Step 5: Alice and Bob perform a shared hash function H on their binary secret information to obtain a binary sequence of the specified length. The hash function H is described as Equation (8).
H : 0 ,   1 L 0 ,   1 K
where L denotes the initial length of the binary sequence and K denotes the length of the binary sequence after performing the shared hash function H.
H : X = x 1 , x 2 , , x L X = x 1 , x 2 , , x K
H : Y = y 1 , y 2 , , y L X = y 1 , y 2 , , y K
where K gets the value of 2n in the protocol.
Thereafter, Alice and Bob divide X and Y into 2n groups, respectively.
X = x 1 , x 2 , x 3 , x 4 , , x 2 n 1 , x 2 n = m 1 A , m 2 A , , m n A
Y = y 1 , y 2 , y 3 , y 4 , , y 2 n 1 , y 2 n = m 1 A , m 2 A , , m n A
where m i 00 ,   01 ,   10 ,   11 .
Step 6: Alice and Bob perform a corresponding operation, which is shown in Table 2, on each particle in S 2   and S 3   . After all the particles have been manipulated, Alice and Bob prepare m decoy photons each, insert them into S 2   and S 3   composed of the operation results, and send the sequences S 2 and S 3   back to TP.
Step 7: After receiving S 2 and S 3 , TP carries out eavesdropping detection immediately to ensure that there is no eavesdropping. TP discards the decoy photons after eavesdropping detection.
Step 8: TP combines both sequences to form the Q i = q 2 i , q 3 i , in which the q 2 i is the i-th particle of S 2 and the q 3 i is the i-th particle of S 3 . Then, TP measures the pairs Q i with Bell basis and measures each particle of the sequence S 1   with 0 , 1 basis.
Step 9: TP judges the equality of the secret information of Alice and Bob based on the measurement results in Step 8. If the measurement results of Bell basis and 0 , 1 basis are Φ + and 0 or Ψ + and 1 , the secret information being compared is equal. Otherwise, if the measurement result occurs in another situation, the secret information being compared is different. The equal results are shown in Table 3, and the summary of all measurement results is shown in Table 4.

4. Correctness

Suppose the quantum users Alice and Bob want to compare the secret information X = Y = 101100011001 , which would turn into X and Y after performing the shared hash function H (Shown as Equation (8)). The purpose of performing the hash operation is to convert the comparative secret information to a specific length and to perform the first encryption processing. For convenience of presentation, we assume that X = Y = 10110001 .
TP prepares four three-particle GHZ-like states and divides them into three sequences S 1   = s 1 1 , s 1 2 , s 1 3 , s 1 4 , S 2   = s 2 1 , s 2 2 , s 2 3 , s 2 4 and S 3   = s 3 1 , s 3 2 , s 3 3 , s 3 4 . Then, TP inserts decoy photons into S 2   and S 3   . Thereafter, TP sends S 2   and S 3   to Alice and Bob, respectively. After receiving the sequences, Alice and Bob perform eavesdropping detection immediately and carry out the operations Y , Z , I , X based on the result of secret information performed by the hash function H. Then, Alice and Bob prepare decoy photons each and send S 2 and S 3 back to TP.
TP performs eavesdropping detection and carries out the Bell basis and 0 , 1 basis measurement. The measurement results are Φ + and 0 , Ψ + and 1 . The result means that the secret information being compared is equal. The comparison process is shown in Table 5, and an example of unequal secret information is shown in Table 6. The decoy photons are not displayed in the comparison process shown in Table 5 and Table 6. The decoy photons are randomly located in the quantum sentences and discarded after eavesdropping detection.

5. Security Analyses

5.1. External Attacks

Assume the external attacker is Eve. The attack methods that Eve can use to steal the secret information of Alice or Bob or both Alice and Bob are intercept-resend attack, measure-resend attack, and entanglement attack. The following is a detailed analysis of these three attacks.

5.1.1. Intercept-Resend Attack

The external attacker Eve may carry out an intercept-resend attack by first intercepting the particle sequences sent by TP to Alice and Bob and storing them. Then, Eve prepares the same and specified amount of single particles and sends them to Alice and Bob. After Alice and Bob perform their operations, Eve again intercepts the quantum particle sequences sent by Alice and Bob to TP and makes measurements to obtain secret information about Alice and Bob, while returning the previously stored quantum particle sequences to TP.
However, Eve’s attack will inevitably introduce errors because Alice, Bob, and TP will perform eavesdropping detection as soon as they receive the particle sequence. The receivers will require the sender to disclose the location and measurement basis of the bait particles, and Eve cannot know the specific state of these particles. When the receiver selects the measurement basis announced by the sender to measure the single particle sent by Eve, there is a 50% probability of obtaining an incorrect result. Eve does not prepare a single particle with the same state as the particle sequences, for example, the original decoy photon has a state of 1 , but Eve prepares a single particle with a state of 0 . The probability of Eve preparing particles in the wrong state is 1/2. The probability of Eve successfully deceiving the detection is 1 / 2 n , where n is the number of decoy photons measured in the eavesdropping detection. When the value of n is large enough, the probability of Eve being discovered is infinitely close to 1. Therefore, the intercept-resend attack is invalid for the method of the present invention.

5.1.2. Measure-Resend Attack

The external attacker Eve can execute the measure-resend attack by first intercepting the particle sequences sent by TP to Alice and Bob and performing 0 , 1 basis measurement. Then, based on the measurement results, new quantum particles are prepared and sent to Alice and Bob. After Alice and Bob complete their operations, Eve intercepts the quantum particle sequence sent by Alice and Bob to TP again and conducts measurements to try to obtain the secret information encoded in the quantum particle sequences. At the same time, a new quantum particle sequence is prepared based on the measurement results and transmitted back to TP.
Nonetheless, Eve’s attack will unavoidably result in errors because the decoy photons prepared by Alice, Bob, and TP have four states, 0 , 1 , + , and . The state 0 and 1 can be measured using the 0 , 1 basis. The state + and can be measured using the X basis. Moreover, Eve cannot know the position of these decoy photons in the state + and , so it is impossible to prepare corresponding quantum particles and send them to the receivers. Eve may choose the 0 , 1 basis to measure these quantum particles to get much more secret information. When the receivers conduct eavesdropping detection, the senders announce the position and measurement basis of the decoy photons, and the receivers select the corresponding measurement basis for measurement. If the measurement basis is 0 , 1 basis, no errors will be found; if the measurement basis is X, there is a 50% probability of obtaining incorrect results (shown in Table 7). Therefore, the measure-resend attack is invalid for the method of the present invention.

5.1.3. Entanglement Attack

The external attacker Eve can perform the entanglement attack by first entangling her auxiliary quantum particles ε with the target particle; then, Eve measures her auxiliary particles to obtain useful information. The proposed protocol uses a bidirectional quantum channel for quantum communication, so Eve’s entanglement measurement attack can be modeled as two unitary operations U E and U F . U E is performed on the channel TP to Alice and Bob, while U F is performed on the channel Alice and Bob to TP. When the proposed protocol performs eavesdropping detection, only decoy particles are measured, and if Eve can deceive the detection in this stage, the attack can be undetected. Therefore, the following analysis demonstrates that the decoy particle technology applied in the present invention can resist Eve’s entanglement attack.
When Eve uses the unitary operation U E to entangle with the particle that stays in the state 0 and 1 , the state of 0 or 1 has been changed. Its state can be reformulated as:
U E 0 , ε T E = λ 00 0 ϵ 00 + λ 01 1 ϵ 01
U E 1 , ε T E = λ 10 0 ϵ 10 + λ 11 1 ϵ 11
where T and E represent the decoy particles of users and the auxiliary particles of Eve. ϵ 00 , ϵ 01 , ϵ 10 , and ϵ 11 represent the pure states selected by Eve in the unitary operation U E . λ 00 , λ 01 , λ 10 , and λ 11 must meet the conditions: λ 00 2 + λ 01 2 = 1 , λ 10 2 + λ 11 2 = 1 .
The decoy particles + and can be expressed as
+ = 1 2 0 + 1 , = 1 2 0 1
When Eve uses the auxiliary particle ε to entangle with + or in the operation U E , the state of + or has been changed. And its state can be reformulated as
U E + , ε T E = 1 2 λ 00 0 ϵ 00 + λ 01 1 ϵ 01 + λ 10 0 ϵ 10 + λ 11 1 ϵ 11 = 1 2 + λ 00 ϵ 00 + λ 01 ϵ 01 + λ 10 ϵ 10 + λ 11 ϵ 11 + 1 2 λ 00 ϵ 00 λ 01 ϵ 01 + λ 10 ϵ 10 λ 11 ϵ 11
U E , ε T E = 1 2 λ 00 0 ϵ 00 + λ 01 1 ϵ 01 λ 10 0 ϵ 10 λ 11 1 ϵ 11 = 1 2 + λ 00 ϵ 00 + λ 01 ϵ 01 λ 10 ϵ 10 λ 11 ϵ 11 + 1 2 λ 00 ϵ 00 λ 01 ϵ 01 λ 10 ϵ 10 + λ 11 ϵ 11
In the above equation, some conditions must be satisfied to avoid Eve introducing errors when the users perform eavesdropping detection.
λ 01 = λ 10 = 0 , λ 00 ϵ 00 = λ 11 ϵ 11
In the proposed protocol, the entanglement attack of Eve mainly acts on the second and third particles of the GHZ-like states used for transmitting information. The GHZ-like state | G H Z 1 used in the proposed protocol can be written as follows:
| G H Z 1 = 1 2 0 00 + 11 + 1 01 + 10 = 1 2 0 Φ + + 1 Ψ
The second and third particles of the GHZ-like state can be considered as a Bell state together. Without losing generality, the following Bell state expressions are used for analysis.
Γ ± = 1 2 | 0 q ± 1 q ¯
After Eve performs the unitary operation U E A and U E B on the two particles, respectively, the state of the two particles is changed.
U E A U E B | 0 q , ε A ε B = U E A 0 ε A U E B q ε B = λ 00 0 ϵ 00 λ q q 1 ϵ q q = λ 00 λ q q 0 q ϵ 00 ϵ q q  
U E A U E B | 1 q ¯ , ε A ε B = U E A 1 ε A U E B q ¯ ε B = λ 11 1 ϵ 11 λ q ¯ q ¯ q ¯ ϵ q ¯ q ¯ = λ 11 λ q ¯ q ¯ 1 q ¯ ϵ 11 ϵ q ¯ q ¯ = λ 00 λ q q 1 q ¯ ϵ 00 ϵ q q
where Equation (22) can be simplified, combined with Equation (18). The result is given as follows.
U E A U E B | ψ ± , ε A ε B = 1 2 U E A U E B | 0 q , ε A ε B ± | 1 q ¯ , ε A ε B = 1 2 λ 00 λ q q 0 q ϵ 00 ϵ q q ± λ 00 λ q q 1 q ¯ ϵ 00 ϵ q q = λ 00 λ q q ψ ± ϵ 00 ϵ q q
According to Equation (14), the tensor product of the attacker Eve’s auxiliary particle and its target particle can be expressed as a simple product of the two, so Eve’s auxiliary particle and target particle are independent of each other. Overall, if Eve does not want to introduce errors in eavesdropping detection in the present invention, Eve’s auxiliary particles and target particles are independent of each other, which means that there is no entanglement. Eve is unable to obtain information about the target particle by measuring her auxiliary particles. Hence, the entanglement attacks are ineffective against our protocol.
Above all, this protocol is impervious to external attacks. The protocol uses the decoy photon technique, which also has been proven to be unconditional security [21,22], to ensure the security of the quantum communication channel and counter most external attacks.

5.2. Participant Attacks

Apart from external attacks, a QPC protocol may also be attacked by internal participants. In the following, two attacks from the participants are analyzed in detail.

5.2.1. The Attack from Alice or Bob

Without loss of generality, assume that Bob is a malicious user aiming to acquire Alice’s sensitive information. As mentioned in our protocol, S 2 is computed from Alice’s secret. Since there is no direct communication between Alice and Bob, to get Alice’s operations on each particle of S 2 , Bob needs to intercept the sequence S 2   sent by TP to Alice and the sequence S 2 sent by Alice to TP. However, the attack methods that Bob may use cannot work, which has been analyzed in the previous part.

5.2.2. The Attack from TP

The impact of a semi-honest third-party TP on the QPC protocol cannot be disregarded, as he/she communicates directly with the participants. In our protocol, TP participated in the preparation of GHZ-like state particles and the measurement of encoded quantum particles. TP may infer the secret information being compared based on the final measurement results, but this approach is not feasible. On the one hand, the user’s secret information is encoded on GHZ-like particles through unitary operations, and TP cannot know the specific unitary operations selected by the users. On the other hand, the two binary bits corresponding to each unitary operation are not actual secret information but ciphertext formed after performing a hash function. As a participant in the protocol, TP may also engage in side-channel attacks, which analyze and obtain relevant information of secret information from the physical characteristics of the system, such as the power consumption and processing time during the preparation or encoding of quantum particles. However, the application of decoy photon technology in this protocol can effectively interfere with the execution of side-channel attacks, while hash operations also avoid the leakage of true secret information. In addition, TP may adopt attack methods similar to Eve, but such attacks can be effectively resisted by our protocol. Therefore, the proposed protocol can resist an attack from TP.

6. Efficiency Analysis and Discussion

In this section, the quantum efficiency of our protocol is analyzed in detail. The quantum efficiency of a QPC protocol can be evaluated by comparing the number of classical bits to the number of quantum particles used in the comparison. It is well known that the efficiency of a QPC protocol can be expressed with the following equation [23]:
η e = η c η t
where η e   denotes the QPC protocol’s efficiency, η c   denotes the number of compared classical bits in each comparison, and η t   denotes the number of generated particles in each comparison.
In the proposed protocol, we generated n three-particle GHZ-like states to compare L classical bits of secret data. After performing the hash operation, the length of classical bits transforms into K, which is given the value of 2n. The total number of quantum particles is 3n. Therefore, the quantum efficiency is 2 n / 3 n = 66 % . The comparison of this protocol with other previously proposed QPC protocols is shown in Table 8.

7. Conclusions

A secure and efficient QPC protocol using GHZ-like states is proposed in this paper. Two quantum users, Alice and Bob, can compare the equality of their secret information with the help of a third-party TP. Compared with most previous QPC protocols, the proposed protocol is more efficient. And in the proposed protocol, the GHZ-like state is used to disseminate quantum information. The unitary operations are used to encode the GHZ-like state particles according to secret information encrypted with a shared hash function. The main feature of the protocol is that users can complete the comparison without sharing a quantum key and communicating, which makes the protocol greatly improved in terms of efficiency while ensuring security, and the protocol makes good use of quantum resources.

Author Contributions

Writing—original draft preparation, F.C., Z.W. and A.F.; writing—review and editing, F.C. and J.L.; and Supervision, J.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Key Research and Development Program of Ningxia Hui Autonomous Region, grant number “2021BEG02007” and the Open Research Fund of Key Laboratory of Cryptography of Zhejiang Province, grant number “No. ZCL21006”.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

We acknowledge fruitful discussions with Chongyang Ye.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Yin, H.L.; Fu, Y.; Li, C.L.; Weng, C.X.; Li, B.H.; Gu, J.; Lu, Y.S.; Huang, S.; Chen, Z.B. Experimental quantum secure network with digital signatures and encryption. Natl. Sci. Rev. 2023, 10, nwac228. [Google Scholar] [CrossRef]
  2. Zhou, L.; Lin, J.; Xie, Y.; Lu, Y.; Jing, Y.; Yin, H.; Yuan, Z. Experimental Quantum Communication Overcomes the Rate-Loss Limit without Global Phase Tracking. Phys. Rev. Lett. 2023, 130, 250801. [Google Scholar] [CrossRef]
  3. Xie, Y.M.; Lu, Y.S.; Weng, C.X.; Cao, X.Y.; Jia, Z.Y.; Bao, Y.; Wang, Y.; Fu, Y.; Yin, H.L.; Chen, Z.B. Breaking the rate-loss bound of quantum key distribution with asynchronous two-photon interference. PRX Quantum 2022, 3, 020315. [Google Scholar] [CrossRef]
  4. Gu, J.; Cao, X.Y.; Fu, Y.; He, Z.W.; Yin, Z.J.; Yin, H.L.; Chen, Z.B. Experimental measurement-device-independent type quantum key distribution with flawed and correlated sources. Sci. Bull. 2022, 67, 2167–2175. [Google Scholar] [CrossRef]
  5. Huang, X.; Chang, Y.; Cheng, W.; Hou, M.; Zhang, S. Quantum private comparison of arbitrary single qubit states based on swap test. Chin. Phys. B 2022, 31, 040303. [Google Scholar] [CrossRef]
  6. Lang, Y.-F. Fast Quantum Private Comparison without Keys and Entanglement. Int. J. Theor. Phys. 2022, 61, 45. [Google Scholar] [CrossRef]
  7. Lian, Y.; Li, X.; Ye, T. Multi-party quantum private comparison of size relationship with two third parties based on -dimensional Bell states. Phys. Scr. 2023, 98, 035011. [Google Scholar] [CrossRef]
  8. Nilesh, K. Simple proof of security of the multiparty prepare and measure QKD. Quantum Inf. Process. 2022, 21, 351. [Google Scholar] [CrossRef]
  9. Liu, W.; Liu, C.; Wang, H.; Jia, T. Quantum private comparison: A review. IETE Tech. Rev. 2013, 30, 439–445. [Google Scholar] [CrossRef]
  10. 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]
  11. Lang, Y.-F. Quantum gate-based quantum private comparison. Int. J. Theor. Phys. 2020, 59, 833–840. [Google Scholar] [CrossRef]
  12. Wu, W.Q.; Zhou, G.L.; Zhao, Y.X.; Zhang, H.G. New quantum private comparison protocol without a third party. Int. J. Theor. Phys. 2020, 59, 1866–1875. [Google Scholar] [CrossRef]
  13. Ji, Z.X.; Fan, P.R.; Zhang, H.G.; Wang, H.Z. Several two-party protocols for quantum private comparison using entanglement and dense coding. Opt. Commun. 2020, 459, 124911. [Google Scholar] [CrossRef]
  14. 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]
  15. Lang, Y.-F. Quantum private comparison using single bell state. Int. J. Theor. Phys. 2021, 60, 4030–4036. [Google Scholar] [CrossRef]
  16. Chen, F.L.; Zhang, H.; Chen, S.G.; Cheng, W.T. Novel two-party quantum private comparison via quantum walks on circle. Quantum Inf. Process. 2021, 20, 178. [Google Scholar] [CrossRef]
  17. 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]
  18. Zhang, J.W.; Xu, G.; Chen, X.B.; Chang, Y.; Dong, Z.C. Improved multiparty quantum private comparison based on quantum homomorphic encryption. Phys. A Stat. Mech. Its Appl. 2023, 610, 128397. [Google Scholar] [CrossRef]
  19. Liu, C.; Zhou, S.; Gong, L.H.; Chen, H.Y. Quantum private comparison protocol based on 4D GHZ-like states. Quantum Inf. Process. 2023, 22, 255. [Google Scholar] [CrossRef]
  20. Yu, K.F.; Gu, J.; Hwang, T. Multi-party semi-quantum key distribution-convertible multi-party semi-quantum secret sharing. Quantum Inf. Process. 2017, 16, 1–14. [Google Scholar] [CrossRef]
  21. Yang, C.W. Encryption chain based on measurement result and its applications on semi-quantum key distribution protocol. Sci. Rep. 2022, 12, 18381. [Google Scholar] [CrossRef]
  22. Frigyik, A. Quantum Cryptography: Quantum Key Distribution, a Non-technical Approach. arXiv 2022, arXiv:2211.17089. [Google Scholar]
  23. Gianni, J.; Qu, Z. New quantum private comparison using hyperentangled ghz state. J. Quantum Comput. 2021, 3, 45–54. [Google Scholar] [CrossRef]
  24. Ye, T.Y.; Ji, Z.X. Two-party quantum private comparison with five-qubit entangled states. Int. J. Theor. Phys. 2017, 56, 1517–1529. [Google Scholar] [CrossRef]
  25. 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]
Figure 1. The model of the proposed protocol.
Figure 1. The model of the proposed protocol.
Entropy 25 01552 g001
Table 1. The operation outcome of the Pauli gates and Identity gate.
Table 1. The operation outcome of the Pauli gates and Identity gate.
QubitX GateY GateZ GateI Gate
| 0 | 1 | 1 | 0 | 0
| 1 | 0 | 0 | 1 | 1
Table 2. Summary table of m i and their corresponding unitary operations.
Table 2. Summary table of m i and their corresponding unitary operations.
m i 00011011
Unitary operationIXYZ
Table 3. Summary table of equal results.
Table 3. Summary table of equal results.
Measurement MethodResult 1Result 2
0 , 1 basis 0 1
Bell basis Φ + Ψ +
Table 4. Summary table of all measurement results.
Table 4. Summary table of all measurement results.
AliceBob G H Z 1 Result G H Z 1
I I 000 + 011 + 101 + 110 / 2 Y e s 0 Φ + + 1 Ψ + / 2
I X 001 + 010 + 100 + 111 / 2 N o 0 Ψ + + 1 Φ + / 2
I Y 001 + 010 + 100 111 / 2 N o 0 Ψ + 1 Φ / 2
I Z 000 011 101 + 110 / 2 N o 0 Φ + 1 Ψ / 2
X I 010 + 001 + 111 + 100 / 2 N o 0 Ψ + + 1 Φ + / 2
X X 011 + 000 + 110 + 101 / 2 Y e s 0 Φ + + 1 Ψ + / 2
X Y 011 + 000 + 110 101 / 2 N o 0 Φ + 1 Ψ / 2
X Z 010 001 111 + 100 / 2 N o 0 Ψ + 1 Φ / 2
Y I 010 + 001 111 + 100 / 2 N o 0 Ψ + 1 Φ / 2
Y X 011 + 000 110 + 101 / 2 N o 0 Φ + 1 Ψ / 2
Y Y 011 + 000 110 101 / 2 Y e s 0 Φ + + 1 Ψ + / 2
Y Z 010 001 + 111 + 100 / 2 N o 0 Ψ + + 1 Φ + / 2
Z I 000 011 + 101 110 / 2 N o 0 Φ + 1 Ψ / 2
Z X 001 010 + 100 111 / 2 N o 0 Φ + 1 Ψ / 2
Z Y 001 010 + 100 + 111 / 2 N o 0 Ψ + + 1 Φ + / 2
Z Z 000 + 011 101 110 / 2 Y e s 0 Φ + + 1 Ψ + / 2
where G H Z 1 and G H Z 1 denote the two expressions of | G H Z 1 performed unitary operations.
Table 5. The comparison process of equal secret information.
Table 5. The comparison process of equal secret information.
AliceBobTP
Secret information X = 101100011001 Y = 101100011001
After hash function H X = 10110001 Y = 10110001
Unitary operations Y , Z , I , X Y , Z , I , X
S 2     and   S 3   S 2   = 0 , 1 , 0 , 1 S 3   = 0 , 1 , 1 , 0 S 1   = 0 , 0 , 1 , 1
S 2   and   S 3 S 2 = 1 , 1 , 0 , 0 S 3 = 1 , 1 , 1 , 1
Combined pairs Q 1 , Q 2 , Q 3 , Q 4 = 11 , 11 , 01 , 01
Measurement results{ Φ + , Φ + , Ψ + , Ψ + } { 0 , 0 , 1 , 1
Equality of secretYes
Table 6. The comparison process of unequal secret information.
Table 6. The comparison process of unequal secret information.
AliceBobTP
Secret information X = 101100011011 Y = 101100011001
After hash function H X = 10110011 Y = 10110001
Unitary operations Y , Z , I , Z Y , Z , I , X
S 2     and   S 3   S 2   = 0 , 1 , 0 , 1 S 3   = 0 , 1 , 1 , 0 S 1   = 0 , 0 , 1 , 1
S 2   and   S 3 S 2 = 1 , 1 , 0 , 1 S 3 = 1 , 1 , 1 , 1
Combined pairs Q 1 , Q 2 , Q 3 , Q 4 = 11 , 11 , 01 , 11
Measurement results{ Φ + , Φ + , Ψ + , Φ } { 0 , 0 , 1 , 1
Equality of secretNo
Table 7. The example of the process that Eve eavesdrops (the decoy photon is + ).
Table 7. The example of the process that Eve eavesdrops (the decoy photon is + ).
The state of the decoy photon +
The measurement basis Eve chooses 0 , 1 basis
The measurement result 0 1
The measurement basis the receivers chooseX basis
The measurement result + +
Is the result correct or notYesNoYesNo
Table 8. The comparison between our protocol and some previous protocols.
Table 8. The comparison between our protocol and some previous protocols.
Ref. [17]Ref. [23]Ref. [24]Ref. [25]Our Protocol
Quantum resourceeight-qubit entangled stateshyper-entangled GHZ statesfive-qubit entangled statesfour-qubit Cluster
state and X-type state
three-particle GHZ-like state
QKD methodYesYesYesYesNo
Decoy photonYesYesYesYesYes
Unitary operationNoNoNoNoYes
Entanglement swappingNoYesNoNoNo
Quantum efficiency25%66%40%50%66%
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

Li, J.; Che, F.; Wang, Z.; Fu, A. Efficient Quantum Private Comparison without Sharing a Key. Entropy 2023, 25, 1552. https://doi.org/10.3390/e25111552

AMA Style

Li J, Che F, Wang Z, Fu A. Efficient Quantum Private Comparison without Sharing a Key. Entropy. 2023; 25(11):1552. https://doi.org/10.3390/e25111552

Chicago/Turabian Style

Li, Jian, Fanting Che, Zhuo Wang, and Anqi Fu. 2023. "Efficient Quantum Private Comparison without Sharing a Key" Entropy 25, no. 11: 1552. https://doi.org/10.3390/e25111552

APA Style

Li, J., Che, F., Wang, Z., & Fu, A. (2023). Efficient Quantum Private Comparison without Sharing a Key. Entropy, 25(11), 1552. https://doi.org/10.3390/e25111552

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