Identity verification method and device for mobile network test, and medium

Abstract

The invention discloses a mobile network test-oriented identity verification method and device, and a medium, and relates to the technical field of data processing. The method comprises the following steps: when a network test user initiates identity authentication to a server, verifying the identity of the server based on RSA parameters; if the server passes the identity verification, calculating authentication information based on parameter information corresponding to the network test user and other users, and verifying whether a target verification equation formed by bilinear mapping is established by using the authentication information; and if yes, determining that the authentication information is generated by the registered network test user holding the legal private key segment, and obtaining an identity authentication result that the identity authentication of the network test user is valid. The method has the following beneficial effects: through dual verification of verifying the identity of the server firstly and then verifying the identity of the network test user, the authenticity of the identities of the server and the network test user and the unforgeability of the authentication are ensured, the provision of user name and password identity information is not needed, and the security of user identity verification is improved.

Description

Technical Field

[0001] This application relates to the field of data processing technology, and in particular to a method, device and medium for authentication in mobile network testing. Background Technology

[0002] With the development of network communication technology, mobile networks have become a core infrastructure supporting socio-economic operations and digital technology innovation. To ensure the normal operation of communication networks, mobile network testing is crucial throughout the entire process of network construction and maintenance. However, the current process of verifying the identity of network test administrators before conducting mobile network tests still poses a security risk of privacy breaches.

[0003] For example, when verifying the identity of network test administrators, centralized servers are often used to verify the usernames, passwords, SMS verification codes, or biometric information they provide. This method carries the risk of the usernames, passwords, SMS verification codes, and biometric information being hijacked and leaked, resulting in low security for this type of identity verification. Summary of the Invention

[0004] This application provides a method, device, and medium for authentication in mobile network testing, primarily aimed at addressing the issue of low security in existing authentication methods.

[0005] In a first aspect, embodiments of this application provide an authentication method for mobile network testing, the method comprising: When a user initiates authentication with the server during network testing, the server's identity is verified based on RSA parameters; If the server authentication is successful, the second hash function is used to process the concatenation of the second random number, the user list, and the first random element for the other users in the user list (excluding the network test user) to obtain the first target integer coefficient for each other user. The second hash function is used to convert binary data of arbitrary length into elements in a multiplication cyclic group. The user list is used to store the identity identifiers assigned to the network test user and the other users when they register with the server. The first random element is randomly selected from the addition cyclic group. Randomly select a first secret number corresponding to the network test user from the target non-zero integer set, and combine it with the first public key fragment corresponding to the network test user, the second public key fragments of other users, the first random element, and the first target integer coefficient to calculate the second random element belonging to the network test user; The second hash function is used to process the concatenation and combination of the first random number, the user list, and the second random element to obtain the second target integer coefficient corresponding to the network test user. An authentication value is generated based on the private key fragment corresponding to the network test user, combined with the first secret number, the second target integer coefficient, and the first random element. The server receives authentication information composed of the first random number, the second random number, and the authentication value, and uses the authentication information to verify whether the target verification equation composed of bilinear mapping is true. If true, then the authentication information is determined to have been generated by a registered network test user holding a valid private key fragment, and the network test user's identity authentication result is obtained.

[0006] In one implementation of this application, the verification of the server identity based on RSA parameters includes: The network test user generates a first random number and sends it to the server; The server uses an RSA private key exponent to sign the first random number and then returns the signature result to the network test user. Based on the network test user performing exponential operations on the signature result using the RSA public key exponent, the exponential operation result is compared with the hash result of the first random number; If the result of the exponentiation operation and the result of the hash are consistent, it means that the server authentication is successful. The result of the hash is obtained by hashing the first random number based on the first hash function. The first hash function is used to convert a binary identity of arbitrary length into an element in an additive cyclic group. The RSA parameters include the RSA private key exponent and the RSA public key exponent.

