Anti-pollution-attack quantum network coding method and device based on quantum state sharing

Abstract

According to the anti-pollution-attack quantum network coding method and device based on quantum state sharing, quantum network coding can be achieved on a butterfly network, a receiver can receive the quantum state from a sender with the fidelity being 1 and the success probability being 1 at the same time, pollution attacks can be completely resisted, and the method and device can be used in an actual network. The method comprises the following steps: (1) a pretreatment stage; (2) a key generation stage; (3) encryption stage; (4) an initial coding stage; (5) an intermediate coding stage; and (6) ending a coding stage, a decoding stage and a decryption stage.

Description

Technical Field

[0001] The present invention relates to the technical field of quantum network coding, and in particular to a quantum network coding method based on quantum state sharing and resistant to pollution attacks, and a quantum network coding device based on quantum state sharing and resistant to pollution attacks. Background Art

[0002] The development of quantum communication networks will inevitably generate massive amounts of data transmission, making network congestion an unavoidable problem. At the same time, quantum network coding, a core technology for improving information transmission efficiency, has become a research hotspot in quantum information science. Quantum network coding uses intermediate nodes to encode the information being transmitted, for example, encoding two bits of information into one, reducing the number of transmissions. Decoding then restores the original information. This process improves quantum communication efficiency and overcomes the capacity bottleneck of traditional routing protocols.

[0003] Research on quantum network coding requires specific discussion of different quantum network architectures. Quantum network architectures primarily include butterfly, k-pair, tree, cup, and grid models. Numerous coding schemes have been proposed in recent years, with the butterfly architecture receiving the most attention. However, research based on the butterfly architecture originated in 2006 by Hayashi et al., marking the beginning of quantum network coding. Unfortunately, their approach to encoding and decoding compromised the fidelity of the transmitted quantum states. In 2007, they improved their scheme and proposed a quantum network coding scheme using pre-entangled states, achieving a fidelity of unity. In this scheme, Bell states are pre-shared between senders to achieve teleportation and cross-transmission. Intermediate nodes use modular-two addition to encode and decode the classical bit key, thus simplifying the bottleneck problem. The scheme also demonstrated that pre-shared entangled states are essential for cross-transmission. This research sparked widespread research in quantum network coding.

[0004] In the early stages of quantum network coding research, a series of schemes were proposed, including that of Hayashi et al. Most of these schemes focused solely on encoding and decoding operations, without considering security. However, ensuring security is a fundamental requirement for any system, and thus security became a key focus of subsequent research. In 2017, Owair et al. proposed a single-shot secure NQC protocol, which protects quantum butterfly networks against external eavesdroppers and demonstrates that the transmitted quantum state remains secure even if a link is eavesdropped. Subsequently, in 2022, Cheng et al. applied quantum homomorphic encryption to address the security issues of butterfly networks, proposing a secure two-qubit crossover protocol. In this scheme, the intermediate node transmits an encrypted quantum state, and the receiver obtains the encoded information through decryption or decoding. Simultaneously, numerous papers have addressed the security issues of quantum network coding against external eavesdroppers. However, in an open network environment, secret information in quantum channels is not only vulnerable to eavesdropping or tampering by external attackers, but the network structure may also contain dishonest nodes. Due to the nature of the coding, these nodes could potentially tamper with the correct information by injecting contaminated quantum states, rendering the entire quantum network transmission invalid. This type of "quantum pollution attack" is a significant threat and difficult to address, making it a hot topic for researchers. Considering the potential for quantum pollution attacks on network structures, Shang et al., using quantum homomorphic signatures, proposed a pollution-resistant quantum network coding scheme. This scheme was later proven to be able to evade verification by the receiver through unitary operations, allowing for pollution attacks, but it does have certain vulnerabilities. Summary of the Invention

[0005] In order to overcome the defects of the prior art, the technical problem to be solved by the present invention is to provide a quantum network coding method based on quantum state sharing that is resistant to contamination attacks, which can realize quantum network coding on a butterfly network, and the receiver can simultaneously receive the quantum state from the sender with a fidelity of 1 and a success probability of 1, which can completely resist contamination attacks and can be used in actual networks.

