User information authentication methods, devices, equipment, media, and program products

By generating a user-input private key and using an elliptic curve finite cyclic group to generate a test task proof result, the problem of information leakage in existing user information authentication is solved, and secure user information authentication is achieved.

CN121037058BActive Publication Date: 2026-11-17CHINA MOBILE INTERNET CO LTD +1
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202511197769.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-08-26
Publication Date
2026-11-17
Estimated Expiration
2045-08-26

AI Technical Summary

Technical Problem

Existing user information authentication methods pose a risk of authentication information leakage. In particular, password-based and biometric authentication methods require the transmission of keys over the network, and verification code-based authentication methods rely on third-party transmissions and are easily intercepted.

Method used

The system generates a private key for the user based on the key input of the user, and uses elliptic curve finite cyclic groups and zero-knowledge proofs to generate the proof result of the trial task. User information authentication is performed through the interaction between the user and the server, avoiding key transmission and third-party dependencies.

Benefits of technology

It significantly reduces the risk of authentication information leakage, enables user information authentication without transmitting key information, and improves authentication security and privacy protection.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121037058B_ABST
    Figure CN121037058B_ABST
Patent Text Reader

Abstract

This invention discloses a user information authentication method, apparatus, device, medium, and program product. The method, executed by the user terminal, includes: upon receiving a probe task instruction information from the server, generating a user-input private key based on the user's input key; wherein the probe task instruction information is used to indicate the feedback of the probe task proof result for user identity verification; generating the probe task proof result based on the probe task instruction information, the user-input private key, several random numbers, and generator parameters in a preset elliptic curve finite cyclic group; and feeding back the random numbers and the probe task proof result to the server to instruct the server to perform user information authentication. This invention utilizes the user-input private key generated based on the user's key to generate the probe task proof result, enabling user information authentication based on zero-knowledge proofs. This significantly reduces the risk of authentication information leakage by eliminating the need for transmitting key information and requiring no third-party information transmission.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of information security technology, and in particular to a user information authentication method, apparatus, electronic device, computer-readable storage medium, and computer program product. Background Technology

[0002] With the continuous development of the information and network era, identity authentication has become crucial. Identity authentication not only ensures network security but also effectively protects personal privacy. Current authentication methods for user information typically include password-based authentication, biometric authentication, and CAPTCHA authentication. However, password-based and biometric authentication methods usually require the transmission of keys over the network during the initial interaction, posing a risk of authentication information leakage. CAPTCHA authentication relies on third-party transmission, making it equally susceptible to authentication information leakage due to SMS interception. Summary of the Invention

[0003] This invention provides a user information authentication method, apparatus, device, medium, and program product to solve the technical problem of the risk of authentication information leakage in existing user information authentication methods.

[0004] To address the aforementioned technical problems, a first aspect of this invention provides a user information authentication method, the method being executed by a user terminal, comprising:

[0005] When a probe task instruction message is received from the server, a user-side private key is generated based on the key input by the user; wherein, the probe task instruction message is used to indicate the probe task proof result used for user identity verification.

[0006] The test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group.

[0007] The random number and the test task proof result are fed back to the server to instruct the server to perform user information authentication based on the random number and the test task proof result.

[0008] As a preferred embodiment, the step of generating a client-side private key based on the user-input key specifically includes:

[0009] Based on the key and a randomly generated salt value, a digest algorithm is used to generate a data digest corresponding to the key, and the data digest is used as the user's private key.

[0010] As a preferred embodiment, the step of generating a data digest corresponding to the key using a digest algorithm based on the key and a randomly generated salt value specifically includes:

[0011] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0012] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0013] The data is compressed in a cyclic manner by grouping several of the data sets to generate the data digest.

[0014] As a preferred embodiment, generating the test task proof result based on the test task instruction information, the user-side private key, several random numbers, and preset generator parameters in an elliptic curve finite cyclic group specifically includes:

[0015] Based on the number of trial task values ​​contained in the trial task instruction information, several random numbers are randomly generated; wherein, the trial task values ​​are randomly generated by the server.

[0016] The product of each of the test task values ​​and the user's private key and the product of each of the random numbers and the generator parameter are summed to obtain several test task proof values.

[0017] Based on several of the test task proof values, the test task proof result is generated.

[0018] As a preferred embodiment, the probe task indication information further includes a probe task digital signature composed of digital signatures of the values ​​of each probe task;

[0019] Before generating the proof result of the trial task based on the trial task instruction information, the user-end private key, several random numbers, and preset generator parameters in the elliptic curve finite cyclic group, the method further includes:

[0020] Obtain the server-side public key generated by the server.

[0021] The server-side public key is used to verify the digital signature of the probe task, and several probe task verification values ​​are obtained.

[0022] When each of the proposed task values ​​matches the proposed task verification value, the proposed task value is determined to have passed verification.

[0023] The step of generating the test task proof result based on the test task instruction information, the user's private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group is as follows:

[0024] When the test task value passes verification, the test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters.

[0025] As a preferred embodiment, the method further includes:

[0026] Generate a user-side public key based on the user-side private key and the generation meta-parameters;

[0027] The test task proof result is signed using the user's private key to obtain a digital signature of the test task proof;

[0028] The user's public key and the digital signature of the probe task proof are sent to the server so that the server can verify the digital signature of the probe task proof based on the user's public key.

[0029] As a preferred embodiment, the method further includes:

[0030] When the client private key and the client public key are generated, the current salt value, the client public key, and the client identifier are sent to the server for storage.

[0031] A second aspect of this invention provides a user information authentication method, the method being executed by a server, comprising:

[0032] Send a test task instruction message to the user terminal; wherein, the test task instruction message includes at least a number of randomly generated test task values, and the test task instruction message is used to instruct the user terminal to provide the test task proof result for user identity verification;

[0033] When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result.

[0034] As a preferred embodiment, the user information authentication based on the random number and the test task proof result specifically includes:

[0035] Based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group, the first test task comparison parameters are generated.

[0036] The second trial task comparison parameters are generated based on the random number, the trial task value, the user-side private key, and the generator meta-parameters; wherein, the user-side private key is generated using a digest algorithm based on the currently stored user-side key and salt value;

[0037] When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, it is determined that the user terminal has passed the user information authentication.