[0007] In one implementation of this application, before the network test user initiates authentication with the server, the method includes: Construct an additive cyclic group and a multiplicative cyclic group, both of which are first prime numbers. Any two elements in the additive cyclic group are combined according to the bilinear mapping rule and mapped to a target element in the multiplicative cyclic group. The target modulus is obtained by calculation based on the first prime number and the second prime number, which are randomly generated during the RSA key generation process. The Euler function output value is calculated based on the first prime number and the second prime number when the target modulus is used as the Euler function input, and an RSA public key exponent that is coprime to the Euler function output value is selected, wherein the public key exponent is greater than 1 and less than the Euler function output value; Based on the Euler's totient function output value and the public key exponent, combined with the first constraint, the RSA private key exponent is calculated. The first constraint is that the remainder of the public key exponent multiplied by the RSA private key exponent divided by the Euler's totient function output value is 1. A second secret number is randomly selected from the target non-zero integer set, and the generator is calculated by raising the second secret number to a power to obtain the public key value. The target non-zero integer set is the set of all non-zero integers that are less than the first prime number and coprime to the first prime number. The generator is the generator of the first cryptographic cyclic group. A target public key set is constructed based on the modulus, the public key index, and the public key value, and a target private key set is constructed based on the RSA private key index and the second secret number. The target public key set is then published to the target blockchain.

[0008] In one implementation of this application, after constructing a target public key set based on the modulus, the public key exponent, and the public key value, and constructing a target private key set based on the RSA private key exponent and the second secret number, the method includes: When the network test user initiates identity registration with the server, the server randomly assigns a first target identity identifier to the network test user. The first target identity is converted into an element of the addition cyclic group based on the first hash function, and used as the first public key fragment; The first public key fragment is signed based on the second secret number to obtain the private key fragment; The private key fragment is sent to the network test user through a secure channel, and the first target identity identifier and the second target identity identifier corresponding to the other users are published to the target blockchain.

[0009] In one implementation of this application, after determining that the identity authentication is valid, the method includes: The identity authentication result is uploaded to the target blockchain, which is also used to store the authentication information. If the identity authentication result is determined to be valid, the network test user is allowed to access the network test service interface to conduct network testing; Otherwise, deny the network test user access to the service interface.

[0010] In one implementation of this application, the network testing includes: The network testing algorithm is run on the server, and test records corresponding to the network test users are generated.

[0011] In one implementation of this application, the method includes: The server maintains test records for all users in the user list and sets role-based access permissions on the server so that characters with the appropriate permissions can query and access the test records.

[0012] In one implementation of this application, the formula for the target verification equation is expressed as:

[0013] Where e represents the pairing function, which makes a bilinear mapping relationship exist on both sides of the equation, y represents the public key value, t represents the total number of users in the user list, j represents the user index, which is used to traverse all users in the user list, u_j represents the random element corresponding to user j, which belongs to the additive cyclic group, pk_j represents the public key fragment of user j, h_j represents the target integer coefficient corresponding to user j generated by the second hash function, K represents the key fragment, and g represents the generator of the additive cyclic group.

[0014] Secondly, embodiments of this application also provide an authentication device for mobile network testing. The device includes: at least one processor; and a memory communicatively connected to the at least one processor. The memory stores instructions executable by the at least one processor, which, when executed by the at least one processor, enable the at least one processor to: verify the server's identity based on RSA parameters when a network test user initiates authentication with the server; if the server authentication is successful, process a concatenation of a second random number corresponding to other users in the user list (excluding the network test user), the user list, and a first random element based on a second hash function to obtain a first target integer coefficient corresponding to each other user. The second hash function is used to convert binary data of arbitrary length into elements in a multiplication cyclic group. The user list is used to store the identity identifiers assigned to the network test user and the other users when they register with the server. The first random element is randomly selected from an addition cyclic group. A first secret number corresponding to the network test user is randomly selected from the set of non-zero integers. This secret number is then combined with the first public key fragment corresponding to the network test user, the second public key fragments of other users, the first random element, and the first target integer coefficient to calculate a second random element belonging to the network test user. The concatenation of the first random number, the user list, and the second random element is processed using the second hash function to obtain the second target integer coefficient corresponding to the network test user. An authentication value is generated based on the private key fragment corresponding to the network test user, combined with the first secret number, the second target integer coefficient, and the first random element. The server receives authentication information composed of the first random number, the second random number, and the authentication value, and uses this authentication information to verify whether the target verification equation composed of bilinear mappings holds. If it holds, it is determined that the authentication information was generated by a registered network test user holding a valid private key fragment, thus obtaining a valid authentication result for the network test user.