[0006] The technical solution of the present invention is: this quantum network coding method based on quantum state sharing and resistant to contamination attacks comprises:

[0007] (1) Preprocessing stage: The two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and the quantum plaintext state and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission;

[0008] (2) Key generation phase: The key management center KMC completes key generation and secure distribution through the BB84 protocol or the B92 protocol. For the private key of the node, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the private key of the receiver, and defines a linear equation

[0009]

[0010] Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes;

[0011] (3) Encryption phase: The sender first uses the joint Bell basis measurement result to perform a one-time encryption on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the joint Bell basis measurement result and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information.

[0012] (4) Initial encoding phase: The intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information;

[0013] (5) Intermediate encoding stage: The intermediate node T0 simultaneously encodes the received classical information and particle sequence for the second time, in which the classical information is copied and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information;

[0014] (6) End encoding, decoding and decryption stages: The receiver verifies the received classical information and particle sequence. After verification, the receiver uses the shared message authentication code to decode and then decrypts the received quantum ciphertext based on the decoded information.

[0015] The present invention can realize quantum network coding on a butterfly network, and the receiver can simultaneously receive the quantum state from the sender with a fidelity of 1 and a success probability of 1. It can completely resist contamination attacks and can be used in actual networks.

[0016] The invention also provides a quantum network coding device based on quantum state sharing and anti-pollution attack, including: a pre-processing module, two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and quantum plaintext states. and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission;

[0017] The key generation module, the key management center KMC completes the key generation and secure distribution through the BB84 protocol or the B92 protocol; among them, for the node's private key, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the receiver's private key, and at the same time defines a linear equation

[0018]

[0019] Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes;

[0020] In the encryption module, the sender first uses the joint Bell basis measurement result to perform a one-time secret on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the respective joint Bell basis measurement results and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information.

[0021] In the initial coding module, the intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information;

[0022] In the intermediate encoding module, the intermediate node T0 simultaneously performs a second encoding on the received classical information and particle sequence. The classical information is copied, and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information.

[0023] At the end of the encoding phase, decoding and decryption modules, the receiver verifies the received classical information and particle sequence. After passing, the receiver uses the shared message authentication code to decrypt the received information.

[0024] The code is then used to decrypt the received quantum ciphertext according to the decoded information. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 A schematic diagram of the quantum network coding method is shown. The solid line represents the quantum-classical channel, which transmits two types of information and is used to detect contamination attacks. The dashed line represents the quantum channel, which transmits the quantum ciphertext state. The dashed line represents the process, pointing to the particle sequence after the receiver's operation, that is, the reconstructed quantum state.

[0026] Figure 2The quantum circuit diagram of the quantum network coding scheme according to the present invention is shown. The double solid line represents the transmission route of classical information, and the single solid line represents the transmission route of quantum information.

[0027] Figure 3 The quantum state sharing diagram of the butterfly network nodes is shown. This diagram is actually equivalent to Figure 1 This figure illustrates the proposed scheme on a butterfly network using quantum state sharing. The solid line represents the classical channel, which distributes the private key. The dashed line represents the quantum-classical channel, where nodes S0, T0, T1, and T2 collaborate to reconstruct the quantum state. The dashed line represents the quantum channel.

[0028] Figure 4 Shows the particle sequence A diagram showing the particle changes during the distribution process to receivers T1 and T2. The dotted boxes represent the locations of the butterfly network nodes, the circles of different colors represent different particles, and the curved lines represent the entanglement between the particles.

[0029] Figure 5 The extended diagram of quantum network coding scheme is shown. Figure 1 The difference is that this network structure has n intermediate nodes. The solid line represents the quantum-classical channel, which transmits two types of information and is used to detect contamination attacks. The solid dashed line represents the quantum channel, which transmits the quantum ciphertext state. The dashed line represents the process, pointing to the particle sequence after the receiver's operation, that is, the reconstructed quantum state.

[0030] Figure 6 The figure is a flow chart of a quantum network coding method for resisting contamination attacks based on quantum state sharing according to the present invention. DETAILED DESCRIPTION

[0031] like Figure 6 As shown, this quantum network coding method based on quantum state sharing and resistant to contamination attacks includes:

[0032] (1) Preprocessing stage: The two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and the quantum plaintext state and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission;

