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.
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
, and the secret information of Bob can be expressed as
, where
and
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 states and divides them into three sequences , , and , where 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 , , , and . Thereafter, TP chooses m decoy photons and randomly inserts them into and then randomly inserts the remaining m decoy photons into . 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 for his/her own and sends and 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 and . 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).
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.
where
K gets the value of 2
n in the protocol.
Thereafter, Alice and Bob divide
and
into 2
n groups, respectively.
where
.
Step 6: Alice and Bob perform a corresponding operation, which is shown in
Table 2, on each particle in
and
. After all the particles have been manipulated, Alice and Bob prepare
m decoy photons each, insert them into
and
composed of the operation results, and send the sequences
and
back to TP.
Step 7: After receiving and , 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 , in which the is the i-th particle of and the is the i-th particle of . Then, TP measures the pairs with Bell basis and measures each particle of the sequence with 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
basis are
and
or
and
, 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 , which would turn into and 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 .
TP prepares four three-particle GHZ-like states and divides them into three sequences , and . Then, TP inserts decoy photons into and . Thereafter, TP sends and to Alice and Bob, respectively. After receiving the sequences, Alice and Bob perform eavesdropping detection immediately and carry out the operations based on the result of secret information performed by the hash function H. Then, Alice and Bob prepare decoy photons each and send and back to TP.
TP performs eavesdropping detection and carries out the Bell basis and
basis measurement. The measurement results are
and
,
and
. 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.
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]:
where
denotes the QPC protocol’s efficiency,
denotes the number of compared classical bits in each comparison, and
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 2
n. The total number of quantum particles is 3
n. Therefore, the quantum efficiency is
. The comparison of this protocol with other previously proposed QPC protocols is shown in
Table 8.