A dynamic quantum message authentication method with abort recognition

Abstract

The application relates to the fields of secure multi-party communication and quantum cryptography, and discloses a dynamic quantum message authentication method capable of identifying suspension, which comprises the following steps: a semi-quantum trusted third party (SQ-TTP) screening honest participant phase, in which the SQ-TTP dynamically groups the participants, randomly selects part of the participants to form a small quantum communication network for message transmission, and screens out no less than the number of groups of honest participants according to the message authentication result; a parallel transmission of quantum messages of each group phase, in which the SQ-TTP specifies the screened honest participants as the receivers of each group, and the participants in the group complete the message transmission by adopting a quantum message transmission mode similar to that in the screening phase; and a stage of transmitting the received messages to a server by the SQ-TTP and the receivers of each group, in which the server decrypts the messages by using the key sent by the SQ-TTP, and authenticates the messages by measuring the trap qubits. The application is applicable to a large-scale quantum communication network, and can reduce the consumption of quantum resources and improve the message transmission efficiency by dynamic grouping and parallel transmission.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of secure multi-party communication and quantum cryptography, in particular to a dynamic quantum message authentication method capable of identifying suspension. BACKGROUND

[0002] Message authentication, as one of the core technologies in the field of cryptography, plays an important role in ensuring the authenticity and integrity of messages in the communication process. In the traditional computing environment, message authentication schemes relying on symmetric encryption algorithms, hash functions or public key cryptography have high security and are widely used in Internet communication and blockchain technology, etc. However, with the rapid development of quantum technology, these traditional message authentication schemes are facing serious security threats. For example, Shor's quantum algorithm can effectively break RSA and other algorithms that rely on the difficulty of solving large integer factorization or discrete logarithm problems in polynomial time; Grover's quantum search algorithm can reduce the complexity of brute force attack on symmetric cryptographic algorithms from exponential O(2 n ) to square root O(2 Similarly, in the quantum computing environment, some classical message authentication techniques will not be able to effectively guarantee the authenticity and integrity of messages.

[0003] Quantum message authentication (QMA) is an important branch of quantum cryptography, which can effectively prevent eavesdropping and tampering by using quantum no-cloning theorem and quantum entanglement, and provide natural security guarantee for the authenticity and integrity of messages in quantum communication. In 2002, Barnum et al. proposed the definition of quantum message authentication (H. Barnum, C. Crepeau, D. Gottesman, A. Smith, and A. Tapp. Authentication of quantum messages. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 449-458, 2002), and pointed out that the authentication of quantum messages must be encrypted to ensure the security of the messages. After this pioneering work, many QMA schemes based on different methods have been proposed. However, most of the existing QMA schemes only detect the security of a single channel, and the efficiency of these schemes is very low in large-scale quantum communication networks, and the communication system is vulnerable to denial-of-service attacks, which can destroy the entire communication process and cause waste of communication resources. Until 2021, Alon et al. proposed the first secure multiparty quantum message transmission scheme with identifiable abort (B. Alon, H. Chung, K.-M. Chung, M.-Y. Huang, Y. Lee, and Y.-C. Shen. Round efficient secure multiparty quantum computation with identifiable abort. In Advances in Cryptology-CRYPTO 2021, pp. 436-466, 2021), which can abort the transmission of unsafe channels in time when the dishonesty of the communication parties is more than a certain number, and only when most of the quantum data transmission is completed or there is no path to continue transmission in the quantum communication network, the scheme will be terminated, so as to resist denial-of-service attacks in the communication process to improve robustness. However, the trusted third party in this scheme still cannot identify the identity of the participants, and when the message receiver is a malicious participant, there is a great possibility of causing quantum state loss. In addition, in large-scale quantum communication networks, the quantum resources consumed by this scheme increase quadratically with the number of participants, making it difficult to meet the actual demand for communication efficiency and resource utilization.

[0004] Therefore, it is of great significance to design a recognizable abortable QMA scheme applicable to large-scale quantum communication networks, reduce quantum resource consumption, and improve the efficiency of quantum message transmission. Summary of the Invention

[0005] Aiming at the deficiencies of existing recognizable abortable QMA schemes, the present invention introduces a semi-quantum trusted third party SQ-TTP to propose a recognizable abortable dynamic quantum message authentication method. Among them, SQ-TTP has classical computing capabilities and quantum measurement capabilities, but does not have complete quantum computing capabilities. This method can not only reduce quantum resources, improve the efficiency of quantum message transmission, but also effectively identify the identities of participants and reduce the probability of quantum state loss.

[0006] The core method of the present invention includes three stages: SQ-TTP screens honest participants, each group transmits quantum messages in parallel, and SQ-TTP and each group's receiving party transmit the received messages to the server. The specific process of this method is as follows:

[0007] S1: The stage of SQ-TTP screening honest participants. SQ-TTP determines the number of groups p according to the current number of participants N and the preset number of participants q in each group. Subsequently, SQ-TTP randomly selects r participants (p < r < N) to form a small quantum communication network containing n = r + 1 nodes together. SQ-TTP initializes a complete graph G with n nodes and the set of honest participants The nodes in graph G represent the participants in the network, and the connections between the nodes represent that the transmission channels between the participants are secure. The participant R in the network i encodes the quantum message |ψ> i into |φ> ij = CSS.Enc(|ψ> i ) ), where 1 ≤ i ≤ r, 1 ≤ j ≤ m, and sends each encoded quantum bit to SQ-TTP according to the following steps.