[0038] As a preferred embodiment, the method specifically generates the user-side private key through the following steps:

[0039] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0040] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0041] The grouped data is compressed in a cyclic manner to generate a data digest, and the data digest is used as the private key of the user terminal.

[0042] As a preferred embodiment, the test task proof result includes several test task proof values; the test task proof value is generated by the user terminal based on the test task value, the user terminal private key, the random number, and the generator parameters in the preset elliptic curve finite cyclic group.

[0043] The method further includes:

[0044] When the client receives the client's public key and the digital signature of the test task proof sent by the client, the client uses the public key to verify the digital signature of the test task proof and obtains several test task proof verification values.

[0045] When the proof value of each of the trial tasks is consistent with the verification value of each of the trial tasks, the proof result of the trial task is determined to have passed the verification.

[0046] When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result, specifically as follows:

[0047] When the test task proof result and the random number are received, and the test task proof result passes verification, user information authentication is performed based on the random number and the test task proof result.

[0048] As a preferred embodiment, the method further includes:

[0049] Generate a server-side private key; wherein, the server-side private key is a random number with a preset data length;

[0050] Based on the server-side private key and the generator parameters in the preset elliptic curve finite cyclic group, a server-side public key is generated and disclosed to the user terminal.

[0051] The server-side private key is used to sign each of the probe task values ​​to obtain a probe task digital signature.

[0052] Based on the digital signature of the probing task and the values ​​of each probing task, the probing task indication information is generated; wherein, the server-side public key is used to verify the digital signature of the probing task.

[0053] A third aspect of the present invention provides a user information authentication device, comprising:

[0054] The user-side private key generation module is used to generate a user-side private key based on the key input by the user when it receives a probe task instruction information sent by the server; wherein, the probe task instruction information is used to indicate the probe task proof result used for user identity verification.

[0055] The test task proof result generation module is used to generate the test task proof result based on the test task instruction information, the user terminal private key, several random numbers and the generator parameters in the preset elliptic curve finite cyclic group.

[0056] The trial task verification result feedback module is used to feed back the random number and the trial task verification result to the server, so as to instruct the server to perform user information authentication based on the random number and the trial task verification result.

[0057] A fourth aspect of the present invention provides a user information authentication device, comprising:

[0058] The trial task instruction information sending module is used to send trial task instruction information to the user terminal; wherein, the trial task instruction information includes at least a number of randomly generated trial task values, and the trial task instruction information is used to instruct the user terminal to provide the trial task proof result for user identity verification.

[0059] The user information authentication module is used to perform user information authentication based on the random numbers and the test task proof result when it receives the test task proof result from the user terminal and several random numbers used to generate the test task proof result.

[0060] A fifth aspect of the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the user information authentication method according to any one of the first aspects, or implements the user information authentication method according to any one of the second aspects.

[0061] A sixth aspect of the present invention provides a computer-readable storage medium comprising a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the user information authentication method according to any one of the first aspects, or to implement the user information authentication method according to any one of the second aspects.

[0062] A seventh aspect of the present invention provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the user information authentication method according to any one of the first aspects, or implements the user information authentication method according to any one of the second aspects.

[0063] Compared with the prior art, the beneficial effect of the embodiments of the present invention is that by using the user-end private key generated based on the user input key to generate the test task proof result, and performing user information authentication based on zero-knowledge proof, user information authentication can be completed without transmitting key information and without the need for third-party information transmission, which significantly reduces the risk of authentication information leakage. Attached Figure Description

[0064] Figure 1 This is a flowchart illustrating the user information authentication method executed by the user terminal in an embodiment of the present invention;

[0065] Figure 2 This is a schematic diagram of grouped cyclic compression in an embodiment of the present invention;

[0066] Figure 3 This is a flowchart illustrating the user information authentication method executed by the server in an embodiment of the present invention;

[0067] Figure 4 This is a schematic diagram of the user information authentication process in an embodiment of the present invention;

[0068] Figure 5 This is a schematic diagram of the user information authentication device for the user terminal in an embodiment of the present invention;

[0069] Figure 6 This is a schematic diagram of the structure of a user information authentication device for the server side in an embodiment of the present invention;

[0070] Figure 7 This is a schematic diagram of the structure of the electronic device in an embodiment of the present invention. Detailed Implementation

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

[0072] Please see Figure 1 The first aspect of this invention provides a user information authentication method, which is executed by a user terminal and includes the following steps S11 to S13:

[0073] Step S11: When the server sends a probe task instruction message, a user-side private key is generated based on the key input by the user; wherein, the probe task instruction message is used to indicate the probe task proof result used for user identity verification.

[0074] Step S12: Generate the test task proof result based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group.

[0075] Step S13: Feed back the random number and the test task proof result to the server to instruct the server to perform user information authentication based on the random number and the test task proof result.

[0076] Specifically, in this embodiment, when receiving the probe task instruction information issued by the server, it is necessary to generate a probe task proof result for user identity verification in response to the probe task instruction information. First, a user-end private key is generated based on the key input by the user, and then the user-end private key is used as the private key for zero-knowledge proof.

[0077] Furthermore, since the test task instruction information is generated and distributed by the server, in order to ensure the real-time nature and uniqueness of the test task proof result, this embodiment is based on the elliptic curve algorithm. According to the test task instruction information, combined with the user's private key, several random numbers and generator parameters randomly selected from the preset elliptic curve finite cyclic group, the test task proof result is generated.

[0078] It is understandable that this embodiment pre-constructs a finite cyclic group of elliptic curves, let the elliptic curve E(p): y 2 =(x 3 +x+0xAA3A93E7)(modp). This is an elliptic curve finite cyclic group G of order p, where p is a prime number. A randomly chosen g = (x,y) is selected as the generator parameter of the elliptic curve finite cyclic group G. The negative element of a finite field is defined as: the negative element of P(x,y) is (x,-ymodp) = (x,-y); the addition operation of a finite field is defined as: P(x1,y1) + Q(x2,y2) = R(x3,y3); where x3≡k 2 -x1-x2(modp), y3≡k(x1-x3)-y1(modp), if P=Q, k=3X2 / 2Y1, if P≠Q, k=(Y2-Y1) / (X2-x1); the multiplication of a finite field is defined as:

[0079] Furthermore, the random number and the test task proof result are fed back to the server so that the server can perform user information authentication based on the random number used to generate the test task proof result and the test task proof result.

[0080] The user information authentication method provided in this invention generates a test task proof result using a user-end private key generated based on the user's input key, and performs user information authentication based on zero-knowledge proof. This method can complete user information authentication without transmitting key information or requiring third-party information transmission, significantly reducing the risk of authentication information leakage.

[0081] As a preferred embodiment, the step of generating a client-side private key based on the user-input key specifically includes:

[0082] Based on the key and a randomly generated salt value, a digest algorithm is used to generate a data digest corresponding to the key, and the data digest is used as the user's private key.

[0083] Specifically, in this embodiment, when a user initializes or modifies their password, a random salt value is added to the key, and a digest algorithm is used to generate a data digest corresponding to the key as the user's private key. Thus, even if different users use the same key, their user's private keys will be different due to the different random salt values. In addition, the protection of the original key is enhanced.

[0084] As a preferred embodiment, the step of generating a data digest corresponding to the key using a digest algorithm based on the key and a randomly generated salt value specifically includes:

[0085] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0086] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0087] The data is compressed in a cyclic manner by grouping several of the data sets to generate the data digest.

[0088] Specifically, this embodiment generates the data digest corresponding to the key using the Merkle-Damgard data digest algorithm. Preferably, to ensure data security, the randomly generated salt value is at least 256 bits. First, for the key input by the user, its binary length L is obtained. p Let m p =L p %L, where L is the preset grouping length, such as 256, 512, etc. This embodiment does not specify a particular grouping length. When m p If the value is not equal to 0, then append the number calculated as follows to the key: This allows you to obtain the padded key.

[0089] For randomly generated salt values, their binary length L is also obtained. s Let m s =L s %L, when m s When the value is not equal to 0, a number calculated as follows should be appended after the salt value: This allows us to obtain the salt value after filling.

[0090] When the binary data length of the padded key is inconsistent with the binary data length of the padded salt, for the data with the shorter binary data length, a cyclic replication method is adopted to extend it until its binary data length is consistent with that of the other data with the longer binary data length, that is, the binary data length of the padded key is made equal to the binary data length of the padded salt.

[0091] Further, the padded key and the padded salt are converted into binary, and merged by bitwise XOR to obtain merged data I. Then the merged data I is grouped according to the grouping length to obtain a plurality of grouped data, denoted as: I s ={I1,I2,...,I n};I s is a set of grouped data, I n is the nth grouped data.

[0092] Further, as shown in Figure 2 , it is a schematic diagram of the grouping cyclic compression in this embodiment. The process of the grouping cyclic compression is as follows: first traverse the set I of grouped data s , for any I i ∈I s , 0<i≤n, where:

[0093]

[0094] IV is the initial value of the initial chain value CV0, whose value is Figure 2 the f in is exactly the compression function f(CV i-1 ,I i ), which represents compressing the compression result CV of the previous input grouped data I i-1 i-1 and the grouped data I i , the compression logic is: divide I i into 64 groups to obtain a grouping set: M={M i,0 ,M i,1 ,...,M i,63}, the specific grouping transformation logic is:

[0095]

[0096] where, 《 denotes cyclic left shift, M i,j denotes the jth group of the ith grouped data I i . Perform cyclic compression on the grouping set M, let the j-th round cyclic compression result be:

[0097]

[0098] ​Where ∧ represents bitwise AND, ∨ represents bitwise OR, and ⊕ represents XOR. Indicates bitwise inversion, M i,64 =M i,0 .

[0099] The results of the 64 rounds of cyclic compression are XORed bitwise to obtain I. i The compression result is:

[0100] CV i =H i,0 ⊕H i,1 ⊕...⊕H i,63 ;

[0101] Furthermore, the last group of data I n cyclic compression output CV n As the final data summary.

[0102] As a preferred embodiment, generating the test task proof result based on the test task instruction information, the user-side private key, several random numbers, and preset generator parameters in an elliptic curve finite cyclic group specifically includes:

[0103] Based on the number of trial task values ​​contained in the trial task instruction information, several random numbers are randomly generated; wherein, the trial task values ​​are randomly generated by the server.

[0104] The product of each of the test task values ​​and the user's private key and the product of each of the random numbers and the generator parameter are summed to obtain several test task proof values.

[0105] Based on several of the test task proof values, the test task proof result is generated.

[0106] Specifically, in this embodiment, the number of randomly generated random numbers is equal to the number of trial task values ​​contained in the trial task instruction information. For example, if the trial task values ​​contained in the trial task instruction information are k = {k1, k2, k3, k4, k5}, then in this embodiment, 5 random numbers are randomly selected as e = {e1, e2, e3, e4, e5}.

[0107] Furthermore, through the expression: t i =k i r+e i g generates several test task proof values, where k i Let r represent the value of the i-th probe task, r represent the user's private key, g represent the generation meta-parameters, and e represent the value of the i-th probe task. i Let t represent the i-th random number. iLet t represent the proof value of the i-th trial task. Taking the trial task value as k = {k1, k2, k3, k4, k5} and the 5 random numbers as e = {e1, e2, e3, e4, e5} as an example, the proof result of the trial task is: t = {t1 = k1r + e1g, t2 = k2r + e2g, t3 = k3r + e3g, t4 = k4r + e4g, t5 = k5r + e5g}.

[0108] As a preferred embodiment, the probe task indication information further includes a probe task digital signature composed of digital signatures of the values ​​of each probe task;

[0109] Before generating the proof result of the trial task based on the trial task instruction information, the user-end private key, several random numbers, and preset generator parameters in the elliptic curve finite cyclic group, the method further includes:

[0110] Obtain the server-side public key generated by the server.

[0111] The server-side public key is used to verify the digital signature of the probe task, and several probe task verification values ​​are obtained.

[0112] When each of the proposed task values ​​matches the proposed task verification value, the proposed task value is determined to have passed verification.

[0113] The step of generating the test task proof result based on the test task instruction information, the user's private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group is as follows:

[0114] When the test task value passes verification, the test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters.