[0033] (2) Key generation phase: The key management center KMC completes key generation and secure distribution through the BB84 protocol or the B92 protocol. For the private key of the node, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the private key of the receiver, and defines a linear equation

[0034]

[0035] Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes;

[0036] (3) Encryption phase: The sender first uses the joint Bell basis measurement result to perform a one-time encryption on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the joint Bell basis measurement result and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information.

[0037] (4) Initial encoding phase: The intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information;

[0038] (5) Intermediate encoding stage: The intermediate node T0 simultaneously encodes the received classical information and particle sequence for the second time, in which the classical information is copied and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information;

[0039] (6) End encoding, decoding and decryption stages: The receiver verifies the received classical information and particle sequence. After verification, the receiver uses the shared message authentication code to decode and then decrypts the received quantum ciphertext based on the decoded information.

[0040] The present invention can realize quantum network coding on a butterfly network, and the receiver can simultaneously receive the quantum state from the sender with a fidelity of 1 and a success probability of 1. It can completely resist contamination attacks and can be used in actual networks.

[0041] Preferably, in step (5), the intermediate node T0 encodes the received classical information and particle sequence in sequence; for the classical information, the intermediate node T0 copies the classical information and encodes the particle sequence in sequence; Transmit to the next node; for quantum information, the intermediate node T0 Apply U(θ2), where θ2 is your own private key, θ2=K2=ε·x2, to get a new particle sequence particle sequence The status is

[0042]

[0043] Secondly, the intermediate node T0 needs to complete the particle sequence The task is distributed to receivers T1 and T2 simultaneously. (i) T0 and T1. The quantum entangled source generates a pair of two-particle linear cluster states, represented as

[0044]

[0045] Now, the intermediate node T0 also holds a single particle quantum state According to the process of quantum teleportation, the intermediate node T0 performs Operation, then the particle pair (S C , T0) performs a joint Bell basis measurement, and the measurement result is recorded as MR1 = (m, n), and the measurement result is sent to the receiver T1. According to the measurement result, the receiver T1 performs the corresponding unitary operation on the particle it holds, and finally the receiver can obtain the quantum state (ii) T0 and T2. After the quantum teleportation ends, the intermediate node still holds two particles, namely Bell states Afterwards, the intermediate node T0 sends its second particle to the receiver T2. At this time, the intermediate node T0 designs a single particle basis, denoted as {|x>,|y>}, which is specifically expressed as

[0046] |x>=cos(γ+θ1+θ2)|0>+sin(γ+θ1+θ2)|1>

[0047] |y>=sin(γ+θ1+θ2)|0>-cos(γ+θ1+θ2)|1>

[0048] Next, the intermediate node T0 is connected to the Bell state according to the designed single particle basis {|x>,|y>} The first particle is measured, and different measurement results will cause the second particle in the Bell state to collapse into different quantum states. Therefore, the intermediate node T0 sends the measurement result to the receiver T2. According to the measurement result, the receiver T2 performs the corresponding unitary operation on the particle it holds, and finally the receiver T2 can obtain the quantum state

[0049] Preferably, in step (6), the receivers T1 and T2 receive the recovered particle sequence Applying U(θ3), where θ3 is 2kπ-ε+ε·x3, we can get a new particle sequence: That is, the particle sequence The status is

[0050]

[0051] Through calculation, it can be found that the new particle sequence The initial particle sequence at the encoding stage at S0 If the two are equal, it means that the quantum state has been reconstructed. Receivers T1 and T2 perform Z-basis measurement on the particle sequence and compare the result with the classical information. If the two are equal, the verification is passed and the next step is performed; if the two are not equal, it means that an attacker exists and has tampered with the information, and the protocol stops. Receivers T1 and T2 perform an XOR operation on the classical information based on the message authentication codes Y1 and Y2 they have, and they can obtain the key information. Right now The receiver T1 will receive the particles sent by the sender S2 Then use the decoded key information Decrypt the quantum ciphertext state σ1′ and then perform a basis transformation (i.e., H gate) to obtain the quantum plaintext state that S1 wants to send to T1. The same applies to T2.

[0052] Preferably, the step (1) comprises the following sub-steps:

[0053] (1.1) Preparation of relevant quantum states: The sender S1 prepares the quantum plaintext state at the node Where α is an arbitrary real number, satisfying α∈[0,2π], and the sender S2 prepares the quantum plaintext state at the node Where β is an arbitrary real number, satisfying β∈[0,2π]; senders S1 and S2 pre-share two pairs of two-particle cluster states, respectively and The particle s i,j (i,j∈(1,2)) is the sender S i The i-th particle in the j-th cluster state held by the sender is:

[0054]

[0055] (1.2) Cross-transmission: The sender S1 sends a pair of particles (s1,s 1,1 )implement Operation, where particle s1 is the control bit, s 1,1 As the target position, particles s1 and s 1,1 become entangled; at this time, the three-particle system (s1,s 1,1 ,s 2,1 ) becomes

[0056]

[0057] Afterwards, the sender S1 sends particles s1 and s 1,1 Perform Bell basis measurement, and record the measurement result as X1=(a1,b1). According to measurement theory, the set of Bell basis is {|Φ +>,|Φ - >,|Ψ + >,|Ψ - >}, recorded as the binary set {00,01,10,11}; different measurement results lead to particle s 2,1 Collapse into different quantum states Three-particle system (s1,s 1,1 ,s 2,1 ) is written as

[0058]

[0059] The quantum teleportation is completed at the sender S1 using the two-particle cluster state;

[0060] For the sender S2, the sender S2 sends the particle pair (s2,s 2,2 )implement Operation, where particle s2 is the control bit, s 2,2 As the target position, particles s2 and s 2,2 Perform a joint Bell basis measurement, and record the measurement result as X2=(a2,b2). The three-particle system (s2,s 2,2 ,s 1,2 ) becomes

[0061]

[0062] Quantum teleportation is accomplished at the sender S2 using a two-particle cluster state.

[0063] Preferably, the step (3) comprises the following sub-steps:

[0064] (3.1) Encryption related particles: The sender S1 uses the measurement result (a1, b1) as the encryption key to encrypt particle s 1,2 Execute quantum one-time pad

[0065]

[0066] The sender S2 sends the particle s according to the measurement result (a2, b2). 2,1 Encrypted to (3.2) Encrypted measurement results: According to the message authentication code distributed during the key generation phase, senders S1 and S2 perform XOR operations on their respective measurement results X1 = (a1, b1) and X2 = (a2, b2) with their respective message authentication codes Y1 = (c1, d1) and Y2 = (c2, d2), and obtain and Record and

[0067] (3.3) Prepare the corresponding quantum state: senders S1 and S2 each introduce a single-qubit quantum register, and each quantum register is initialized to Then perform quantum operations on each initial state

[0068]

[0069] in, Represents bitwise modulo 2 addition, and the register forms the corresponding particle sequence Record The sender S1 sends the particle σ′2 to the receiver T2 and sends the particle sequence and classic information Send to the intermediate node S0, at the same time, S2 sends particle σ′1 to T1 and sends the particle sequence and classic information Sent to S0.

[0070] Preferably, the step (4) comprises the following sub-steps:

[0071] (4.1) First encoding and sharing of quantum state: The intermediate node S0 introduces two single-qubit quantum registers, each of which is initialized to Then the particle sequence Perform quantum operations on the initial state of the register

[0072]

[0073] Registers form the corresponding particle sequence

[0074] Record Encode the four particles into two particles; the intermediate node S0 uses its own private key K1 = ε·x1 in the particle sequence S C Apply the unitary operator U(θ1), where θ1 is determined by the private key distributed in the key generation phase, θ1=K1=ε·x1, to obtain the new particle sequence , recorded as ; Assumption use To express it, the particle sequence The status is

[0075]

[0076] (4.2) The first encoding of classical information: The intermediate node S0 encodes the classical information sent in the previous stage and Perform a simple XOR operation to obtain new classical information

[0077] Complete the conversion of four-bit classical information into two-bit classical information

[0078] The coding process; the intermediate node S0 converts the particle sequence and classic information Transmitted to the intermediate node T0 through the quantum-classical channel.