[0008] S1.1: SQ-TTP calculates a transmission path S i from the participant R ij to SQ-TTP and broadcasts it. The length of this path is l = n 2 . Define the participants on the path S ij as P1,..., P l , that is, P1 represents the sender R i , P2,..., P l-1 represent the participants transmitted in sequence on the path S ij , and P l represents the final recipient SQ-TTP.

[0009] S1.2: SQ-TTP generates (lt+1) random vectors as keys V1 = {v 11 ,v 12 ,…,v 1(lt+1)}, where l is the number of trap registers and t is the number of qubits in each trap register.

[0010] S1.3: SQ-TTP integrates quaternion unitary operators Send to P1, where P1 applies W1 to the state |φ> after the quantum message is encoded. ij and lt trap qubit states |0> lt Obtaining encrypted quantum states δ1 is then sent to transmission path S. ij The next node P on k (2≤k≤l).

[0011] S1.4: SQ-TTP Random Generation Unitary Operator Send it to P k ,in Acting on t k = (l-k+2)t trapped qubits, Refers to the domain All t k The general linear group consisting of invertible matrices of order G, k This can be achieved using CNOT gate sequences. Acting on the first t k +1 qubit, Acting on the first t k+1 +1 qubit. Then P k W k Acting on quantum state δ k-1 Then measure the qubits in the (l-k+2)th trap quantum register. If the measurement result is all 0, then P k Send the authentication identifier Acc to SQ-TTP, otherwise send the rejection identifier Rej.

[0012] S1.5: If SQ-TTP receives Acc, then P k Continue measuring the remaining quantum state Send to P k+1 Continue transmitting messages according to step S1.4. If SQ-TTP receives Rej, then SQ-TTP deletes P from graph G. k-1 With P k The connection between them, and broadcast messages (abort, P) k-1 P k). When k = l - 1, the last participant P k The quantum state sent to the SQ-TTP after message authentication is However, since the SQ-TTP only has the ability of quantum measurement, it cannot predict the measurement result of the trap register by performing the unitary operator The decrypted quantum state δ k and then measures the trap register to authenticate the message. To ensure that the SQ-TTP can predict the measurement result of the trap register without decrypting the quantum state, the SQ-TTP sends the last participant P k the unitary operator needs to be limited to a combination of Pauli X gate and Pauli Z gate. The SQ-TTP directly measures the second trap register when authenticating the message δ k sent by P k and authenticates the quantum state δ k sent by the last participant P i according to the consistency of the actual measurement result and the predicted measurement result.