[0015] Thirdly, embodiments of this application also provide a non-volatile computer storage medium corresponding to the method of the first aspect described above, storing computer-executable instructions, which are configured to: when a network test user initiates identity authentication to a server, verify the server's identity based on RSA parameters; if the server's identity authentication is successful, process the concatenation combination of the second random number corresponding to other users in the user list (excluding the network test user), the user list, and the first random element based on the second hash function to obtain the first target integer coefficient corresponding to each other user; the second hash function is used to convert binary data of arbitrary length into elements in a multiplication cyclic group; the user list is used to store the identity identifiers assigned when the network test user and the other users register to the server; the first random element is randomly selected from the addition cyclic group; and randomly select the first random number corresponding to the network test user from the target non-zero integer set. A secret number is used, combined with a first public key fragment corresponding to the network test user, second public key fragments of other users, the first random element, and the first target integer coefficient, to calculate a second random element belonging to the network test user; the concatenation of the first random number, the user list, and the second random element is processed by the second hash function to obtain the second target integer coefficient corresponding to the network test user; an authentication value is generated based on the private key fragment corresponding to the network test user, combined with the first secret number, the second target integer coefficient, and the first random element; the server receives authentication information composed of the first random number, the second random number, and the authentication value, and uses the authentication information to verify whether the target verification equation composed of bilinear mapping is true; if true, it is determined that the authentication information was generated by a registered network test user holding a valid private key fragment, and a valid authentication result for the network test user is obtained.

[0016] This application provides a method, device, and medium for identity verification in mobile network testing. When a network test user initiates identity authentication with a server, the server's identity is verified based on RSA parameters. If the server's identity verification is successful, a second hash function is used to process the concatenation of a second random number corresponding to other users in the user list (excluding the network test user), the user list, and a first random element to obtain a first target integer coefficient corresponding to each other user. The second hash function is used to convert binary data of arbitrary length into elements in a multiplicative cyclic group. The user list is used to store the identity identifiers assigned to the network test user and other users when they register with the server. The first random element is randomly selected from an additive cyclic group. A first secret number corresponding to the network test user is randomly selected from the target non-zero integer set and combined with the network test user's identity. The system calculates a second random element belonging to the network test user using the corresponding first public key fragment, the second public key fragments of other users, the first random element, and the first target integer coefficient. It then processes the concatenation of the first random number, the user list, and the second random element using the second hash function to obtain the second target integer coefficient corresponding to the network test user. Based on the private key fragment corresponding to the network test user, it combines the first secret number, the second target integer coefficient, and the first random element to generate an authentication value. The server receives authentication information composed of the first random number, the second random number, and the authentication value, and uses this authentication information to verify whether the target verification equation composed of bilinear mappings holds. If it holds, it determines that the authentication information was generated by a registered network test user holding a valid private key fragment, thus obtaining a valid authentication result for the network test user. This method has the following advantages: the dual verification process—first verifying the server's identity and then verifying the network test user's identity—ensures the authenticity of both identities and the unforgeability of the authentication. The server can only confirm that the network test user belongs to the user list, but cannot determine which specific user they are, thus protecting the privacy of the network test user's identity. It also improves the security of user authentication by eliminating the need to provide usernames, passwords, or other identity information. Attached Figure Description

[0017] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments of this application and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings: Figure 1 A flowchart illustrating an authentication method for mobile network testing, provided as an embodiment of this application; Figure 2 This is a schematic diagram of the internal structure of a device for authentication in mobile network testing, provided as an embodiment of this application. Detailed Implementation

[0018] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0019] This application provides a method, device, and medium for identity verification in mobile network testing, to solve the following technical problem: the problem of manual configuration errors that can easily occur when upgrading terminal devices based on prerequisites set by relevant administrators.

[0020] The technical solutions proposed in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0021] Figure 1 This is a flowchart illustrating an authentication method for mobile network testing, provided as an embodiment of this application. Figure 1 As shown in the figure, the authentication method for mobile network testing provided in this application embodiment specifically includes the following steps: Step 101: When a network test user initiates identity authentication with the server, the server's identity is verified based on RSA parameters.