[0115] Specifically, before generating the test task proof result, this embodiment needs to verify the test task proof issued by the server to determine whether it has been tampered with. First, this embodiment obtains the server-side public key generated and published by the server. Then, it uses the server-side public key to verify the digital signature of the test task. Specifically, the digital signature of each test task value needs to be verified to obtain several test task verification values. When each test task value matches each test task verification value, it indicates that the test task proof issued by the server is valid and has not been tampered with, thus determining that each test task value has passed verification. If any test task value does not match its corresponding test task verification value, it indicates that the test task proof issued by the server is invalid and may have been tampered with, thus determining that the current test task value has failed verification, and no further test task proof result is generated.

[0116] As a preferred embodiment, the method further includes:

[0117] Generate a user-side public key based on the user-side private key and the generation meta-parameters;

[0118] The test task proof result is signed using the user's private key to obtain a digital signature of the test task proof;

[0119] The user's public key and the digital signature of the probe task proof are sent to the server so that the server can verify the digital signature of the probe task proof based on the user's public key.

[0120] Specifically, in this embodiment, a user-side public key is generated based on the product of the user-side private key and the generated meta-parameters. Then, the user-side private key is used to sign the test task proof result to obtain a test task proof digital signature. For example, assuming the current test task proof result is t = {t1, t2, t3, t4, t5}, then the test task proof digital signature S... u For: S u ={S u1 =sign(t1,r),S u2 =sign(t2,r),S u3 =sign(t3,r),S u4 =sign(t4,r),S u5 =sign(t5,r)}, where sign(t i (r) indicates that the asymmetric encryption algorithm ECC (Elliptic Curve Cryptography) is used, with the user's private key r as the private key, to prove the value t in the trial task. iThe signing process is then performed. Finally, the client's public key and the digital signature of the trial task proof are sent to the server so that the client's public key can be used to verify the digital signature of the trial task proof.

[0121] As a preferred embodiment, the method further includes:

[0122] When the client private key and the client public key are generated, the current salt value, the client public key, and the client identifier are sent to the server for storage.

[0123] Specifically, when the salt value and the user's public key are generated for the first time or change with the change of the user's private key, in order to ensure that the user information stored on the server is updated in a timely manner and thus ensure the accuracy of user information authentication, this embodiment sends the current salt value, user's public key, and user identifier to the server. The server stores the salt value and user's public key and associates them with the user based on the unique user identifier. In addition, since each user's private key is pre-stored on the server, the server can generate the salt value based on the stored private key without transmitting the user's private key during the user information authentication process, thereby ensuring the confidentiality and security of the user information authentication process.

[0124] Please see Figure 3 The second aspect of this invention provides a user information authentication method, which is executed by a server and includes steps S21 and S22:

[0125] Step S21: Send a test task instruction message to the user terminal; wherein, the test task instruction message includes at least a number of randomly generated test task values, and the test task instruction message is used to instruct the user terminal to provide the test task proof result for user identity verification.

[0126] Step S22: When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result.

[0127] Specifically, in order to verify whether the current user terminal has the key information for system login, this embodiment first sends a probe task instruction information to the user terminal. The probe task instruction information includes at least several randomly generated probe task values. For example, the several probe task values ​​are represented as: k = {k1, k2, k3, k4, k5}, which are used to instruct the user terminal to provide the probe task proof result for user identity verification.

[0128] Furthermore, when the user receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is required based on the received random numbers and the test task proof result. This is to determine whether the current user has the system login key information from the test task proof result, thereby completing the user information authentication based on zero-knowledge proof.

[0129] The user information authentication method provided in this invention uses zero-knowledge proofs to perform user information authentication, which can complete user information authentication without transmitting key information or requiring third-party information transmission, significantly reducing the risk of authentication information leakage.

[0130] As a preferred embodiment, the user information authentication based on the random number and the test task proof result specifically includes:

[0131] Based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group, the first test task comparison parameters are generated.

[0132] The second trial task comparison parameters are generated based on the random number, the trial task value, the user-side private key, and the generator meta-parameters; wherein, the user-side private key is generated using a digest algorithm based on the currently stored user-side key and salt value;

[0133] When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, it is determined that the user terminal has passed the user information authentication.

[0134] Specifically, this embodiment uses the expression: R i =t i g, Generate the first trial task comparison parameters R i Where g represents the aforementioned generator parameter, t i Let represent the proof value of the i-th trial task. For example, suppose the proof result of the trial task is: t = {t1, t2, t3, t4, t5}, then the comparison parameters of the first trial task are: R = {R1 = t1g, R2 = t2g, R3 = t3g, R4 = t4g, R5 = t5g}.

[0135] Furthermore, this embodiment uses the expression: R′ i =k i r(e i g) Generate the second trial task comparison parameters R′ i , where k i Let r represent the value of the i-th probe task, r represent the user's private key, and e represent the value of the i-th probe task. iLet represent the i-th random number. For example, assuming the trial task values ​​contain: k = {k1, k2, k3, k4, k5}, then the random numbers contain: e = {e1, e2, e3, e4, e5}. The second trial task comparison parameters are: R′ = {R′1 = k1r(e1g), R′2 = k2r(e2g), R′3 = k3r(e3g), R′4 = k4r(e4g), R′5 = k5r(e5g)}. It is understood that in this embodiment, the first and second trial task comparison parameters are calculated using different algorithms, and the trial task proof value t is used to calculate the first trial task comparison parameter. i The first trial task comparison parameter is formed by the user terminal based on its own generated user terminal private key. The user terminal private key used to calculate the comparison parameter of the second trial task is generated by using a digest algorithm based on the currently stored user terminal key and salt value. Therefore, if the user terminal has a valid and correct user terminal private key, the comparison parameter of the first trial task will be consistent with the comparison parameter of the second trial task, thereby achieving the purpose of zero-knowledge proof.

[0136] As a preferred embodiment, the method specifically generates the user-side private key through the following steps:

[0137] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0138] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0139] The grouped data is compressed in a cyclic manner to generate a data digest, and the data digest is used as the private key of the user terminal.

[0140] It is worth noting that user account and information initialization are both performed on the server side, so the server side stores each user's basic personal information, login account, key, user-side public key, salt value and other information.

[0141] like Figure 2 As shown, the generation of the client-side private key on the server side also employs the Merkle-Damgard data digest algorithm. First, for the pre-stored key, its binary length L is obtained. p Let m p =L p%L, where L is a preset block length, for example, set to 256, 512, etc., which is not specifically limited in this embodiment, when m p ≠0, the number calculated in the following manner is appended after the key: so as to obtain the padded key.