[0013] S1.6: If the graph G becomes disconnected, the honest participants connected to the SQ-TTP form a set H. Then the SQ-TTP broadcasts a message (abort, H) and terminates the transmission of quantum messages.

[0014] S1.7: The SQ-TTP decides whether to end the screening according to the number of screened honest participants |H|, if |H| ≥ p, the SQ-TTP outputs the set of honest participants H and completes the screening phase; otherwise, the SQ-TTP dynamically adjusts the grouping parameters according to the current number of remaining participants (N-r), updates the number of participants in each group to q', and continues to screen honest participants according to steps S1.

[0015] S2: Parallel transmission of quantum messages by each group. The SQ-TTP specifies the honest participants in the set H as the receiver of each group, and all groups can transmit quantum messages in parallel, while the participants in the group transmit messages to the receiver designated by the SQ-TTP in the group according to similar steps S1.1-S1.6, except that the SQ-TTP does not need to limit the construction of the unitary operator sent to the last participant. After the transmission in the group is completed, the designated receiver of each group has all the encrypted messages transmitted by the participants in the group.

[0016] S3: The SQ-TTP and the receivers of each group transmit the received messages to the server. After the operations in the two stages of S1 and S2, the SQ-TTP holds the quantum messages of all participants in the set H, and the receivers of each group hold the quantum messages of all participants in the group, and the form of the quantum state they hold is​ Since the SQ-TTP and each group receiver are honest participants, they can directly perform single-channel quantum message authentication with the server. When the server receives the quantum state, he decrypts the quantum state by the unitary operator sent by the SQ-TTP Then the server measures the last t trap qubits. If all the measurement results are 0, the authentication is passed, otherwise, the authentication fails.

[0017] The application uses quaternions and quantum error-correcting code CSS to construct a new quantum message authentication code, and realizes the identifiable abort dynamic QMA method based on the same. Compared with the prior art, the application can better adapt to large-scale quantum communication networks, and the dynamic grouping mechanism and parallel transmission mode can effectively reduce quantum resource consumption and improve the efficiency of quantum communication. Meanwhile, the semi-quantum trusted third party SQ-TTP can identify the identity of the participants, thereby improving the probability of successful quantum message transmission. In addition, the key used in the transmission process can be recycled by the SQ-TTP for continuous use after each authentication is passed, further saving quantum resources. BRIEF DESCRIPTION OF DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the application, the following will briefly introduce the drawings needed to be used in the embodiments. The following drawings are only some embodiments of the application, and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can also be obtained without creative labor.

[0019] Figure 1 is a flowchart of the identifiable abort dynamic quantum message authentication method of the application.

[0020] Figure 2 is a schematic diagram of the overall quantum circuit composed of the operations of the three participants on the transmission path of the embodiment of the application. DETAILED DESCRIPTION

[0021] The technical solutions in the embodiments of the application will be described clearly and completely below with reference to the drawings in the embodiments of the application. Obviously, the described embodiments are only some of the embodiments of the application, not all the embodiments. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the application.

[0022] The flow of the identifiable abort dynamic quantum message authentication method of the application is shown in Figure 1 , which mainly includes the following steps:

[0023] S1: SQ-TTP Screening of Honest Participants Phase. SQ-TTP determines the number of groups according to the current number of participants N and the preset number of participants q per group Ensure that the number of participants in each group is q±1. Subsequently, SQ-TTP randomly selects r participants (p<r<N) to form a small quantum communication network with n = r + 1 nodes. SQ-TTP serves as the message receiver of this communication network, initializing a complete graph G with n nodes and a set of honest participants The nodes in graph G represent the participants in the network, and the connections between nodes represent that the transmission channels between participants are secure. Participant R in the network i Encodes the quantum message |ψ> i Into |φ> through the quantum error-correcting code CSS ij = CSS.Enc(|ψ> i ), where 1≤i≤r, 1≤j≤m, and sends each encoded qubit to SQ-TTP according to the following steps.