[0079] Those skilled in the art will understand that all or part of the steps in the above-mentioned embodiment method can be implemented by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium. When the program is executed, it includes the steps of the above-mentioned embodiment method, and the storage medium can be: ROM / RAM, magnetic disk, optical disk, memory card, etc. Therefore, corresponding to the method of the present invention, the present invention also includes a quantum network coding device based on quantum state sharing and resistant to contamination attacks. The device is usually represented in the form of functional modules corresponding to the steps of the method. The device includes:

[0080] In the preprocessing module, the two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and the quantum plaintext state and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission;

[0081] The key generation module, the key management center KMC completes the key generation and secure distribution through the BB84 protocol or the B92 protocol; among them, for the node's private key, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the receiver's private key, and at the same time defines a linear equation

[0082]

[0083] Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes;

[0084] In the encryption module, the sender first uses the joint Bell basis measurement result to perform a one-time secret on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the respective joint Bell basis measurement results and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information.

[0085] In the initial coding module, the intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information;

[0086] In the intermediate encoding module, the intermediate node T0 simultaneously performs a second encoding on the received classical information and particle sequence. The classical information is copied, and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information.

[0087] At the end of the encoding phase, decoding and decryption modules, the receiver verifies the received classical information and particle sequence. After passing, the receiver uses the shared message authentication code to decrypt the received information.

[0088] The code is then used to decrypt the received quantum ciphertext according to the decoded information.

[0089] The above description is merely a preferred embodiment of the present invention and does not constitute any form of limitation to the present invention. Any simple modifications, equivalent changes and modifications made to the above embodiments based on the technical essence of the present invention are still within the scope of protection of the technical solution of the present invention.

Claims

1. A quantum network coding method based on quantum state sharing and resistant to contamination attacks, characterized by: The method comprises the following steps: (1) Preprocessing stage: The two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and the quantum plaintext state and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission; (2) Key generation phase: The key management center KMC completes key generation and secure distribution through the BB84 protocol or the B92 protocol. For the private key of the node, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the private key of the receiver, and defines a linear equation Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes; (3) Encryption phase: The sender first uses the joint Bell basis measurement result to perform a one-time encryption on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the joint Bell basis measurement result and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information. (4) Initial encoding phase: The intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information; (5) Intermediate encoding stage: The intermediate node T0 simultaneously encodes the received classical information and particle sequence for the second time, in which the classical information is copied and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information; (6) End encoding, decoding and decryption stages: The receiver verifies the received classical information and particle sequence. After verification, the receiver uses the shared message authentication code to decode and then decrypts the received quantum ciphertext based on the decoded information.

2. The quantum network coding method based on quantum state sharing and resistant to contamination attacks according to claim 1 is characterized in that: In step (5), the intermediate node T0 encodes the received classical information and particle sequence in turn; for classical information, it copies and transmits the classical information X1⊕Y1⊕X2⊕Y2 to the next node; for quantum information, the intermediate node T0 encodes the particle sequence Apply U(θ2), where θ2 is your own private key, θ2=K2=ε·x2, to get a new particle sequence particle sequence The status is Secondly, the intermediate node T0 completes the particle sequence through the following steps Tasks distributed to receivers T1 and T2 simultaneously: (i) At T0 and T1, the quantum entangled source generates a pair of two-particle linear cluster states, expressed as Now, the intermediate node T0 also holds a single particle quantum state According to the process of quantum teleportation, the intermediate node T0 performs Operation, then the particle pair (S C , T0) performs a joint Bell basis measurement, and the measurement result is recorded as MR1 = (m, n), and the measurement result is sent to the receiver T1. According to the measurement result, the receiver T1 performs the corresponding unitary operation on the particle it holds, and finally the receiver can obtain the quantum state (ii) T0 and T2, after the quantum teleportation ends, the intermediate node still holds two particles, Bell state The intermediate node T0 sends its second particle to the receiver T2. At this time, the intermediate node T0 designs a single particle basis, recorded as {|x>,|y>}, which is specifically expressed as |x>=cos(γ+θ1+θ2)|0>+sin(γ+θ1+θ2)|1> |y>=sin(γ+θ1+θ2)|0>-cos(γ+θ1+θ2)|1> Next, the intermediate node T0 is connected to the Bell state according to the designed single particle basis {|x>,|y>} The first particle is measured. Different measurement results will cause the second particle in the Bell state to collapse into different quantum states. The intermediate node T0 sends the measurement result to the receiver T2. According to the measurement result, the receiver T2 performs the corresponding unitary operation on the particle it holds. Finally, the receiver T2 obtains the quantum state 3. The quantum network coding method based on quantum state sharing and resistant to contamination attacks according to claim 2 is characterized in that: In step (6), the receivers T1 and T2 receive the recovered particle sequence Apply U(θ3), where θ3 is 2kπ-ε+ε·x3, to obtain a new particle sequence particle sequence The status is new particle sequence The initial particle sequence S at the encoding stage at S0 C ={|X1⊕Y1⊕X2⊕Y2>} is the same, completing the reconstruction of the quantum state; the receivers T1 and T2 perform Z-basis measurement on the particle sequence and compare the results with the classical information. If the two are equal, the verification is passed and the next step is performed; if the two are not equal, it means that an attacker exists and has tampered with the information, and the protocol stops; the receivers T1 and T2 perform an XOR operation on the classical information based on the message authentication codes Y1 and Y2 they have mastered to obtain the key information X1⊕X2, (a1⊕a2, b1⊕b2); the receiver T1 receives the particle sequence sent by the sender S2 Then use the decoded key information (a1⊕a2,b1⊕b2) to decrypt the quantum ciphertext state σ1′, and then perform a basis transformation to obtain the quantum plaintext state that S1 wants to send to T1.