[0142] For a pre-stored salt value, its binary length L is also obtained s , let m s =L s %L, when m s ≠0, the number calculated in the following manner is appended after the salt value: so as to obtain the padded salt value.

[0143] When the binary data length of the padded key is inconsistent with the binary data length of the padded salt value, for the data with the shorter binary data length, a cyclic replication manner is adopted to extend it to be consistent with the binary data length of the other data with the longer binary data length, that is, the binary data length of the padded key is made equal to the binary data length of the padded salt value.

[0144] Further, the padded key and the padded salt value are converted into binary, and combined by bitwise XOR to obtain combined data I. Then the combined data I is grouped according to the block length, so as to obtain a plurality of block data, which are denoted as: I s ={I1,I2,...,I n}; I s is a set of block data, and I n is the n-th block data.

[0145] Further, traverse the set I of block data s , for any I i ∈I s , 0<i≤n, where:

[0146]

[0147] IV is the initial value of the initial chaining value CV0, and its value is Figure 2 where f is the compression function f(CV i-1 ,I i ), which represents compressing the previous compression result CV of the input block data I i-1 i-1 and the block data I i , and the compression logic is: dividing I i into 64 groups to obtain a block set: M={M i,0 ,M i,1 ​,...,M i,63 The specific grouping transformation logic is as follows:

[0148]

[0149] Where, "represents a circular left shift, M" i,j Indicates the i-th group of data I i The j-th group. Perform cyclic compression on the group set M, and let the result of the j-th round of cyclic compression be:

[0150]

[0151] Where ∧ represents bitwise AND, ∨ represents bitwise OR, and ⊕ represents XOR. Indicates bitwise inversion, M i,64 =M i,0 .

[0152] The results of the 64 rounds of cyclic compression are XORed bitwise to obtain I. i The compression result is:

[0153] CV i =H i,0 ⊕H i,1 ⊕...⊕H i,63 ;

[0154] Furthermore, the last group of data I n cyclic compression output CV n The final data digest is the user's private key.

[0155] As a preferred embodiment, the test task proof result includes several test task proof values; the test task proof value is generated by the user terminal based on the test task value, the user terminal private key, the random number, and the generator parameters in the preset elliptic curve finite cyclic group.

[0156] The method further includes:

[0157] When the client receives the client's public key and the digital signature of the test task proof sent by the client, the client uses the public key to verify the digital signature of the test task proof and obtains several test task proof verification values.

[0158] When the proof value of each of the trial tasks is consistent with the verification value of each of the trial tasks, the proof result of the trial task is determined to have passed the verification.

[0159] When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result, specifically as follows:

[0160] When the test task proof result and the random number are received, and the test task proof result passes verification, user information authentication is performed based on the random number and the test task proof result.

[0161] Specifically, before authenticating user information based on random numbers and the test task proof results, this embodiment needs to verify the test task proof results to determine whether they have been tampered with. First, upon receiving the user's public key and the test task proof digital signature sent by the user, the user's public key is used to verify the test task proof digital signature. Specifically, each test task proof value needs to be verified, thereby obtaining several test task proof verification values. When each test task proof value matches the corresponding verification value, it indicates that the test task proof result returned by the user is valid and has not been tampered with, thus determining that the test task proof result has passed verification. If any test task proof value does not match its corresponding verification value, it indicates that the test task proof result returned by the user is invalid and may have been tampered with, thus determining that the current test task proof result has failed verification, and further user information authentication is not performed.

[0162] As a preferred embodiment, the method further includes:

[0163] Generate a server-side private key; wherein, the server-side private key is a random number with a preset data length;

[0164] Based on the server-side private key and the generator parameters in the preset elliptic curve finite cyclic group, a server-side public key is generated and disclosed to the user terminal.

[0165] The server-side private key is used to sign each of the probe task values ​​to obtain a probe task digital signature.

[0166] Based on the digital signature of the probing task and the values ​​of each probing task, the probing task indication information is generated; wherein, the server-side public key is used to verify the digital signature of the probing task.

[0167] Specifically, in this embodiment, after generating a random number of a preset length as the server-side private key, a server-side public key is generated based on the product of the server-side private key and the generator parameters in the elliptic curve finite cyclic group, and then made public to the user. The server-side private key is stored locally on the server. Then, the server-side private key is used to sign each trial task value to obtain a trial task digital signature. For example, assuming the current trial task values ​​contain k = {k1, k2, k3, k4, k5}, the trial task digital signature S... s For: S s={S s1 =sign(k1,d),S s2 =sign(k2,d),S s3 =sign(k3,d),S s4 =

[0168] sign(k4,d),S s5 =sign(k5,d)}, where sign(k i ,d) indicates the use of the asymmetric encryption ECC algorithm, with the server-side private key d as the private key, to probe the value k of the task. i Sign it.

[0169] To better illustrate the user information authentication method provided in the embodiments of the present invention, the following is combined with... Figure 4 The user information authentication process is explained in detail below:

[0170] Step 1: Initialize user accounts and information on the server side. It's worth noting that all users in the internal R&D tool platform and employee management system are either internal company users or users who collaborate with the company. To ensure system security, this embodiment does not support user registration. Administrators add users and assign permissions. Simultaneously, personnel information is managed on the server side, including each user's basic personal information, login account, key, client public key, salt value, etc.

[0171] Step 2.1: When a user initializes or changes their password, the client uses the Merkle-Damgard data digest algorithm to generate the client's private key.

[0172] Step 2.2: The user terminal generates a user terminal public key based on the user terminal private key and the generator parameters in the elliptic curve finite cyclic group, and transmits it to the server for storage.

[0173] Step 3.1: Generate the server-side private key and server-side public key respectively.

[0174] Step 3.2: The server randomly selects several trial task values ​​to generate trial tasks.

[0175] Step 3.3: The server uses its private key to sign each probe task value, thereby generating a probe task digital signature.

[0176] Step 3.4: The server sends a probe task instruction message to the user.

[0177] Step 4.1: The client responds to the probe task instruction information by generating a client private key and a client public key.

[0178] Step 4.2: The client sends its public key, current salt value, and client identifier to the server for storage.

[0179] Step 4.3: The user terminal uses the server-side public key to verify the digital signature of the probe task.

[0180] Step 4.4: After the digital signature verification of the test task is passed, the user terminal calculates the test task proof result and signs the test task proof result using the user terminal's private key to generate the test task proof digital signature.

[0181] Step 4.5: The user sends the test task proof result and the test task proof digital signature back to the server.

[0182] Step 5.1: The server uses the client's public key to verify the digital signature of the probe task proof.

[0183] Step 5.2: After the digital signature verification of the test task is passed, the server verifies the test task verification result.

[0184] Step 6.1: After the server determines that the verification result of the test task has passed, it sends an authentication completion indication message to the user, indicating that the user information has been successfully authenticated.

[0185] Please see Figure 5 A third aspect of the present invention provides a user information authentication device 100, comprising:

[0186] The user-side private key generation module 11 is used to generate a user-side private key based on the key input by the user when it receives a probe task instruction information sent by the server; wherein, the probe task instruction information is used to indicate the probe task proof result used for user identity verification.

[0187] The test task proof result generation module 12 is used to generate the test task proof result based on the test task instruction information, the user terminal private key, several random numbers and the generator parameters in the preset elliptic curve finite cyclic group.

[0188] The trial task proof result feedback module 13 is used to feed back the random number and the trial task proof result to the server, so as to instruct the server to perform user information authentication based on the random number and the trial task proof result.

[0189] As a preferred embodiment, the user-side private key generation module 11 is used to generate a user-side private key based on the key input by the user, specifically including:

[0190] Based on the key and a randomly generated salt value, a digest algorithm is used to generate a data digest corresponding to the key, and the data digest is used as the user's private key.

[0191] As a preferred embodiment, the user-side private key generation module 11 is used to generate a data digest corresponding to the key based on the key and a randomly generated salt value using a digest algorithm, specifically including:

[0192] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0193] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0194] The data is compressed in a cyclic manner by grouping several of the data sets to generate the data digest.