[0024] S1.1: SQ-TTP calculates a transmission path S from participant R i To SQ-TTP using the depth-first search or breadth-first search algorithm based on graph G [[ID=...]] (the original text continues here, but the numbering seems to be off. Assuming it's a continuous translation, the following is continued) ij For transmitting the quantum state |φ> ij , and broadcasts this path. To ensure that at least one honest participant on the transmission path can authenticate the quantum message, set the length of this path to l = n 2 . Define the participants on path S ij As P1,…,P l , that is, P1 represents the sender R i , P2,…,P l-1 Represent the participants transmitted in sequence on path S ij , and P l Represents the final receiver SQ-TTP.

[0025] S1.2: SQ-TTP generates (lt + 1) random vectors as the key V1 = {v 11 ,v 12 ,…,v 1(lt+1)}, where l is the number of trap registers and t is the number of qubits in each trap register. The form of each random vector is And satisfies the normalization condition ||v|| 2 =(a 2 +b 2 +c 2 +d 2 ) = 1. Represent the algebraic form of the vector v corresponding to the quaternion using the operators σ1 = iZ, σ2 = iY, and σ3 = iX as U It seems there are some issues with the original text's numbering and formatting, which might cause some confusion during translation. The above translation tries to make sense of the text as much as possible while following the rules. If you can provide more accurate or corrected original text, it will be helpful for a more precise translation.v =aI2+bσ1+cσ2+dσ3=U (a,b,c,d) Its matrix form is The inverse representation of a quaternion is: The corresponding matrix form is And satisfied During message transmission, each participant uses the quaternion U v Encrypt quantum messages using Decrypt the received quantum state.

[0026] S1.3: SQ-TTP integrates quaternion unitary operators Send to P1, where P1 applies W1 to the state |φ> after the quantum message is encoded. ij and lt trap qubit states |0> lt Obtaining encrypted quantum states δ1 is then sent to transmission path S. ij The next node P on k (2≤k≤l).

[0027] S1.4: SQ-TTP Random Generation Unitary Operator Send it to P k ,in Acting on t k = (l-k+2)t trapped qubits, Refers to the domain All t k The general linear group consisting of invertible matrices of order G, k This can be achieved using CNOT gate sequences. Acting on the first t k +1 qubit, Acting on the first t k+1 +1 qubit. Then P k W k Acting on quantum state δ k-1 Then measure the qubits in the (l-k+2)th trap quantum register. If the measurement result is all 0, then P k Send the authentication identifier Acc to SQ-TTP, otherwise send the rejection identifier Rej.

[0028] Specifically, the introduction of G kis to prevent the sender P1 from dishonestly preparing the t trap qubits, causing the honest participants to accuse each other of dishonesty. For example, assume that P1 is malicious and he only honestly prepares the last t trap qubits, and P2 and P3 are honest. If the message δ1 is not attacked on the transmission path, P2 measures the last t trap qubits and gets all 0s, and then wrongly considers P1 to be honest and sends the wrong authentication identifier Acc to the SQ-TTP. When P3 applies W3 to δ2 and then measures the t trap qubits, he gets a non-all-0 measurement result, and thus wrongly considers P2 to be malicious.G k is a linear reversible matrix of t k × t k , which is isomorphic to the matrix in the CNOT gate generation group and can be implemented by a CNOT gate sequence. The CNOT gate does not change the measurement result when it acts on the trap qubits in the state |0>, which increases the probability of identifying the malicious sender.

[0029] S1.5: If the SQ-TTP receives Acc, it means that the message transmission path between P k-1 and P k is secure. P k continues to send the remaining quantum state to P k+1 , and continues to transmit the message according to step S1.4. If the SQ-TTP receives Rej, it means that the message transmission path between P k-1 and P k is not secure, i.e., at least one of P k-1 and P k is a malicious participant. At this time, the SQ-TTP deletes the connection between P k-1 and P k in graph G, and broadcasts the message (abort, P k-1 , P k ). When k = l-1, the last participant P k sends the quantum state to the SQ-TTP after message authentication. k However, since the SQ-TTP only has the ability of quantum measurement, it cannot decrypt the quantum state δ k by performing the unitary operator and then measuring the trap register for message authentication. In order to ensure that the SQ-TTP can predict the measurement result of the trap register without decrypting the quantum state, the in the unitary operator sent by the SQ-TTP to the last participant P needs to be limited to a combination of Pauli X gate and Pauli Z gate, specifically U(1,0,0,0 ) = X 0 Z 0 = I, U( 0,1,0,0 ) = X 0 Z 1 , U (0,0,1,0 ) = X 1 Z 1 and U (0,0,0,1) = X 1 Z 0 Four forms. SQ-TTP directly measures the second trap register when authenticating the message δ k sent by P k , and if the trap qubit has acted the Pauli X gate, the correct measurement result should be 1, and the rest should be 0. SQ-TTP authenticates the quantum state δ k sent by the last participant P k according to the consistency of the actual measurement result and the predicted measurement result.

[0030] S1.6: If the graph G becomes disconnected, two subgraphs will be formed. Since the SQ-TTP is trusted and the message transmission between the honest participants is considered secure, all the participants connected to the SQ-TTP in the graph G are honest participants, which constitute a set H. Then the SQ-TTP broadcasts a message (abort, H) and terminates the quantum message transmission.

[0031] S1.7: The SQ-TTP determines whether to end the screening according to the number of screened honest participants |H|. If |H|≥p, the SQ-TTP outputs the honest participant set H and completes the screening phase. Otherwise, the SQ-TTP dynamically adjusts the grouping parameters according to the current number of remaining participants (H-r), updates the number of participants in each group to q', and continues to screen the honest participants according to steps S1.

[0032] S2: Parallel transmission of quantum messages by each group. The SQ-TTP specifies the honest participants in the set H as the receiver of each group, and all groups can transmit quantum messages in parallel, while the participants in the group transmit messages to the receiver designated by the SQ-TTP in the group according to similar steps S1.1-S1.6, except that the SQ-TTP does not need to limit the construction of the unitary operator sent to the last participant. After the transmission in the group is completed, the designated receiver of each group has all the encrypted messages transmitted by the participants in the group. Figure 2 The overall quantum circuit schematic diagram composed of the operations performed by the three participants on the transmission path in the embodiment of the application is given, assuming that the three participants on the transmission path are P1, P2 and P3, and the quantum message |φ> 11 is sent from P1 to P3 through P2, and the transmission process is described as follows:

[0033] (1) P1 receives the quantum state from SQ-TTP and applies the operator 11 and sends it to P2. Here, the 3t trap qubits are stored in three trap quantum registers T1, T2 and T3, respectively, and each register contains t trap qubits.

[0034] (2) After receiving the quantum state, P2 applies the operator

[0035] (3) Similarly, after receiving the quantum state, P3 applies the operator

[0036] S3: SQ-TTP and the receivers of each group transmit the received messages to the server. After the operations in S1 and S2, SQ-TTP holds the quantum messages of all participants in the set H, and the receivers of each group hold the quantum messages of all participants in the group, and the quantum state they hold is Since SQ-TTP and the receivers of each group are honest participants, they can directly perform single-channel quantum message authentication with the server. After receiving the quantum state, the server decrypts it by applying the unitary operator

[0037] ​​​​​​​Through the above steps, the application realizes a dynamic quantum message authentication method capable of identifying suspension. First, a semi-quantum trusted third party SQ-TTP groups the participants in the network and performs quantum message transmission with part of the participants. Then, the SQ-TTP screens out honest participants according to the message authentication result and ensures that the number of honest participants is not less than the number of groups. Then, the SQ-TTP assigns the screened honest participants as the receivers of each group, each group can be transmitted in parallel, and the participants in the group use a similar quantum message transmission method as in the screening of honest participants stage to complete their own quantum message transmission. After the transmission is completed, the SQ-TTP and the receivers of each group transmit the quantum messages held to the server, thereby completing the message transmission of the entire quantum communication network. The application is suitable for large-scale quantum communication networks, and the dynamic grouping and parallel transmission mode reduces quantum resources while improving the efficiency of quantum message transmission, and external personnel can also identify the identity of malicious participants, thereby further promoting the practical process of quantum message authentication technology.

[0038] The above-described embodiments are only used to illustrate the principles, features and advantages of the present application, and are not intended to limit the scope of the present application. Those skilled in the art can make various modifications, equivalent replacements or improvements to the present application without departing from the design ideas provided by the present application, and these should be considered to fall within the protection scope of the present application.

Claims

1. A dynamic quantum message authentication method with abortability recognition, characterized in that, The method comprises the following three stages: S1: The semi-quantum trusted third-party SQ-TTP screens honest participants. The SQ-TTP only possesses quantum measurement capabilities and cannot authenticate messages by decrypting the quantum state using quaternion unitary operators and then measuring the trap register. The SQ-TTP determines the number of groups based on the current number of participants and the system's preset number of participants per group. Subsequently, the SQ-TTP randomly selects some participants to form a small quantum communication network and initializes the honest participant set. This network consists of a complete graph. The network represents participants and edges represent secure channels. Participants encode quantum messages using quantum error correction codes (CSS) and then encrypt the quantum messages and trap qubits using quaternion unitary operators. They then send the qubits one by one to SQ-TTP along the transmission path specified by SQ-TTP. Participants on the transmission path authenticate messages by measuring trap qubits and report the authentication results back to SQ-TTP. SQ-TTP adjusts the graph according to the feedback results connectivity and broadcast a message identifying the abort; At the end of the transmission path, the SQ-TTP can directly measure the trap qubits to complete message authentication without decrypting the quantum state by limiting the form of the last participating party's unitary operator; The SQ-TTP screens out honest participating parties according to the message authentication result and ensures that the number of the honest participating parties is not less than the number of groups; S2: each group parallel transmission quantum message stage, SQ-TTP specifies the screened honest participants as the receiver of each group, all groups can transmit quantum messages in parallel, and the participants in the group use a similar quantum message transmission method as in step S1, that is, combining the complete graph , CSS encoding, quaternion unit encryption and trap quantum bit to realize identifiable aborted message authentication, complete their quantum message transmission; S3: The SQ-TTP and each group receiver transmit the received messages to the server stage, the server decrypts the received messages by using the quaternion unitary operator sent by the SQ-TTP, then measures the trap qubits, and authenticates the messages according to the measurement result.

2. The abort-identifiable dynamic quantum message authentication method of claim 1, wherein, The SQ-TTP screening honest participating parties stage in step S1: SQ-TTP is based on the current number of participants. and the number of participants in each group preset by the system. Determine the number of groups Ensure that the number of participants in each group is [number missing]. Subsequently, SQ-TTP randomly selected The participating parties together form a group that includes A small quantum communication network with 100 nodes, in which SQ-TTP initialization has A complete graph with nodes and the set of honest participants ,picture In this context, nodes represent participants in the network, and the connections between nodes indicate that the transmission channels between participants are secure; the participants in the network... Quantum messages Encoded using quantum error correction codes (CSS) A quantum state consisting of qubits ,in , And send each encoded qubit to SQ-TTP according to the following steps; S1.1: SQ-TTP according to the diagram Calculate a line from the participating parties Transmission path to SQ-TTP And broadcast it; the length of the path is... Define path The participants are ,Right now Representing the sender , Representative path The participants in the sequential transmission, SQ-TTP represents the final recipient; S1.2: SQ-TTP generates a random vector as a key wherein is the number of trap registers, which is equal to the length of the path, is the number of qubits in each trap register; each random vector is of the form and satisfies the normalization condition ; the operator , and denote the vector The algebraic form of the corresponding quaternion is The matrix form is The inverse of the quaternion is denoted by The corresponding matrix form is and satisfies ; During the transmission of the message, each participant uses The quantum message is encrypted using The received quantum state is decrypted; S1.3: The SQ-TTP applies the quaternion unitary operator to the encoded quantum message ; ; to the encoded quantum message ; and encoded quantum message ; to obtain an encrypted quantum state ; to the next node on the transmission path ; S1.4: SQ-TTP Random Generation Unitary Operator Send it to ,in Acting on A trap qubit, Refers to the domain All The general linear group consisting of invertible matrices of order n. This can be achieved using CNOT gate sequences. Acting on the front One quantum bit, Acting on the front One qubit; then Will Acting on quantum state Above and measure the first The qubits in the trap quantum register; if the measurement result is all 0, then Send the authentication identifier Acc to SQ-TTP, otherwise send the rejection identifier Rej; S1.5: If SQ-TTP receives Acc, then continues to transmit the measured residual quantum state to and proceeds with step S1.4; if SQ-TTP receives Rej, then SQ-TTP deletes the link between and in graph and broadcasts a message (abort, , ); when , the last participant sends to SQ-TTP the quantum state after message authentication; however, since SQ-TTP only has the ability of quantum measurement, it cannot decrypt the quantum state after performing the unitary operator and then measuring the trap register to perform message authentication; in order to ensure that SQ-TTP can predict the measurement result of the trap register without decrypting the quantum state, the in the unitary operator sent to the last participant needs to be limited to a combination of Pauli X gate and Pauli Z gate, specifically in four forms: , , and . The SQ-TTP authenticates the message sent by The second trap register is measured directly when the message is sent If the trap qubit has applied the Pauli X gate, the correct measurement result should be 1, and otherwise, it should be 0; the SQ-TTP authenticates the quantum state sent by the last participant according to the consistency of the actual measurement result and the predicted measurement result ;​ S1.6: If the graph becomes disconnected, the set of honest parties connected to SQ-TTP ; the message (abort, ) is then broadcast by SQ-TTP and the transmission of quantum messages is terminated; S1.7: The SQ-TTP decides whether to end the screening according to the number of honest participants screened out If , the SQ-TTP outputs the set of honest participants , and the screening phase is completed; otherwise, the SQ-TTP dynamically adjusts the grouping parameters according to the current number of remaining participants , updates the number of participants in each group to , and continues to screen honest participants according to step S1.

3. The abort-identifiable dynamic quantum message authentication method of claim 1, wherein, The parallel transmission of quantum messages by each group in step S2: SQ-TTP designated set As the receiver of each group, all groups can transmit quantum messages in parallel, while the participants in the group transmit messages to the receiver designated by the SQ-TTP in the group according to similar steps S1.1-S1.6, except that the SQ-TTP does not need to restrict the construction of the unitary operator sent to the last participant . After the transmission in the group is completed, the designated receiver of each group has all the encrypted messages transmitted by all the participating parties in the group.

4. The abort-identifiable dynamic quantum message authentication method of claim 1, wherein, The SQ-TTP and each group receiver transmit the received messages to the server stage in step S3: After the operation of the two phases S1 and S2, the SQ-TTP holds the quantum messages of all the participants in the set , the receivers of each subgroup hold the quantum messages of all the participants in the subgroup, and the form of the quantum states they hold is ; since the SQ-TTP and the receivers of each subgroup are honest participants, they can directly perform single-channel quantum message authentication with the server; when the server receives the quantum state, he decrypts the quantum state by the unitary operator sent by the SQ-TTP; then the server measures the last trap qubits, and if the measurement results are all 0, the authentication is passed, otherwise the authentication fails.

Images