4. The quantum network coding method based on quantum state sharing and resistant to contamination attacks according to claim 3 is characterized in that: The step (1) comprises the following sub-steps: (1.1) Preparation of relevant quantum states: The sender S1 prepares the quantum plaintext state at the node Where α is an arbitrary real number, satisfying α∈[0,2π], and the sender S2 prepares the quantum plaintext state at the node Where β is an arbitrary real number, satisfying β∈[0,2π]; senders S1 and S2 pre-share two pairs of two-particle cluster states, respectively and The particle s i,j (i,j∈(1,2)) is the sender S i The i-th particle in the j-th cluster state held by the sender is: (1.2) Cross-transmission: The sender S1 sends a pair of particles (s1,s 1,1 )implement Operation, where particle s1 is the control bit, s 1,1 As the target position, particles s1 and s 1,1 become entangled; at this time, the three-particle system (s1,s 1,1 ,s 2,1 ) becomes Afterwards, the sender S1 sends particles s1 and s 1,1 Perform Bell basis measurement, and record the measurement result as X1=(a1,b1). According to measurement theory, the set of Bell basis is {|Φ + >,|Φ - >,|Ψ + >,|Ψ - >}, recorded as the binary set {00,01,10,11}; different measurement results lead to particle s 2,1 Collapse into different quantum states Three-particle system (s1,s 1,1 ,s 2,1 ) is written as The quantum teleportation is completed at the sender S1 using the two-particle cluster state; For the sender S2, the sender S2 sends the particle pair (s2,s 2,2 )implement Operation, where particle s2 is the control bit, s 2,2 As the target position, particles s2 and s 2,2 Perform a joint Bell basis measurement, and record the measurement result as X2=(a2,b2). The three-particle system (s2,s 2,2 ,s 1,2 ) becomes Quantum teleportation is accomplished at the sender S2 using a two-particle cluster state.