[0195] As a preferred embodiment, the test task proof result generation module 12 is used to generate the test task proof result based on the test task instruction information, the user-end private key, several random numbers, and preset generator parameters in an elliptic curve finite cyclic group, specifically including:

[0196] Based on the number of trial task values ​​contained in the trial task instruction information, several random numbers are randomly generated; wherein, the trial task values ​​are randomly generated by the server.

[0197] The product of each of the test task values ​​and the user's private key and the product of each of the random numbers and the generator parameter are summed to obtain several test task proof values.

[0198] Based on several of the test task proof values, the test task proof result is generated.

[0199] As a preferred embodiment, the probe task indication information further includes a probe task digital signature composed of digital signatures of the values ​​of each probe task;

[0200] The device further includes a test task digital signature verification module, which, before the test task proof result generation module 12 generates the test task proof result based on the test task instruction information, the user's private key, several random numbers, and preset generator parameters in an elliptic curve finite cyclic group, is used to:

[0201] Obtain the server-side public key generated by the server.

[0202] The server-side public key is used to verify the digital signature of the probe task, and several probe task verification values ​​are obtained.

[0203] When each of the proposed task values ​​matches the proposed task verification value, the proposed task value is determined to have passed verification.

[0204] The test task proof result generation module 12 is used to generate the test task proof result based on the test task instruction information, the user-end private key, several random numbers, and preset generator parameters in the elliptic curve finite cyclic group, specifically:

[0205] When the test task value passes verification, the test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters.

[0206] As a preferred embodiment, the device further includes a test task proof signature module, used for:

[0207] Generate a user-side public key based on the user-side private key and the generation meta-parameters;

[0208] The test task proof result is signed using the user's private key to obtain a digital signature of the test task proof;

[0209] The user's public key and the digital signature of the probe task proof are sent to the server so that the server can verify the digital signature of the probe task proof based on the user's public key.

[0210] As a preferred embodiment, the device further includes a data transmission module for:

[0211] When the client private key and the client public key are generated, the current salt value, the client public key, and the client identifier are sent to the server for storage.

[0212] The user information authentication device 100 provided in this embodiment of the invention generates a test task proof result by using a user-end private key generated based on the user's input key, and performs user information authentication based on zero-knowledge proof. This enables user information authentication to be completed without transmitting key information or requiring third-party information transmission, significantly reducing the risk of authentication information leakage.

[0213] Please see Figure 6 A fourth aspect of the present invention provides a user information authentication device 200, comprising:

[0214] The trial task instruction information sending module 21 is used to send trial task instruction information to the user terminal; wherein, the trial task instruction information includes at least a number of randomly generated trial task values, and the trial task instruction information is used to instruct the user terminal to provide the trial task proof result for user identity verification.

[0215] The user information authentication module 22 is used to perform user information authentication based on the random numbers and the test task proof result when it receives the test task proof result fed back by the user terminal and several random numbers used to generate the test task proof result.

[0216] As a preferred embodiment, the user information authentication module 22 is used to perform user information authentication based on the random number and the trial task proof result, specifically including:

[0217] Based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group, the first test task comparison parameters are generated.

[0218] The second trial task comparison parameters are generated based on the random number, the trial task value, the user-side private key, and the generator meta-parameters; wherein, the user-side private key is generated using a digest algorithm based on the currently stored user-side key and salt value;

[0219] When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, it is determined that the user terminal has passed the user information authentication.

[0220] As a preferred embodiment, the device further includes a user-side private key generation module, used for:

[0221] Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value;

[0222] The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data.

[0223] The grouped data is compressed in a cyclic manner to generate a data digest, and the data digest is used as the private key of the user terminal.

[0224] As a preferred embodiment, the test task proof result includes several test task proof values; the test task proof value is generated by the user terminal based on the test task value, the user terminal private key, the random number, and the generator parameters in the preset elliptic curve finite cyclic group.

[0225] The device further includes a test task proof digital signature verification module, used for:

[0226] When the client receives the client's public key and the digital signature of the test task proof sent by the client, the client uses the public key to verify the digital signature of the test task proof and obtains several test task proof verification values.

[0227] When the proof value of each of the trial tasks is consistent with the verification value of each of the trial tasks, the proof result of the trial task is determined to have passed the verification.