[0022] Step 102: If the server authentication is successful, then the concatenation and combination of the second random number, the user list and the first random element corresponding to other users in the user list (excluding the network test user) are processed based on the second hash function to obtain the first target integer coefficient corresponding to each other user. The second hash function is used to convert binary data of arbitrary length into elements in a multiplication cyclic group. The user list is used to store the identity identifiers assigned to the network test user and the other users when they register with the server. The first random element is randomly selected from the addition cyclic group. Step 103: Randomly select a first secret number corresponding to the network test user from the target non-zero integer set, and combine it with the first public key fragment corresponding to the network test user, the second public key fragments of other users, the first random element, and the first target integer coefficient to calculate the second random element belonging to the network test user; Step 104: Process the concatenation and combination of the first random number, the user list, and the second random element using the second hash function to obtain the second target integer coefficient corresponding to the network test user; Step 105: Generate an authentication value based on the private key fragment corresponding to the network test user, combined with the first secret number, the second target integer coefficient, and the first random element; Step 106: Based on the authentication information composed of the first random number, the second random number, and the authentication value received by the server, the server uses the authentication information to verify whether the target verification equation composed of bilinear mapping is true. Step 107: If true, then determine that the authentication information was generated by a registered network test user holding a valid private key fragment, and obtain a valid authentication result for the network test user.

[0023] This application provides a method for identity verification in mobile network testing, comprising: when a network test user initiates identity authentication to a server, verifying the server's identity based on RSA parameters; if the server's identity verification is successful, processing a concatenation of a second random number corresponding to other users in the user list (excluding the network test user), the user list, and a first random element based on a second hash function to obtain a first target integer coefficient corresponding to each other user; the second hash function is used to convert binary data of arbitrary length into elements in a multiplicative cyclic group; the user list is used to store the identity identifiers assigned to the network test user and the other users when they register with the server; the first random element is randomly selected from an additive cyclic group; and a first secret number corresponding to the network test user is randomly selected from the target non-zero integer set and combined with the first secret number corresponding to the network test user. Using a first public key fragment, second public key fragments of other users, the first random element, and the first target integer coefficient, a second random element belonging to the network test user is calculated. The concatenation of the first random number, the user list, and the second random element is processed using the second hash function to obtain the second target integer coefficient corresponding to the network test user. An authentication value is generated based on the private key fragment corresponding to the network test user, combined with the first secret number, the second target integer coefficient, and the first random element. The server receives authentication information composed of the first random number, the second random number, and the authentication value, and uses this authentication information to verify whether the target verification equation composed of bilinear mappings holds. If it holds, it is determined that the authentication information was generated by a registered network test user holding a valid private key fragment, resulting in a valid authentication result for the network test user. This approach has the following advantages: the dual verification process—first verifying the server's identity and then verifying the network test user's identity—ensures the authenticity of both identities and the unforgeability of the authentication. The server can only confirm that the network test user belongs to the user list, but cannot determine which specific user they are, thus protecting the privacy of the network test user's identity. It eliminates the need to provide usernames, passwords, or other identity information, improving the security of user authentication.

[0024] As a refinement of the embodiments of this application, when performing the verification of the server identity based on RSA parameters in step 101, the following implementation methods may also be adopted, but are not limited to: the network test user generates a first random number and sends it to the server; the server performs signature processing on the first random number using the RSA private key exponent and returns the signature result to the network test user; the network test user performs exponential operation processing on the signature result using the RSA public key exponent, and compares the exponential operation result with the hash result of the first random number; if the exponential operation result and the hash result are consistent, it indicates that the server identity verification is successful, the hash result is obtained by hashing the first random number based on the first hash function, the first hash function is used to convert a binary identity identifier of arbitrary length into an element in an additive cyclic group, and the RSA parameters include the RSA private key exponent and the RSA public key exponent.