5. The quantum network coding method based on quantum state sharing and resistant to contamination attacks according to claim 4 is characterized in that: The step (3) comprises the following sub-steps: (3.1) Encryption related particles: The sender S1 uses the measurement result (a1, b1) as the encryption key to encrypt particle s 1,2 Execute quantum one-time pad The sender S2 sends the particle s according to the measurement result (a2, b2). 2,1 Encrypted to (3.2) Encrypted measurement results: Based on the message authentication code distributed during the key generation phase, senders S1 and S2 perform exclusive-OR operations on their respective measurement results X1 = (a1, b1) and X2 = (a2, b2) with their respective message authentication codes Y1 = (c1, d1) and Y2 = (c2, d2), respectively, to obtain (a1⊕c1, b1⊕d1) and (a2⊕c2, b2⊕d2), respectively, denoted as X1⊕Y1 and X2⊕Y2; (3.3) Prepare the corresponding quantum state: senders S1 and S2 each introduce a single-qubit quantum register, and each quantum register is initialized to Then perform quantum operations on each initial state Among them, s i ={(a1⊕c1,b1⊕d1),(a2⊕c2,b2⊕d2)}; ⊕ represents bitwise modulo 2 addition, and the register forms the corresponding particle sequence S Ai ={(|a1⊕c1>,|b1⊕d1>),(|a2⊕c2>,|b2⊕d2>)}, denoted as S Ai ={|X1⊕Y1>,|X2⊕Y2>}; the sender S1 sends the particle σ2′ to the receiver T2, and sends the particle sequence |X1⊕Y1> and the classical information X1⊕Y1 to the intermediate node S0. At the same time, S2 sends the particle σ1′ to T1, and sends the particle sequence |X2⊕Y2> and the classical information X2⊕Y2 to S0.

6. The quantum network coding method based on quantum state sharing and resistant to contamination attacks according to claim 5 is characterized in that: The step (4) comprises the following sub-steps: (4.1) First encoding and sharing of quantum state: The intermediate node S0 introduces two single-qubit quantum registers, each of which is initialized to Then for the particle sequence S Ai Perform quantum operations on the initial state of the register The register forms the corresponding particle sequence S C ={(|a1⊕c1⊕a2⊕c2>,|b1⊕d1⊕b2⊕d2>)}, denoted as S C ={|X1⊕Y1⊕X2⊕Y2>}, the four particles are encoded into two particles; the intermediate node S0 uses its own private key K1=ε·x1 in the particle sequence S C Apply the unitary operator U(θ1), where θ1 is determined by the private key distributed in the key generation phase, θ1=K1=ε·x1, to obtain the new particle sequence , recorded as ; Assume |X1⊕Y1⊕X2⊕Y2> To express it, the particle sequence The status is (4.2) The first encoding of classical information: The intermediate node S0 performs a simple XOR operation on the classical information X1⊕Y1 and X2⊕Y2 sent in the previous stage to obtain the new classical information X1⊕Y1⊕X2⊕Y2, completing the encoding process of converting the four-bit classical information into the two-bit classical information; the intermediate node S0 converts the particle sequence And the classical information X1⊕Y1⊕X2⊕Y2 is transmitted to the intermediate node T0 through the quantum-classical channel.

7. A quantum network coding device resistant to contamination attacks based on quantum state sharing, characterized by: It includes: In the preprocessing module, the two senders S1 and S2 prepare their own quantum plaintext states, pre-share two pairs of two-particle cluster states between the two senders, perform quantum teleportation, perform joint Bell basis measurement on the particles, and the quantum plaintext state and The information appears at the sender S2 and S1 respectively, thus completing the sender's cross transmission; The key generation module, the key management center KMC completes the key generation and secure distribution through the BB84 protocol or the B92 protocol; among them, for the node's private key, KMC first randomly generates a non-zero value ε, which is only allowed to be distributed to the receivers T1 and T2 as the receiver's private key, and at the same time defines a linear equation Generate a private key K for the node by calculation m ={ε·x m |m=1,2,3}, and finally the private key K m Distribute to corresponding nodes; In the encryption module, the sender first uses the joint Bell basis measurement result to perform a one-time secret on the quantum state after cross transmission. At the same time, the sender performs an XOR operation on the respective joint Bell basis measurement results and the message authentication code to ensure the security of the secret information. Based on the classical information after XOR, the sender generates the corresponding quantum state through the quantum register and sends the particle and classical information. In the initial coding module, the intermediate node S0 simultaneously encodes the received particle sequence and classical information for the first time, encoding the four-bit information into two-bit information; In the intermediate encoding module, the intermediate node T0 simultaneously performs a second encoding on the received classical information and particle sequence. The classical information is copied, and the quantum information is distributed through teleportation and measurement, so that the receiver obtains the same information. At the end of the encoding stage, decoding and decryption module, the receiver verifies the received classical information and particle sequence. After passing, the receiver uses the shared message authentication code to decode, and then decrypts the received quantum ciphertext state based on the decoded information.

Images