[0228] The user information authentication module 22 is used to perform user information authentication based on the random numbers and the trial task proof result when it receives the test task proof result from the user terminal and several random numbers used to generate the test task proof result. Specifically:

[0229] When the test task proof result and the random number are received, and the test task proof result passes verification, user information authentication is performed based on the random number and the test task proof result.

[0230] As a preferred embodiment, the device further includes a trial task signature module, used for:

[0231] Generate a server-side private key; wherein, the server-side private key is a random number with a preset data length;

[0232] Based on the server-side private key and the generator parameters in the preset elliptic curve finite cyclic group, a server-side public key is generated and disclosed to the user terminal.

[0233] The server-side private key is used to sign each of the probe task values ​​to obtain a probe task digital signature.

[0234] Based on the digital signature of the probing task and the values ​​of each probing task, the probing task indication information is generated; wherein, the server-side public key is used to verify the digital signature of the probing task.

[0235] The user information authentication device 200 provided in this embodiment of the invention performs user information authentication based on zero-knowledge proof, which can complete user information authentication without transmitting key information or requiring third-party information transmission, significantly reducing the risk of authentication information leakage.

[0236] Please see Figure 7 The fifth aspect of the present invention provides an electronic device 300, including a memory 32, a processor 31, and a computer program stored in the memory 32 and executable on the processor 31. When the processor 31 executes the computer program, it implements the user information authentication method described in any embodiment of the first aspect, or implements the user information authentication method described in any embodiment of the second aspect.

[0237] For example, the computer program may be divided into one or more modules / units, which are stored in the memory 32 and executed by the processor 31 to complete the present invention. The one or more modules / units may be a series of computer program instruction segments capable of performing a specific function, which describe the execution process of the computer program in the electronic device 300.

[0238] The electronic device 300 may include, but is not limited to, a processor 31 and a memory 32. Those skilled in the art will understand that the schematic diagram is merely an example of the electronic device 300 and does not constitute a limitation on the electronic device 300. It may include more or fewer components than illustrated, or combine certain components, or different components. For example, the electronic device 300 may also include input / output devices, network access devices, buses, etc.

[0239] The processor 31 can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor, or this processor 31 can be any conventional processor 31. The processor 31 is the control center of the electronic device 300, connecting various parts of the electronic device 300 via various interfaces and lines.

[0240] The memory 32 can be used to store the computer programs and / or modules. The processor 31 implements various functions of the electronic device 300 by running or executing the computer programs and / or modules stored in the memory 32 and calling the data stored in the memory 32. The memory 32 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the mobile phone (such as audio data, phonebook, etc.). In addition, the memory 32 may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0241] A sixth aspect of the present invention provides a computer-readable storage medium comprising a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to execute the user information authentication method described in any embodiment of the first aspect, or to implement the user information authentication method described in any embodiment of the second aspect.

[0242] A seventh aspect of the present invention provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the user information authentication method described in any embodiment of the first aspect, or implements the user information authentication method described in any embodiment of the second aspect.

[0243] Wherein, if the modules / units integrated in the electronic device are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the methods of the above embodiments of the present invention can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc.

[0244] The above description represents the preferred embodiments of the present invention. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of the present invention, and these improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A user information authentication method characterized by comprising: The method is executed by the user terminal and includes: When a probe task instruction message is received from the server, a user-side private key is generated based on the key input by the user; wherein, the probe task instruction message includes at least several probe task values ​​randomly generated by the server; the probe task instruction message is used to indicate the probe task proof result used for user identity verification. The test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group. The random number and the test task proof result are fed back to the server to instruct the server to perform user information authentication based on the random number and the test task proof result; Specifically, generating a client-side private key based on the user-input key includes: Based on the key and a randomly generated salt value, a digest algorithm is used to generate a data digest corresponding to the key, and the data digest is used as the user's private key; The server-side performs user information authentication based on the random number and the test task proof result, specifically including: The server generates the first trial task comparison parameters based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group. The server generates a second trial task comparison parameter based on the random number, the trial task value, the user's private key, and the generator meta-parameters; wherein, the user's private key is generated using a digest algorithm based on the currently stored user's key and salt value. When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, the server determines that the user terminal has passed the user information authentication.

2. The user information authentication method of claim 1, wherein The step of generating a data digest corresponding to the key using a digest algorithm based on the key and a randomly generated salt value specifically includes: Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value; The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data. The data is compressed in a cyclic manner by grouping several of the data sets to generate the data digest.

3. The user information authentication method of claim 1, wherein The step of generating the test task proof result based on the test task instruction information, the user's private key, several random numbers, and preset generator parameters in an elliptic curve finite cyclic group specifically includes: Based on the number of trial task values ​​contained in the trial task instruction information, several random numbers are randomly generated; The product of each of the test task values ​​and the user's private key and the product of each of the random numbers and the generator parameters are summed to obtain several test task proof values. Based on several of the test task proof values, the test task proof result is generated.

4. The user information authentication method of claim 3, wherein The probe task instruction information also includes a probe task digital signature composed of digital signatures of the values ​​of each probe task; Before generating the proof result of the trial task based on the trial task instruction information, the user-end private key, several random numbers, and preset generator parameters in the elliptic curve finite cyclic group, the method further includes: Obtain the server-side public key generated by the server. The server-side public key is used to verify the digital signature of the probe task, and several probe task verification values ​​are obtained. When each of the proposed task values ​​matches the proposed task verification value, the proposed task value is determined to have passed verification. The step of generating the test task proof result based on the test task instruction information, the user's private key, several random numbers, and the generator parameters in the preset elliptic curve finite cyclic group is as follows: When the test task value passes verification, the test task proof result is generated based on the test task instruction information, the user terminal private key, several random numbers, and the generator parameters.

5. The user information authentication method of claim 1, wherein The method further includes: Generate a user-side public key based on the user-side private key and the generation meta-parameters; The test task proof result is signed using the user's private key to obtain a digital signature of the test task proof; The user's public key and the digital signature of the probe task proof are sent to the server so that the server can verify the digital signature of the probe task proof based on the user's public key.

6. The user information authentication method of claim 5, wherein The method further includes: When the client private key and the client public key are generated, the current salt value, the client public key, and the client identifier are sent to the server for storage.