[0025] To more clearly illustrate the detailed explanation of step 101 and the implementation process of steps 102 to 107, this application embodiment explains the implementation details in conjunction with formulas, including: the user sends a first random number r to the server, and the server calculates the signature result. Where H is a general hash function, n represents the modulus, and d represents the RSA private key exponent, and the signature result is... Returned to the user. The user received. Afterwards, inspection If the condition is not met, exit. Indicates the first hash function, where e represents the RSA public key exponent; otherwise, continue with the following steps: For ,from Select ,calculate ;from Select ,calculate ;calculate , Generate authentication and will Published to the blockchain. Here, j represents the user index, i represents the network test user index, and t represents the total number of users. Represents the addition cyclic group, Represents the first random element, Indicates the integer coefficient of the first objective. Indicates the second hash function, L represents the second random number, and L represents the user list. Represents the set of non-zero integers of the target. Represents the first secret number, Indicates the second random element, Represents the first public key fragment, Represents the second public key fragment, Indicates the integer coefficients of the second objective. Indicates authentication value, It is the user who sends a fragment of the private key. With dynamic parameters ( + Combined with the generated key fragment, This represents authentication information. The server retrieves this information from the blockchain. Afterwards, for ,calculate The system checks whether the target verification equation is true. If the equation is true, the verification result is uploaded to the blockchain, allowing the user to conduct subsequent network testing services; otherwise, the system refuses to provide services to the user.

[0026] As a refinement of the above embodiments, before the network test user initiates identity authentication to the server, the method may also adopt, but is not limited to, the following implementation methods, for example: constructing an additive cyclic group and a multiplicative cyclic group, both of which are prime numbers, wherein any two elements in the additive cyclic group are combined according to the bilinear mapping rule and mapped to a target element in the multiplicative cyclic group; calculating the target modulus based on the first prime number and the second prime number, wherein the first prime number and the second prime number are randomly generated during the RSA key generation process; calculating the Euler's totient function output value when the target modulus is used as the Euler's totient function input based on the first prime number and the second prime number, and selecting an RSA public key exponent that is coprime to the Euler's totient function output value, wherein the public key exponent is greater than 1 and less than the Euler's totient function output value. The public key value is calculated based on the Euler's totient function output value and the public key exponent, combined with a first constraint condition. The first constraint condition is that the remainder of the public key exponent multiplied by the RSA private key exponent divided by the Euler's totient function output value is 1. A second secret number is randomly selected from the target non-zero integer set, and the generator is calculated by raising the second secret number to the power of the generator to obtain the public key value. The target non-zero integer set is the set of all non-zero integers less than the first prime number and coprime to the first prime number. The generator is the generator of the first cryptographic cyclic group. A target public key set is constructed based on the modulus, the public key exponent, and the public key value, and a target private key set is constructed based on the RSA private key exponent and the second secret number. The target public key set is then published to the target blockchain.

[0027] To more clearly illustrate the implementation process of RSA parameter generation in the above embodiments, this application describes the implementation details in conjunction with the formula, including: selecting two large prime numbers, which are respectively the second prime number. and the first prime number Let the addition cyclic group Multiplication Cyclic Group The order is ,make for generator, Choose a hash function for a bilinear mapping. , ,calculate , ; Representing Euler's totient function, choosing and... Coprime RSA public key exponents ,satisfy ;calculate ,satisfy From the target set of non-zero integers Choose the second secret number ,calculate Generate the target public key set for the network testing platform. and target private key set and put Published on the blockchain.

[0028] As a refinement of the above embodiments, after constructing a target public key set based on the modulus, the public key exponent, and the public key value, and constructing a target private key set based on the RSA private key exponent and the second secret number, the method may also adopt, but is not limited to, the following implementation methods: when the network test user initiates identity registration with the server, the server randomly assigns a first target identity identifier to the network test user; the first target identity identifier is converted into an element of the addition cyclic group based on a first hash function to serve as the first public key fragment; the first public key fragment is signed based on the second secret number to obtain the private key fragment; the private key fragment is distributed to the network test user through a secure channel, and the first target identity identifier and the second target identity identifiers corresponding to the other users are published to the target blockchain.

[0029] To more clearly illustrate the implementation process of RSA parameter generation in the above embodiments, this application embodiment explains the implementation details in conjunction with formulas, including: the server generates a random identity identifier for network test user i. ,calculate and and through a secure channel Send to the user. for A set of user identities, where and will Published on the blockchain. Among them, Represents a binary set of finite length.

[0030] As a refinement of the above embodiments, after determining that the identity authentication is valid, the method may also adopt, but is not limited to, the following implementation methods, for example: uploading the identity authentication result to a target blockchain, the target blockchain also being used to store the authentication information; allowing the network test user to access the network test service interface to conduct network testing if the identity authentication result is determined to be valid; otherwise, refusing the network test user access to the service interface.

[0031] As a refinement of the above embodiments, when performing the network test, the following implementation methods may also be adopted, for example: running a network test algorithm based on the server and generating test records corresponding to the network test user.

[0032] As a refinement of the above embodiments, the method may also adopt, but is not limited to, the following implementation: based on the server maintaining test records corresponding to all users in the user list, and setting role-based access permissions in the server so that roles with access permissions can query and access the test records.

[0033] In some embodiments, the formula for the target verification equation is expressed as:

[0034] Where e represents the pairing function that creates a bilinear mapping relationship on both sides of the equation, y represents the public key value, t represents the total number of users in the user list, and j represents the user index, used to traverse all users in the user list. This indicates that the random element corresponding to user j belongs to the addition cyclic group. This represents a fragment of user j's public key. Let K represent the target integer coefficient corresponding to user j generated by the second hash function, K represent the key fragment, and g represent the generator of the additive cyclic group.

[0035] In summary, the embodiments of this application can achieve the following effects: The dual verification process, which first verifies the server's identity and then verifies the network test user's identity, ensures the authenticity of both identities and the unforgeability of the authentication. This allows the server to confirm that the network test user belongs to the user list, but not to determine which specific user it is, thus protecting the privacy of the network test user's identity and improving the security of user authentication.

[0036] The above are embodiments of the method proposed in this application. Based on the same inventive concept, embodiments of this application also provide an authentication device for mobile network testing, the structure of which is as follows: Figure 2 As shown.

[0037] Figure 2 This is a schematic diagram of the internal structure of a device for authentication in mobile network testing, provided as an embodiment of this application. Figure 2 As shown, the device includes: At least one processor 201; And a memory 202 that is communicatively connected to at least one processor; The memory 202 stores instructions that can be executed by at least one processor, which are executed by at least one processor 201 to enable at least one processor 201 to perform an authentication method for mobile network testing.

[0038] Some embodiments of this application provide corresponding to Figure 1 A non-volatile computer storage medium storing computer-executable instructions configured to perform an authentication method for mobile network testing.

[0039] The various embodiments in this application are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the embodiments for IoT devices and media are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

[0040] The systems, media, and methods provided in this application are one-to-one correspondences. Therefore, the systems and media also have similar beneficial technical effects as their corresponding methods. Since the beneficial technical effects of the methods have been described in detail above, the beneficial technical effects of the systems and media will not be repeated here.

[0041] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0042] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0043] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0044] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0045] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0046] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0047] Computer-readable media include both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0048] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0049] The above description is merely an embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principle of this application should be included within the scope of the claims of this application.

