A quantum identity authentication method and system based on a quantum homomorphic encryption framework

Abstract

This invention discloses a quantum identity authentication method and system based on a quantum homomorphic encryption framework, comprising: a preprocessing stage S1, where the authenticator selects a matrix composed of classical angles as initialization parameters based on known authentication credentials; an authentication request stage S2, where the authenticator uses quantum rotation technology to encrypt the quantum state authentication request using a quantum homomorphic encryption framework and sends it to the authenticated party; a homomorphic operation and response stage S3, where the authenticated party receives the quantum state authentication request, processes it using quantum operations based on the homomorphic properties of its authentication credentials, and sends a response to the authentication request to the authenticator; and an authentication detection stage S4, where the authenticator receives the response to the authentication request and, based on the settings in the preprocessing and its knowledge of the authentication credentials, checks the quantum state response of the authenticated party. This invention offers high security and flexibility, does not cause any resource burden or waste in integrated communication systems, and exhibits good communication efficiency.

Description

Technical Field

[0001] This invention relates to the field of quantum communication technology, and specifically to a quantum identity authentication method and system based on a quantum homomorphic encryption framework. Background Technology

[0002] Delegated quantum computing is a crucial application in the cloud service era. As data leaves the user's domain, data and identity security issues inevitably arise. Encryption methods can be used to protect data, while a composite system known as quantum public-key infrastructure (QP) can be used to protect identity. Quantum identity authentication is a vital component of QP, ensuring that quantum communication protocols and networks do not completely collapse. However, because quantum identity authentication is only an auxiliary function, it cannot consume excessive quantum resources. Therefore, an ideal identity authentication method should use the same quantum channels and encoded quantum states as the main process. An efficient identity authentication method should also rely on as little pre-shared information as possible.

[0003] The basic paradigm of identity authentication is as follows: It is assumed that the authenticator and the authenticated party share a public secret string beforehand, and then quantum methods are used to verify the extent to which both parties understand this string. Crépeau et al. proposed the first authentication method using quantum resources in 1995 (C. Crépeau and L. Salvail, “Quantum oblivious mutual identification,” in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 1995) pp. 133–146.). Zeng et al. proposed a method that simultaneously performs quantum key distribution and identity authentication, achieving efficient utilization of quantum resources (G. Zeng and X. Wang, “Quantum key distribution with authentication,” arXiv preprintquant-ph / 9812022 (1998).). Subsequently, some two-party authentication methods have used quantum entanglement as a communication resource (e.g., N. Zhou, G. Zeng, W. Zeng, and F. Zhu, “Cross-center quantum identification scheme based on teleportation and entanglements wapping,” Optics communications 254, 380–388 (2005); and S. Zhang, Z.-K. Chen, R.-H. Shi, and F.-Y. Liang, “A novel quantum identity authentication based on bell states,” International Journal of Theoretical Physics 59, 236–249 (2020).). The method using Bell states and GHZ states can achieve highly secure authentication, but there are significant challenges in its physical implementation, which has hindered its widespread application.Some studies have also focused on continuous variable protocols (e.g., P. Huang, J. Zhu, Y. Lu, and G.-H. Zeng, “Quantum identity authentication using gaussian-modulated squeezed states,” International Journal of Quantum Information 9, 701–721 (2011); and H. Ma, P. Huang, W. Bao, and G. Zeng, “Continuous-variable quantum identity authentication based on quantum teleportation,” Quantum Information Processing 15, 2605–2620 (2016)). In 2016, Hayden et al. proposed the principle of combinatorial security, which has guided the design process of many subsequent methods (P. Hayden, D.W. Leung, and D. Mayers, “The universal composable security of quantum message authentication with key recyling,” arXiv preprint arXiv:1610.09434 (2016)). Combinatorial security indicates that when multiple encryption methods work together, the overall security of the system is less than the sum of the security of each method.This concept requires embedding the authentication method into the main process to prevent loss of security. Some QIA protocols have similar properties (e.g., W.-M. Shi, Y.-H. Zhou, and Y.-G. Yang, “Quantum deniable authentication protocol,” Quantum Information Processing 13, 1501–1510 (2014); Q. Li, Z. Li, WHChan, S. Zhang, and C. Liu, “Blind quantum computation with identity authentication,” Physics Letters A382, 938–941 (2018); and B. Liu, Z. Gao, D. Xiao, W. Huang, X. Liu, and B. Xu, “Quantum identity authentication in the orthogonal-state-encoding qkd system,” Quantum Information Processing 18, 1–16 (2019)). In 2017, Hong et al. proposed an efficient authentication method, which can be seen as a transformation of the BB84 protocol (J. Heo, JG Jang, D. Kwon, et al., "Quantum identity authentication with single-photon," Quantum Information Processing 16, 1–20 (2017)). Therefore, utilizing existing quantum cryptography methods to design identity authentication methods is a very practical choice. In summary: Problems with existing technologies:

[0004] (1) Previous quantum entanglement-based identity authentication schemes have encountered technical obstacles in the quantum state preparation stage. Many existing identity authentication methods utilize the entanglement properties of GHZ states or multi-particle entangled states to realize quantum blind signature schemes, which have advantages in efficiency. However, the preparation of entangled states requires a lot of resources and is not easy to prepare under the current technology. This technical obstacle greatly reduces the practicality of such quantum blind signature schemes.

[0005] (2) Previous quantum entanglement-based identity authentication schemes cannot resist entanglement attacks, which can easily lead to the eavesdropping of particles and information leakage.

[0006] (3) In the past, identity authentication schemes that existed independently of the main process would reduce the overall security of the system and bring unpredictable security risks, according to the composability security principle. At the same time, these methods utilized additional resources, increasing the difficulty of quantum preparation and channel setup for the overall system.

[0007] (4) Previous quantum identity authentication methods designed based on quantum key distribution frameworks or quantum public key encryption frameworks have not deviated from the scope of basic quantum cryptography methods. They can only use measurement bases as authentication credentials, lacking flexibility and failing to fundamentally increase authentication complexity to enhance security.

[0008] The difficulty in solving the above-mentioned technical problems lies in the fact that the preparation and storage of GHZ states or multi-particle entangled states are currently very challenging, requiring more expensive equipment and resources than the preparation of single-particle states. To resist entanglement attacks, most methods rely on overall system design to defend against them, and theoretical analysis is used to prove the system's ability to withstand such attacks. Most methods are designed independently of the main process to ensure security; efficient authentication operations can be derived by appropriately modifying the main process. Summary of the Invention

[0009] To address the above problems, this invention proposes a quantum identity authentication method based on a quantum homomorphic encryption framework, comprising:

[0010] In the preprocessing stage S1, the certifier selects a matrix composed of classical angles as initialization parameters based on the known certification credentials.

[0011] In the authentication request phase S2, the authenticator uses quantum rotation technology to encrypt the quantum state authentication request in a quantum homomorphic encryption framework and sends it to the authenticated party.

[0012] In the homomorphic operation and response phase S3, the certified party receives the quantum state authentication request, processes it using quantum operations based on the homomorphic properties of the authentication credentials it holds, and sends the response to the authentication request to the authenticator.

[0013] In the authentication and testing phase S4, the authenticator receives the response to the authentication request and, based on the settings in the preprocessing and its understanding of the authentication credentials, checks the quantum state response of the authenticator.

[0014] Preferably, the preprocessing stage S1 includes the following steps:

[0015] Step S11: The authenticator and the authenticated party share a 2*n matrix K through quantum key distribution. ide As a credential for identity verification, K ide The matrix elements are from the set Independent and dispersed selections within the framework. This means less than or equal to 2.n Let K be a positive integer, and let K be a matrix. ide The element in the i-th row and j-th column is (K ide ) ij ;

[0016] Step S12: The authenticator prepares a string l of length n, and denotes the j-th character as l. j ∈{0,1,2}, K is calculated according to the following rules. i ′ de :