7. A user information authentication method characterized by comprising: The method is executed by the server and includes: A probe task instruction message is sent to the user terminal; wherein, the probe task instruction message includes at least several randomly generated probe task values, and the probe task instruction message is used to instruct the user terminal to provide a probe task proof result for user identity verification; the probe task proof result is generated by the user terminal based on the key input by the user to generate a user terminal private key, and according to the probe task instruction message, the user terminal private key, several random numbers, and the generator meta-parameters in a preset elliptic curve finite cyclic group; When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result. Specifically, the user terminal generates a user terminal private key based on the key input by the user, including: The user terminal uses the key and a randomly generated salt value to generate a data digest corresponding to the key using a digest algorithm, and uses the data digest as the user terminal's private key; The user information authentication based on the random number and the test task proof result specifically includes: Based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group, the first test task comparison parameters are generated. The second trial task comparison parameters are generated based on the random number, the trial task value, the user-side private key, and the generator meta-parameters; wherein, the user-side private key is generated using a digest algorithm based on the currently stored user-side key and salt value; When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, it is determined that the user terminal has passed the user information authentication.

8. The user information authentication method of claim 7, wherein The method specifically generates the user-side private key through the following steps: Based on the binary data length of the key, the binary data length of the salt value, and a preset group length, the key and the salt value are padded to obtain the padded key and the padded salt value; wherein, the binary data length of the padded key is equal to the binary data length of the padded salt value; The padded key and the padded salt value are combined by bitwise XOR to obtain merged data, and the merged data is grouped according to the group length to obtain several grouped data. The grouped data is compressed in a cyclic manner to generate a data digest, and the data digest is used as the private key of the user terminal.

9. The user information authentication method of claim 7, wherein, The test task proof result includes several test task proof values; the test task proof value is generated by the user terminal based on the test task value, the user terminal private key, the random number, and the generator parameters in the preset elliptic curve finite cyclic group; The method further includes: When the client receives the client's public key and the digital signature of the test task proof sent by the client, the client uses the public key to verify the digital signature of the test task proof and obtains several test task proof verification values. When the proof value of each of the trial tasks is consistent with the verification value of each of the trial tasks, the proof result of the trial task is determined to have passed the verification. When the user terminal receives the test task proof result and several random numbers used to generate the test task proof result, user information authentication is performed based on the random numbers and the test task proof result, specifically as follows: When the test task proof result and the random number are received, and the test task proof result passes verification, user information authentication is performed based on the random number and the test task proof result.

10. The user information authentication method of claim 7, wherein, The method further includes: Generate a server-side private key; wherein, the server-side private key is a random number with a preset data length; Based on the server-side private key and the generator parameters in the preset elliptic curve finite cyclic group, a server-side public key is generated and disclosed to the user terminal. The server-side private key is used to sign each of the probe task values ​​to obtain a probe task digital signature. Based on the digital signature of the probing task and the values ​​of each probing task, the probing task indication information is generated; wherein, the server-side public key is used to verify the digital signature of the probing task.

11. A user information authentication device, characterized in that, include: The user-side private key generation module is used to generate a user-side private key based on the key input by the user when it receives a probe task instruction information sent by the server. The probe task instruction information includes at least a number of probe task values ​​randomly generated by the server. The probe task instruction information is used to indicate the probe task proof result used for user identity verification. The test task proof result generation module is used to generate the test task proof result based on the test task instruction information, the user terminal private key, several random numbers and the generator parameters in the preset elliptic curve finite cyclic group. The trial task proof result feedback module is used to feed back the random number and the trial task proof result to the server, so as to instruct the server to perform user information authentication based on the random number and the trial task proof result; The user-side private key generation module is used to generate a user-side private key based on the key input by the user, specifically including: Based on the key and a randomly generated salt value, a digest algorithm is used to generate a data digest corresponding to the key, and the data digest is used as the user's private key; The server-side performs user information authentication based on the random number and the test task proof result, specifically including: The server generates the first trial task comparison parameters based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group. The server generates a second trial task comparison parameter based on the random number, the trial task value, the user's private key, and the generator meta-parameters; wherein, the user's private key is generated using a digest algorithm based on the currently stored user's key and salt value. When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, the server determines that the user terminal has passed the user information authentication.

12. A user information authentication device, characterized in that, include: The trial task instruction information sending module is used to send trial task instruction information to the user terminal; wherein, the trial task instruction information includes at least a number of randomly generated trial task values, and the trial task instruction information is used to instruct the user terminal to provide a trial task proof result for user identity verification; the trial task proof result is generated by the user terminal based on the key input by the user to generate a user terminal private key, and according to the trial task instruction information, the user terminal private key, a number of random numbers, and the generator meta-parameters in a preset elliptic curve finite cyclic group; The user information authentication module is used to perform user information authentication based on the random numbers and the test task proof result when it receives the test task proof result from the user terminal and several random numbers used to generate the test task proof result. Specifically, the user terminal generates a user terminal private key based on the key input by the user, including: The user terminal uses the key and a randomly generated salt value to generate a data digest corresponding to the key using a digest algorithm, and uses the data digest as the user terminal's private key; The user information authentication module is used to perform user information authentication based on the random number and the test task proof result, specifically including: Based on the test task proof results and the generator parameters in the preset elliptic curve finite cyclic group, the first test task comparison parameters are generated. The second trial task comparison parameters are generated based on the random number, the trial task value, the user-side private key, and the generator meta-parameters; wherein, the user-side private key is generated using a digest algorithm based on the currently stored user-side key and salt value; When the comparison parameters of the first trial task are consistent with the comparison parameters of the second trial task, it is determined that the user terminal has passed the user information authentication.

13. An electronic device, characterized in that, The device includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the user information authentication method according to any one of claims 1 to 6, or implements the user information authentication method according to any one of claims 7 to 10.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the user information authentication method according to any one of claims 1 to 6, or to implement the user information authentication method according to any one of claims 7 to 10.

15. A computer program product comprising a computer program / instructions, characterized in that, When the computer program / instruction is executed by the processor, it implements the user information authentication method according to any one of claims 1 to 6, or the user information authentication method according to any one of claims 7 to 10.

Citation Information

Patent Citations

  • Anonymous authorization and k-time anonymous authentication method and device of constant time complexity, equipment and medium

    CN119720150A

  • Encrypted data transmission method based on dynamic key and server

    CN119788361A