Claims

1. A method for authentication for mobile network testing, characterized in that, The method comprises: When a network test user initiates identity authentication to a server, verifying the identity of the server based on RSA parameters; If the identity of the server is verified, processing the spliced combination of a second random number corresponding to each user in a user list except the network test user, the user list and a first random element based on a second hash function to obtain a first target integer coefficient corresponding to each user, the second hash function being used to convert binary data of any length into an element in a multiplicative cyclic group, the user list being used to store identity identifiers assigned when the network test user and the other users register to the server, and the first random element being randomly selected from an additive cyclic group; Randomly selecting a first secret number corresponding to the network test user in a target non-zero integer set, and combining a first public key segment corresponding to the network test user, a second public key segment of the other users, the first random element and the first target integer coefficient to calculate a second random element belonging to the network test user; Processing the spliced combination of the first random number, the user list and the second random element by the second hash function to obtain a second target integer coefficient corresponding to the network test user; Generating an authentication value based on a private key segment corresponding to the network test user in combination with the first secret number, the second target integer coefficient and the first random element; Based on the server receiving authentication information composed of the first random number, the second random number and the authentication value, and using the authentication information to verify whether a target verification equation composed of a bilinear mapping is established; If yes, it is determined that the authentication information is generated by a registered network test user holding a legal private key segment, and an identity authentication result that the identity authentication of the network test user is valid is obtained.