[0017]

[0018]

[0019] The certifier is based on For K i ′ de The classic matrix K is obtained by random partitioning. app and K ver .

[0020] Preferably, the authentication request stage S2 includes the following steps:

[0021] Step S21, the authenticator uses the classical matrix K obtained from preprocessing. app and K ver Combining the ternary quantum rotation expression with the preparation method:

[0022]

[0023] Prepare a quantum state to be used as an authentication request; where θ n1 and θ n2 The input parameters for the three-valued quantum rotation are represented by the formula. and Transform the input parameters, where s1 and s2 are natural numbers less than n-1; in this step, K will be... app Each column of elements is sequentially input into a ternary quantum rotation, and the quantum state output of each column is obtained and denoted as...

[0024] Step S22, output the quantum state The authentication requests are sent sequentially to the authenticated party. Each authentication request is represented as follows:

[0025] Preferably, the homomorphic operation and response phase S3 includes the following steps:

[0026] Step S31, the certified party, based on the K it holds... ide ,implement When it reaches the j-th position, then

[0027] Step S32, the authenticated party sends |Ψ ide (θ n1 ,θ n2 It is sent to the authenticator as a response to the authentication request.

[0028] Preferably, the authentication testing stage S4 includes the following steps:

[0029] Step S41, the authenticator, based on the K held... ver ,Will The response is applied to the j-th bit of the received reply and a measurement is performed.

[0030] Step S42: The authenticator compares the set string l. If the measurement result of the j-th bit is l... j If the authentication is successful, it will pass; otherwise, it will fail.

[0031] Preferably, the measurement and comparison operation in the certification testing stage S4 specifically includes:

[0032] Step S41: The certifying party receives the response from the certifying party and, based on matrix K used for final verification... ver ,effect At the corresponding qubit, the quantum state becomes:

[0033]

[0034] The certifier measures the quantum state using {|0>,|1>,|2>}, as follows:

[0035]

[0036] Step S42: The authenticator compares the measurement result with the set l. If the two match within a certain threshold, the identity authentication is successful; otherwise, it fails. The threshold is set according to the physical scenario and is calculated comprehensively based on real-world factors, including at least quantum channel noise, accuracy of quantum detection and preparation equipment, and quantum error correction scheme, according to the quantum Holevo bound theorem.

[0037] On the other hand, a quantum identity authentication system based on a quantum homomorphic encryption framework includes an authenticator and an authenticated party; the steps for the authenticator and the authenticated party to implement quantum identity authentication based on the quantum homomorphic encryption framework include:

[0038] During the preprocessing stage, the certifier selects a matrix composed of classical angles as initialization parameters based on the known certification credentials.

[0039] During the authentication request phase, the authenticator uses quantum rotation technology to encrypt the quantum state authentication request in a quantum homomorphic encryption framework and sends it to the authenticated party.

[0040] In the homomorphic operation and response phase, the certified party receives the quantum state authentication request, processes it using quantum operations based on the homomorphic properties of the authentication credentials it holds, and sends the response to the authentication request to the authenticator.

[0041] During the certification testing phase, the certifying party receives the response to the certification request and, based on the settings in the preprocessing and its understanding of the certification credentials, examines the quantum state response of the certified party.

[0042] The present invention has the following beneficial effects:

[0043] (1) This invention does not use quantum entanglement, and the quantum resources used can be directly used to construct quantum delegated computing methods, without causing any resource burden or waste in the integrated communication system;

[0044] (2) The credentials used in this invention are not limited to the quantum ground state, but can be extended to any natural number, which fundamentally improves the complexity to enhance security;

[0045] (3) This invention can be regarded as a special quantum homomorphic encryption process, which allows the main process to be regarded as a whole in security analysis, thereby solving the problem of security reduction caused by cooperative work; it can also be directly applied to the authentication process of other quantum rotation-based encryption methods to obtain beneficial changes in security;

[0046] (4) This invention can authenticate two classical credentials with one quantum bit, and performs well in terms of communication efficiency.

[0047] Furthermore, this invention reveals the wide application value of the quantum homomorphic encryption framework in various quantum cryptography scenarios, which can solve many unsolved problems in cryptography scenarios.

[0048] The present invention will be further described in detail below with reference to the accompanying drawings and embodiments, but the present invention is not limited to the embodiments. Attached Figure Description

[0049] Figure 1 This is a flowchart of a quantum identity authentication method based on a quantum homomorphic encryption framework according to an embodiment of the present invention;

[0050] Figure 2 This is a block diagram of a quantum identity authentication system based on a quantum homomorphic encryption framework, according to an embodiment of the present invention.

[0051] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. Detailed Implementation

[0052] See Figure 1 As shown, the present invention provides a quantum identity authentication method based on a quantum homomorphic encryption framework, comprising:

[0053] In the preprocessing stage S1, the certifier selects a matrix composed of classical angles as initialization parameters based on the known certification credentials.

[0054] In the authentication request phase S2, the authenticator uses quantum rotation technology to encrypt the quantum state authentication request in a quantum homomorphic encryption framework and sends it to the authenticated party.

[0055] In the homomorphic operation and response phase S3, the certified party receives the quantum state authentication request, processes it using quantum operations based on the homomorphic properties of the authentication credentials it holds, and sends the response to the authentication request to the authenticator.

[0056] In the authentication and testing phase S4, the authenticator receives the response to the authentication request and, based on the settings in the preprocessing and its understanding of the authentication credentials, checks the quantum state response of the authenticator.

[0057] In this embodiment, the preprocessing stage S1 includes the following steps:

[0058] Step S11: The authenticator and the authenticated party share a 2*n matrix K through quantum key distribution. ide As a credential for identity verification, K ide The matrix elements are from the set Independent and dispersed selections within the framework. This means less than or equal to 2. n Let K be a positive integer, and let K be a matrix. ide The element in the i-th row and j-th column is (K ide ) ij ;

[0059] Step S12: The authenticator prepares a string l of length n, and denotes the j-th character as l. j ∈{0,1,2}, K is calculated according to the following rules. i ′ de :

[0060]

[0061]

[0062] The certifier is based on For K i ′ de The classic matrix K is obtained by random partitioning. app and K ver .

[0063] In this embodiment, the authentication request stage S2 includes the following steps:

[0064] Step S21, the authenticator uses the classical matrix K obtained from preprocessing. app and K ver Combining the ternary quantum rotation expression with the preparation method:

[0065]

[0066] Prepare a quantum state to be used as an authentication request; where θ n1 and θ n2 The input parameters for the three-valued quantum rotation are represented by the formula. and Transform the input parameters, where s1 and s2 are natural numbers less than n-1; in this step, K will be... app Each column of elements is sequentially input into a ternary quantum rotation, and the quantum state output of each column is obtained and denoted as...

[0067] Step S22, output the quantum state The authentication requests are sent sequentially to the authenticated party. Each authentication request is represented as follows:

[0068] In this embodiment, the homomorphic operation and response phase S3 includes the following steps:

[0069] Step S31, the certified party, based on the K it holds... ide ,implement When it reaches the j-th position, then

[0070] Step S32, the authenticated party sends |Ψ ide (θ n1 ,θ n2 It is sent to the authenticator as a response to the authentication request.

[0071] In this embodiment, the authentication detection stage S4 includes the following steps:

[0072] Step S41, the authenticator, based on the K held... ver ,Will The response is applied to the j-th bit of the received reply and a measurement is performed.

[0073] Step S42: The authenticator compares the set string l. If the measurement result of the j-th bit is l... j If the authentication is successful, it will pass; otherwise, it will fail.

[0074] In this embodiment, the measurement and comparison operation in the authentication detection stage S4 is specifically as follows:

[0075] Step S41: The certifying party receives the response from the certifying party and, based on matrix K used for final verification... ver ,effect At the corresponding qubit, the quantum state becomes:

[0076]

[0077] The certifier measures the quantum state using {|0>,|1>,|2>}, as follows:

[0078]

[0079] Step S42: The authenticator compares the measurement result with the set l. If the two match within a certain threshold, the identity authentication is successful; otherwise, it fails. The threshold is set according to the physical scenario and is calculated comprehensively based on real-world factors, including at least quantum channel noise, accuracy of quantum detection and preparation equipment, and quantum error correction scheme, according to the quantum Holevo bound theorem.

[0080] See Figure 2 As shown, a quantum identity authentication system based on a quantum homomorphic encryption framework includes an authenticator 1 and an authenticated party 2; the steps for the authenticator 1 and the authenticated party 2 to implement quantum identity authentication based on the quantum homomorphic encryption framework include:

[0081] During the preprocessing stage, authenticator 1 selects a matrix composed of classical angles as initialization parameters based on the known authentication credentials.

[0082] During the authentication request phase, authenticator 1 uses quantum rotation technology to encrypt the quantum state authentication request in a quantum homomorphic encryption framework and sends it to authenticatee 2;

[0083] In the homomorphic operation and response phase, the certified party 2 receives the quantum state authentication request, processes it using quantum operations based on the homomorphic properties of the authentication credentials it holds, and sends the response to the authentication request to the authenticator 1;

[0084] During the authentication and testing phase, authenticator 1 receives the response to the authentication request and, based on the settings in the preprocessing and its understanding of the authentication credentials, checks the quantum state response of authenticator 2.

[0085] A specific implementation of a quantum identity authentication system based on a quantum homomorphic encryption framework is described in this embodiment, and the same quantum identity authentication method based on a quantum homomorphic encryption framework will not be described again in this embodiment.

[0086] As can be seen, the quantum identity authentication method and system proposed in this invention, based on a quantum homomorphic encryption framework, focuses on the efficiency and security issues in quantum identity authentication. This invention uses quantum rotation parameters as authentication credentials and leverages quantum rotation properties and a quantum homomorphic encryption framework as authentication methods. Security stems from the security of the high-dimensional quantum homomorphic encryption scheme and the complexity of using quantum states, while high efficiency arises from the excellent information-carrying capacity of quantum rotation. The beneficial effects of this invention will be elaborated in detail below from the aspects of method security and method efficiency.

[0087] 1. Method safety

[0088] In the security analysis, the low-order method of this invention is mainly considered, that is, using As the core of the method, all quantum states used in the method degenerate from ternary to binary. If the low-order method is secure, then this invention, as a dimensional extension, must also be secure.

[0089] First, consider a direct attack. An attacker on the channel would launch an impersonation attack, attempting to forge the identity of the party being authenticated. This is because the attacker is unaware of the shared authentication credential k between the two parties. ide Therefore, only random quantum rotation operations can be performed on the authentication request. When the authentication sequence length is m bits, the probability of a direct attack being detected is...

[0090] p(d n )=1-p(d) n =1 - 1 / 2 n

[0091] When k ide Given enough time, Eve needs to face p(d) m →1; that is, the attack is almost certain to be detected. In the method described in this invention, this probability increases much faster than in lower-order methods. Furthermore, the authentication sequence length n does not affect the measurement probability of a single qubit, but it does affect the attack's ability to obtain k. ide The difficulty increases with the size of n, which affects the value of k. ide The better the protection, the better. Attackers can directly guess k. ide equivalent to in Choose a positive integer with a probability of In the method proposed in this invention, both independent parameters can achieve the purpose of protecting the security of quantum states, and the resistance to attacks is increased exponentially.

[0092] Next, we consider known-plaintext attacks. Known-plaintext attacks (KAP) and forward search attacks (FSA) both infer the plaintext by comparing the quantum states before and after encryption using two quantum gates (such as SWAP gates), posing a significant threat to a large class of quantum public-key methods. Previous work has shown that quadratic coding or probabilistic encryption can resist these attacks, but at the cost of reduced efficiency.

[0093] Without modifications, low-order methods can effectively resist the aforementioned attacks. This is because the plaintext of the authentication process is the parameter of the qubit rotation, i.e. sθ n The plaintext cannot be gleaned through quantum state comparison. Even if special quantum circuits can precisely distinguish quantum states, they cannot precisely determine the quantum state structure to infer parameters. In some special parameter cases, such as k... ide =0 and k app When = 0, some quantum information can be obtained through comparison, but this is limited to obtaining the information randomly set by the authenticator. i Therefore, it cannot pose a real security threat. In the method settings, k ide The choice is The top is evenly distributed, while and The settings are random. Therefore, cases with specific parameters do not occur frequently. The qubit rotation function in the high-dimensional method proposed in this invention can further enhance resistance to FSA and KPA because high-dimensional quantum rotation further increases the difficulty of discriminating quantum states and reduces the amount of key information that can be obtained.

[0094] Finally, we analyze two types of measurement-retransmission attacks. To obtain the authentication key, attackers intercept quantum states on the channel and measure them to extract information, or tamper with them to obtain useful information such as authentication credentials by modifying them to specific known quantum states. In the first type of interception attack, the attacker obtains the key by intercepting the state. or And measure it. There are some mutually orthogonal states among these quantum states, namely... and Even so, attackers cannot definitively obtain the quantum state through measurement because It is uncertain; it can only be determined from... and The quantum state is randomly selected from a large number of measurement bases. Because the quantum state changes during each authentication, an attacker cannot obtain enough identical quantum states to perform specialized measurements such as quantum tomography. For the attacker, a successful attack yields... We need to obtain the parameters from the authentication request and the parameters from the response process. and In the final step of the authentication process, the authenticator needs to detect potential attacks on the channel. Considering practical factors such as channel noise, if the detection result exceeds a certain threshold, the authenticator can immediately declare the current authentication insecure. In the high-order method proposed in this invention, the security of the method is exponentially enhanced in all the above cases. Therefore, it is virtually impossible for an attacker to secretly obtain authentication credentials without being detected.

[0095] In another type of intercept-retransmission attack, the attacker tampers with the authentication request and transforms it into a series of known quantum states to obtain the k-th quantum state of the authenticated party. ide For example, an attacker might change the authentication request to... Even so, attackers still face the challenge of dealing with unknown quantum states. The challenge lies in extracting quantum rotation parameters. This attack also directly tampers with the authentication settings. i The disturbances caused by the attack are easily detected during the detection phase. The probability of detection is equal to the probability that the attacker will launch a direct forgery attack, i.e. Another possible attack is that the attacker saves... This quantum state is then used in subsequent tests to deceive the authenticator. The main difficulty of this attack is the need to preserve the quantum state over a long period and extract it from the authentication request. To construct a correct response.

[0096] In summary, low-order methods exhibit good resistance to direct attacks, KPA, and measurement-retry attacks. As an extension of this approach, the high-order methods proposed in this invention can further enhance the security of the authentication process.

[0097] 2. Method efficiency

[0098] In terms of efficiency, the method proposed in this invention achieves high authentication efficiency by allowing one quantum bit to verify the information of two classical bits. Although the high security of the method primarily stems from (K... ide ) ij The selection can be arbitrary within a wide range, but this setting does not affect efficiency because the classical selection process does not inherently affect the complexity of quantum operations. The authenticator only needs to complete a series of classical calculations to set up the authentication request. In the final stage, the authenticator only needs to perform simple measurements to intuitively obtain the detection result. The method requires that the authenticated party must have the same ability as the authenticator to perform qubit rotation operations with arbitrary parameters, which can be easily implemented in user networks.

[0099] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A quantum identity authentication method based on a quantum homomorphic encryption framework, characterized in that, Comprise: A preprocessing stage S1, the authenticator selects a matrix composed of classical angles as an initialization parameter according to known authentication credentials; An authentication request stage S2, the authenticator encrypts a quantum state authentication request in a quantum homomorphic encryption framework and sends it to the authenticated party using quantum rotation technology; A homomorphic operation and reply stage S3, the authenticated party receives the quantum state authentication request, processes it using quantum operations according to the homomorphic characteristics of the held authentication credentials, and sends a reply to the authentication request to the authenticator; An authentication detection stage S4, the authenticator receives the reply to the authentication request, checks the quantum state reply of the authenticated party according to the settings in the preprocessing combined with the understanding of the authentication credentials; The preprocessing stage S1 comprises the following steps: Step S11, the authentication party and the authenticated party share a 2*n order matrix K through quantum key distribution ide As an identity authentication credential, K ide The matrix elements are independently and randomly selected from the set Indicates a positive integer less than or equal to 2 n The matrix K ide The element in the i-th row and the j-th column is (K ide ) ij ;​ Step S12, the authentication party prepares a string l of length n, and let the jth bit be l j K' is calculated according to the following rules ide : The authentication party according to K' is obtained by performing a random split on K ide app and K ver ;​ The authentication request stage S2 comprises the following steps: Step S21, the authentication party obtains the classical matrix K according to the preprocessing app and K ver , combined with the expression of three-value quantum rotation and the preparation method: preparing a quantum state to be used as an authentication request; wherein, θ n1 and θ n2 denote input parameters of a ternary quantum rotation according to the formula and transforming the input parameters, wherein s1 and s2 belong to natural numbers smaller than n-1; K app Each column element in K Step S22, the output quantum state The authentication request is sent to the authenticated party as an authentication request in sequence, and the authentication request is expressed as: The homomorphic operation and reply stage S3 comprises the following steps: Step S31, the authenticated party generates a random number K ide , executes to the jth bit, then Step S32, the authenticated party sends |Ψ ide (θ n1 ,θ n2 ) as a reply to the authentication request to the authenticating party; The authentication detection stage S4 comprises the following steps: Step S41, the authentication party calculates the hash value of the received K ver , the authentication party calculates the hash value of the received K acts on the received jth reply and performs the measurement; Step S42, the authentication party compares the set string l, if the jth bit of the measurement result is l j then the authentication is passed, otherwise not.

2. The quantum identity authentication method based on a quantum homomorphic encryption framework according to claim 1, the measurement and comparison operation of the authentication detection stage S4 is specifically: Step S41, the authentication party receives the reply from the party to be authenticated, and according to the matrix K for final verification ver , the action to the corresponding qubits, at this time the quantum state becomes: The authenticator measures the quantum state using {|0>, |1>, |2>}, as follows: Step S42, the authenticator compares the measurement result with the set l, and if they agree within a certain threshold, the identity authentication is successful, otherwise it fails; The threshold is set according to the physical scene, combined with at least including quantum channel noise, quantum detection and preparation equipment accuracy, quantum error correction scheme in the real factors, according to the quantum Holevo bound theorem to get comprehensive calculation.

3. A quantum identity authentication system based on a quantum homomorphic encryption framework, characterized by, Comprise an authenticator and an authenticated party; The authenticator and the authenticated party implement the quantum identity authentication method based on a quantum homomorphic encryption framework according to any one of claims 1-2, comprising: A preprocessing stage, the authenticator selects a matrix composed of classical angles as an initialization parameter according to known authentication credentials; An authentication request stage, the authenticator encrypts a quantum state authentication request in a quantum homomorphic encryption framework and sends it to the authenticated party using quantum rotation technology; A homomorphic operation and reply stage, the authenticated party receives the quantum state authentication request, processes it using quantum operations according to the homomorphic characteristics of the held authentication credentials, and sends a reply to the authentication request to the authenticator; An authentication detection stage, the authenticator receives the reply to the authentication request, checks the quantum state reply of the authenticated party according to the settings in the preprocessing combined with the understanding of the authentication credentials.

Images