2. The method for identity verification for mobile network testing according to claim 1, wherein, The verification of the identity of the server based on the RSA parameters comprises: The network test user generates a first random number and sends it to the server; Based on the server returning a signature result to the network test user after signing the first random number using an RSA private key exponent; Based on the network test user performing an exponential operation on the signature result using an RSA public key exponent, and comparing the exponential operation result with a hash result of the first random number; If the exponential operation result and the hash result are consistent, it means that the identity of the server is verified, the hash result is obtained by hashing the first random number based on a first hash function, the first hash function is used to convert binary identity identifiers of any length into an element in an additive cyclic group, and the RSA parameters include the RSA private key exponent and the RSA public key exponent.

3. The method for identity verification for mobile network testing according to claim 2, characterized in that, Before the network test user initiates identity authentication to the server, the method comprises: Constructing the additive cyclic group and the multiplicative cyclic group with a first prime number as the order, and mapping any two elements in the additive cyclic group to a target element in the multiplicative cyclic group based on a bilinear mapping rule; calculating a target modulus based on a first prime number and a second prime number, the first prime number and the second prime number being randomly generated in an RSA key generation process; calculating an Euler function output value when the target modulus is input into the Euler function based on the first prime number and the second prime number, and selecting an RSA public key exponent coprime with the Euler function output value, the public key exponent being greater than 1 and less than the Euler function output value; calculating an RSA private key exponent based on the Euler function output value and the public key exponent in combination with a first constraint condition, the first constraint condition being that a remainder of the public key exponent multiplied by the RSA private key exponent divided by the Euler function output value is 1; randomly selecting a second secret number from a target non-zero integer set, and performing a calculation of the second secret number power of a generator to obtain a public key value, the target non-zero integer set being a set of all non-zero integers less than the first prime number and coprime with the first prime number, and the generator being a generator of the first cryptographic cyclic group; constructing a target public key set based on the modulus, the public key exponent, and the public key value, and constructing a target private key set based on the RSA private key exponent and the second secret number, and publishing the target public key set to a target blockchain.

4. The method for identity verification for mobile network testing according to claim 3, characterized in that, After constructing the target public key set based on the modulus, the public key exponent, and the public key value, and constructing the target private key set based on the RSA private key exponent and the second secret number, the method comprises: when the network test user initiates identity registration to a server, randomly assigning a first target identity to the network test user by the server; converting the first target identity into an element in the additive cyclic group as the first public key fragment based on the first hash function; signing the first public key fragment based on the second secret number to obtain the private key fragment; downloading the private key fragment to the network test user based on a secure channel, and publishing the first target identity and a second target identity corresponding to the other user to the target blockchain.

5. The method of authentication for mobile network testing according to any of claims 1-4, characterized in that, After determining that the identity authentication is valid, the method comprises: uploading the identity authentication result to a target blockchain, the target blockchain also being used to store the authentication information; in a case where it is determined that the identity authentication result is valid, allowing the network test user to access a service interface of network testing to perform network testing; otherwise, denying the network test user to access the service interface.

6. The method for identity verification for mobile network test according to claim 5, characterized in that, The network testing comprises: running a network testing algorithm based on the server, and generating a test record corresponding to the network test user.

7. The method for identity verification for mobile network testing according to claim 6, characterized in that, The method comprises: maintaining test records corresponding to all users in the user list based on the server, and setting role-based access permissions in the server to allow roles with access permissions to query and access the test records.

8. The method for identity verification for mobile network testing according to claim 7, characterized in that, The formula of the target verification equation is: Wherein e represents a pairing function, so that there is a bilinear mapping relationship on both sides of the equation, y represents a public key value, t represents the total number of users in the user list, and j represents a user index to traverse all users in the user list, represents a random element corresponding to user j, which belongs to the additive cyclic group, represents a public key segment of user j, represents a target integer coefficient corresponding to user j generated by the second hash function, K represents a key segment, and g represents a generator of the additive cyclic group.

9. An apparatus for authentication for mobile network testing, the apparatus comprising: The device comprises: at least one processor; and a memory in communication connection with the at least one processor; The memory stores instructions executable by the at least one processor, which, when executed by the at least one processor, enables the at least one processor to perform an authentication method for mobile network testing as described in any one of claims 1-8.

10. A computer storage medium storing computer-executable instructions, which, when executed by a processor, cause the processor to perform acts comprising: When the computer-executable instructions are executed, they implement the authentication method for mobile network testing as described in any one of claims 1-8.

Images