Two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof

Abstract

The present invention relates to the field of electrical data processing technology, and in particular to a two-factor identity authentication method for intellectual property transactions based on an improved zero-knowledge proof. The method includes biometric and intellectual property feature authentication steps, wherein the biometric and intellectual property feature authentication steps include generating a zero-knowledge proof of the biometric feature and a zero-knowledge proof of the intellectual property feature. The zero-knowledge proof generation process includes: performing initial settings on a circuit and generating a public parameter P according to the designed circuit; calculating polynomials a(x), b(x), and c(x) on a multiplication subgroup H of order n; constructing a permutation constraint z(x); converting a gate constraint and a permutation constraint into a polynomial to construct a total constraint t(x); constructing a key intermediate function r(x); and constructing a polynomial commitment W at two points θ and θω, respectively. θ (x) and W θω (x), and then generate Plonk zero-knowledge proof π. The present invention can improve the efficiency of zero-knowledge proof generation and verification by improving zero-knowledge proof.

Description

Technical Field

[0001] The present invention relates to the technical field of electronic data processing, and in particular to a two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof. Background Art

[0002] Before the widespread internet, intellectual property transactions largely relied on traditional media such as books, magazines, films, patents, and trademarks, conducted through third-party institutions. This model not only incurred high transaction costs but was also prone to disputes. The rise of the internet has brought new opportunities for intellectual property transactions. Networked trading methods have broadened transaction channels and lowered barriers to entry. Blockchain technology, with its immutable and decentralized nature, offers a new solution for protecting intellectual property transactions. It ensures the authenticity of transaction data, effectively prevents fraud, and enables transaction traceability and clear division of responsibilities. Among the many blockchain technologies, consortium blockchain stands out for its efficient transaction performance and superior privacy protection. By limiting participating nodes, consortium blockchains ensure transaction efficiency while also protecting the privacy rights of participants. Applying consortium blockchain technology to intellectual property transactions promises to fundamentally improve transaction security and transparency, reduce transaction costs, shorten transaction cycles, and streamline the rights protection process.

[0003] Smart contracts are programs built on the blockchain that enable the digital transformation of contracts. These programs run automatically according to pre-set logic, executing the rules of the agreement without third-party intervention. Fingerprint recognition technology is now widely used, and its security is continuously improving with technological advancements and innovations. Zero-knowledge proof is a cryptographic protocol that allows a prover to prove a statement to a verifier without revealing any information beyond the statement's correctness. This ensures reliability, completeness, and zero-knowledge while also protecting privacy. However, existing technologies involve a high level of computational effort in generating zero-knowledge proofs, resulting in low efficiency in both generation and verification. Summary of the Invention

[0004] The purpose of the present invention is to provide a two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof, which can effectively ensure the authenticity and reliability of the transaction parties and the property rights identities during the intellectual property transaction process, and can also improve the efficiency of generating and verifying zero-knowledge proofs.

[0005] In order to achieve the above object, the present invention provides the following technical solutions:

[0006] In a first aspect, the present invention provides a two-factor identity authentication method for intellectual property transactions based on an improved zero-knowledge proof, including biometric and intellectual property feature authentication steps, wherein the biometric and intellectual property feature authentication steps include generating a zero-knowledge proof of the biometric feature and a zero-knowledge proof of the intellectual property feature, and the generation process of the zero-knowledge proof includes:

[0007] Initially set up the circuit and generate the public parameter P according to the designed circuit. w is the generator of H, H is a finite field Multiplicative subgroup on , X is a finite field A random element in , where x is a finite field polynomial on , srs is the structured reference string, q L (x),q R (x),q M (x),q O (x),q C (x) are all gate circuit polynomials, They are all permuted polynomials;

[0008] Compute the polynomials a(x), b(x), and c(x) over the multiplicative subgroup H of order n, where a(x) is the private input of the biometric or intellectual property feature, b(x) is the public input of the biometric or intellectual property feature after hashing in the database, and c(x) is the output;

[0009] Construct the permutation constraint z(x), n is the number of all gates in the circuit, d7~d9, β, and γ are all finite fields Randomly generate points, Z H (x) = x n -1, l i (x) is the Lagrange basis function on the multiplicative subgroup, k1 and k2 are both non-residues that are not equal to each other, σ(j) is the permutation function, For public input, The number of public inputs;

[0010] Convert the gate constraint and permutation constraint into a polynomial and construct the total constraint t(x). q L (x), q R (x), q M (x), q O(x) are all gate circuit polynomials, PI(x) is a public parameter, and α is a finite field Randomly generate points;

[0011] Construct the key intermediate function r(x), are all the values ​​of the function on θ, PI(θ) is a public parameter, Z H (θ)=θ n -1;

[0012] Construct polynomial commitment W at two points θ and θω respectively θ (x) and W θω (x), then generate the Plonk zero-knowledge proof π,

[0013] v is a finite field Randomly generate points.

[0014] The biometric and intellectual property authentication step also includes verifying the zero-knowledge proof of the biometric and the zero-knowledge proof of the intellectual property. The verification process of the zero-knowledge proof is as follows: calculating and verifying the relevant commitments [D]1, [F]1, and [E]1:

[0015] [D]1=[Poseidon(t(x)·Z H (x)]1+v 6 u·[z]1

[0016]

[0017] Verify e([W θ ]1+u·[W θω ]1,[X]2)=e(θ·[W θ ]1+uθ ω ·[W θω ]1+[F]1-[E]1,[1]2) is true. If the equality is true, it means the authentication is passed. If the equality is not true, it means the authentication is failed. u is a finite field. Randomly generate points.

[0018] In a second aspect, an embodiment of the present invention provides a two-factor identity authentication method for intellectual property transactions based on an improved zero-knowledge proof from a system perspective, comprising the following steps:

[0019] The supply-side client and the demand-side client register their user ID and login password in the alliance chain respectively;

[0020] The supply-side client and the demand-side client register their biometrics on the consortium chain respectively;

[0021] The supplier client registers an intellectual property transaction certificate on the alliance chain, which consists of an intellectual property introduction, a property identity generated by encrypting intellectual property features, transaction money, and access time;

[0022] The consortium chain authenticates the user ID and login password, and after passing the authentication, performs the biometric and intellectual property authentication steps; the biometric and intellectual property authentication steps include generating zero-knowledge proofs of biometrics and intellectual property. The generation process of the zero-knowledge proofs is as follows:

[0023] Initially set up the circuit and generate the public parameter P according to the designed circuit. w is the generator of H, H is a finite field Multiplicative subgroup on , X is a finite field A random element in , where x is a finite field polynomial on , srs is the structured reference string, q L (x),q R (x),q M (x),q O (x),q C (x) are all gate circuit polynomials, They are all permuted polynomials;

[0024] Compute the polynomials a(x), b(x), and c(x) over the multiplicative subgroup H of order n, where a(x) is the private input of the biometric or intellectual property feature, b(x) is the public input of the biometric or intellectual property feature after hashing in the database, and c(x) is the output;

[0025] Construct the permutation constraint z(x), n is the number of all gates in the circuit, d7~d9, β, γ are all randomly generated points in the finite field F, Z H (x) = x n -1, l i (x) is the Lagrange basis function on the multiplicative subgroup, k1 and k2 are both non-residues that are not equal to each other, σ(j) is the permutation function, For public input, The number of public inputs;

[0026] Convert the gate constraint and permutation constraint into a polynomial and construct the total constraint t(x). qL (x), q R (x), q M (x), q O (x) are all gate circuit polynomials, P I (x) is a public parameter, α is a finite field Randomly generate points;

[0027] Construct the key intermediate function r(x), are all the values ​​of the function on θ, PI(θ) is a public parameter, Z H (θ)=θ n -1;

[0028] Construct polynomial commitment W at two points θ and θω respectively θ (x) and W θω (x), then generate the Plonk zero-knowledge proof π,

[0029] v is a finite field Randomly generate points.

[0030] In a third aspect, the present invention provides a computer program product comprising computer-readable instructions, characterized in that when the computer-readable instructions are executed by a processor, the computer-readable instructions implement the steps of the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof of the present invention.

[0031] In a fourth aspect, the present invention provides a computer-readable storage medium comprising computer-readable instructions, characterized in that when the computer-readable instructions are executed by a processor, the steps of the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof of the present invention are implemented.

[0032] In a fifth aspect, the present invention provides an electronic device comprising: a memory storing program instructions; a processor connected to the memory, executing the program instructions in the memory, and implementing the steps of the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof of the present invention.

[0033] Compared with the prior art, the present invention has the following technical advantages:

[0034] The present invention proposes a dual-factor identity authentication mechanism that combines an ID password with biometrics and property rights. This mechanism ensures the reliability and authenticity of property rights and trader identity authentication, establishes an identity identifier generation method that combines fingerprint biometrics and intellectual property rights, and designs a constraint compression strategy based on Poseidon hashing. By compressing constraint conditions, the amount of data that needs to be processed during the verification and proof process is reduced, the workload of the zero-knowledge proof algorithm is reduced, the authentication efficiency is improved, the consistency of property rights and identities is achieved, and privacy protection in identity authentication is guaranteed.

[0035] For other advantages of the present invention, please refer to the relevant description in the embodiment section. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0037] Figure 1 2 is an architecture diagram of the identity authentication system in an embodiment of the present invention.

[0038] Figure 2 This is a timing flow chart of a two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof, as exemplified in the embodiments.

[0039] Figure 3 This is a block diagram of the composition of an electronic device. DETAILED DESCRIPTION

[0040] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0041] See also Figure 1In this embodiment, an identity authentication system is provided, including a supplier client, a demander client, a regulator client, a consortium chain, and a database. The supplier client refers to a client configured on the supplier side, the demander client refers to a client configured on the demander side, and the regulator client refers to a client configured on the regulator side. The supplier refers to the holder or entity with the right to dispose of intellectual property rights such as patents, trademarks, or copyrights, and can put its intellectual property resources on the market for trading or licensing. The demander refers to an individual or organization that needs to use or obtain intellectual property rights. The regulator refers to the entity responsible for supervising the intellectual property transaction process and ensuring the legality and compliance of the transaction. The consortium chain is a platform for intellectual property transactions. It ensures the normal progress of transactions by combining smart contracts. It can be used to record transaction information, ensure the integrity and authenticity of data, and protect identity privacy by combining cryptography and other technologies. The database is used to store user identity information, such as biometric features that have been hashed.

[0042] This embodiment provides a two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof. Figure 1 The identity authentication system shown in the figure is implemented. The method includes an ID password registration step, a biometric and intellectual property feature registration step, an ID password authentication step, and a biometric and intellectual property feature authentication step.

[0043] In the ID and password registration step, the supply-side client and the demand-side client register their user ID and login password in the alliance chain respectively.

[0044] In the biometric and intellectual property feature registration step, the supply-side client and the demand-side client register their biometrics on the alliance chain respectively. The supply-side client registers the intellectual property transaction certificate on the alliance chain, which consists of the intellectual property introduction, the property identity generated by encrypting the intellectual property features, the transaction amount, and the access time.

[0045] In the ID and password authentication step, the alliance chain authenticates the user ID and login password, and performs the biometric and intellectual property feature authentication steps after the authentication is passed;

[0046] In the biometric and intellectual property feature authentication steps, the consortium chain generates zero-knowledge proofs of the supplier's biometrics, the demander's biometrics, and the intellectual property feature respectively; the regulatory client verifies the zero-knowledge proofs of the biometrics and the intellectual property feature, and outputs the verification results.

[0047] In order to more clearly illustrate the method of the present invention, Figure 1 The system structure shown is arranged in chronological order to describe in detail the steps of the method of the present invention.

[0048] See also Figure 2 The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof includes the following steps:

[0049] S11, the supply-side client and the demand-side client send the user ID and login password for registration to the alliance chain respectively.

[0050] S12, the alliance chain determines whether the user ID and login password have been registered. If so, it prompts that the registration failed. If not, the user ID and login password are hashed and encrypted and saved in the alliance chain, and a prompt prompts that the registration is successful.

[0051] S13, the supply-side client and the demand-side client send biometrics to the alliance chain respectively.

[0052] Biometrics refer to unique features of each user, such as fingerprints, irises, voiceprints, etc. In this embodiment, fingerprints are preferably used as biometrics because fingerprint recognition technology is mature, reliable, and easy to implement.

[0053] S14, the consortium chain first encrypts the received biometrics using the Poseidon hash function, and then determines whether the hashed biometrics has been registered. If so, it prompts that the registration has failed. If not, it saves the hashed biometrics in the database and prompts that the registration is successful.

[0054] In the above method, the hashed user ID and login password are stored in separate locations from the hashed biometrics. This has the advantage of preventing complete information leakage in the event of an attack, but the disadvantage is that it is inconvenient to operate. Therefore, as an alternative implementation, the hashed user ID and login password and the hashed biometrics can also be stored in the database. This has the advantage of being easy to operate and can be modified to reset the user ID and login password even in the event of an attack.

[0055] On the one hand, using hash encryption technology to encrypt biometrics protects user privacy. On the other hand, encrypting the biometric before determining registration ensures that it is always processed and stored in encrypted form, improving data security. By encrypting the biometric before determining registration, the system only compares the hash value of the biometric, not the original biometric. This avoids storing the original biometric data during user registration, requiring only the hashed value, thereby enhancing data security. If registration is determined first and then encrypted, the original biometric data would need to be temporarily stored in the background, increasing potential data security issues. Modern encryption algorithms are highly computationally efficient for hash encryption operations. By determining registration after encryption, duplicate calculations are avoided, ensuring a fast system response. If judgment is performed first and then encryption is performed, multiple operations must be performed for each comparison (if judgment is performed first, the original biometric features are judged, and the original biometric features are also stored in the database, involving steps such as image processing, feature extraction, similarity calculation and matching decision. Encryption is to hash the biometric features and directly compare them with the encrypted hash values ​​in the database, reducing the steps of performing a series of operations on the original biometric features in the database), thereby reducing efficiency.

[0056] S15, the supplier client sends the supervisor client an intellectual property transaction certificate consisting of an intellectual property introduction, a property identity generated by encrypting intellectual property features, transaction money, and access time.

[0057] Intellectual property characteristics are unique attributes or identifiers that independently and clearly identify and represent a creation, invention, or innovation. They are important features used to prove the originality, ownership, and legitimacy of an idea, technology, design, work, or brand. Examples include patent application numbers, copyright registration numbers, and trademark registration numbers. A property identity identifier is a unique identifier generated by encrypting intellectual property characteristics.

[0058] S16: The supervisory client verifies the authenticity of the intellectual property transaction certificate. Once the certificate passes the verification, it is published on the consortium chain to complete the property rights identity registration. After the release, the demander can view the relevant information.

[0059] S17, the demander client initiates a transaction request for the intellectual property transaction certificate to the alliance chain and provides the user ID and login password.

[0060] After seeing the published intellectual property transaction certificate, the demander can initiate a transaction request if he wants to trade and provide his user ID and login password for identity authentication.

[0061] S18, the alliance chain first determines whether the user ID has been registered. If not, it prompts that the authentication failed. If so, it further determines whether the user ID and login password match. If they match, it prompts that the identity authentication is successful, otherwise it prompts that the identity authentication failed.

[0062] S19, the consortium chain parses the property identity from the intellectual property transaction certificate, and generates a zero-knowledge proof of the supplier's biometrics and the intellectual property characteristics based on the property identity, and simultaneously generates a zero-knowledge proof of the demander's biometrics, and sends the three zero-knowledge proofs to the regulatory client.

[0063] Zero-knowledge proof is a cryptographic protocol that allows a prover to prove to a verifier that a statement is correct without revealing any information beyond the correctness of the statement. This ensures reliability, completeness, and zero-knowledge while also protecting privacy. Plonk (Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge) is a zero-knowledge proof algorithm for a general trusted setup. However, existing technologies for generating zero-knowledge proofs require a large amount of computation, resulting in low efficiency in both the generation and verification of zero-knowledge proofs. Therefore, improvements are made in this embodiment.

[0064] Specifically, in this embodiment, the process of generating a zero-knowledge proof includes the following steps:

[0065] Initialization step: Initialize the circuit's SRS (Structure Reference String). Since the Plonk zero-knowledge proof algorithm is universally trusted, only one communication trust setup is required. Public parameters P are then generated based on the designed circuit, including the initial settings and circuit parameters.

[0066]

[0067] Where w is the generator of H, and H is a finite field Multiplicative subgroup on , X is a finite field A random element in , where x is a finite field polynomial on , srs is the structured reference string, q L (x),q R (x),q M (x),q O (x),q C (x) are all gate circuit polynomials, are all permuted polynomials.

[0068] Zero-knowledge proof generation steps: Generating a zero-knowledge proof based on the public parameter P is divided into the following five steps:

[0069] ① Calculate the polynomials a(x), b(x), and c(x) on the multiplicative subgroup H of order n (the number of all gates in the circuit), where a(x) is the private input of the biometric or intellectual property feature, b(x) is the public input of the biometric or intellectual property feature after hash encryption in the database, and c(x) is the output to determine whether they are equal. If the output is 0, it indicates that the private input is equal to the public input, and if it is not 0, it indicates that they are not equal.

[0070] For the zero-knowledge proof of the supplier's biometric feature, a(x) is the supplier's fingerprint feature (the fingerprint is used as the biometric feature in this embodiment), and b(x) is the supplier's hashed fingerprint feature in the database (the hash value of the fingerprint feature after hash encryption).

[0071] For the zero-knowledge proof of intellectual property characteristics, a(x) is the intellectual property characteristics provided by the supplier, and b(x) is the property identity generated by encrypting the intellectual property characteristics in the database.

[0072] For the zero-knowledge proof of the demander's biometrics, a(x) is the demander's fingerprint feature, and b(x) is the hashed fingerprint feature of the demander in the database.

[0073] Assume that the supplier's ID is Zhang San, the password is zs123456, the fingerprint feature information is: [112,215,443,675,312,88,399], the encrypted fingerprint value is: 0x12a8e84ff7bbab1a6df2a8b1c 1e3d41e, and the patent number is 2024101234567; the demander's ID is Li Si, the password is ls876543, the fingerprint feature information is: [98,203,512,612,243,371,415], the encrypted fingerprint value is: 0x39b17431 c85a2f6c9a94d118ab3b712, and he wants to purchase the patent with the patent number 2024101234567.

[0074] Then the supplier generates two zero-knowledge proofs. The first is the zero-knowledge proof generated for the fingerprint feature. The supplier's private input a(x) = [112, 215, 443, 675, 312, 88, 399], the database's public input b(x) = 0x12a8e84ff7bbab1a6df2a8b1c 1e3d41e, and c(x) = Poseidon(a(x)) - b(x).

[0075] Next is the zero-knowledge proof of the intellectual property characteristics, the supplier’s private input a(x) = 2024101234567, the transaction certificate’s public input b(x) = 14955398461486918612224948047800673637201827524444440272015501184381024346545, c(x) = Poseidon(a(x)) - b(x).

[0076] The demander generates a zero-knowledge proof, which is a zero-knowledge proof of the fingerprint feature. The demander's private input is a(x) = [98, 203, 512, 612, 243, 371, 415], the database's public input is b(x) = 0x39b17431c85a2f6c9a94d118ab3b712, and c(x) = Poseidon(a(x)) - b(x).

[0077] To make c(x) easier to understand, let's simplify it and give a simple example. Suppose the generator of group H is g, which has order 5. So group H contains 5 elements, represented by {g0, g1, g2, g3, g4}.

[0078] For example, suppose the private input a(x) = 3, representing the supplier's identity information; the public input b(x) is the encrypted fingerprint feature in the database, b(x) = g3. The hash function maps the input directly to an element in the group H, that is, H(3) = g3. Then c(x) = H(a(x)) - b(x) = g3 - g3 = 0, indicating that the private input and the public input are equal.

[0079] For example, suppose the private input a(x) = 2, representing the supplier's identity information; the public input b(x) is the encrypted fingerprint feature in the database, b(x) = g4. The hash function maps the input directly to an element in the group H, that is, H(2) = g2. Then c(x) = H(a(x)) - b(x) = g2 - g4c(x) = H(a(x)) - b(x) = g2 - g4. Since g2 ≠ g4 (the group elements are not equal), c(x) ≠ 0, which means that the private input and the public input are not equal.

[0080] ②Construct the permutation constraint z(x).

[0081]

[0082] n is the number of all gates in the circuit, d7~d9, β, and γ are all finite fields Randomly generate points, Z H (x) = x n -1, l i(x) is the Lagrange basis function on the multiplicative subgroup, k1 and k2 are both non-residues that are not equal to each other, σ(j) is the permutation function, For public input, The number of public inputs.

[0083] ③Convert the gate constraint and permutation constraint into a polynomial and construct the total constraint t(x).

[0084]

[0085] q L (x), q R (x), q M (x), q O (x) are all gate circuit polynomials, PI(x) is a public parameter, and α is a finite field Randomly generate points.

[0086] ④ Construct the key intermediate function r(x), which encapsulates the components that need to be kept confidential during the proof process.

[0087]

[0088] are all the values ​​of the function on θ, PI(θ) is a public parameter, Z H (θ)=θ n -1,

[0089] Because the maximum degree of a polynomial commitment is n+2, a power reduction operation is required. The original algorithm splits the total constraint into three parts, which is computationally intensive. This paper improves upon the Poseidon hash function and employs a compression strategy, reducing the computational complexity of the original algorithm and simplifying the proof size. Specifically, a constraint compression strategy based on the Poseidon hash is designed for generating zero-knowledge proofs. This reduces the amount of data required for verification and proof processing, lowering complexity while also improving the efficiency of generating and verifying zero-knowledge proofs.

[0090] ⑤ Construct a polynomial commitment at points θ and θω to generate the Plonk zero-knowledge proof π. Equation (4) represents the polynomial commitment at point θ, and Equation (5) represents the polynomial commitment at θω.

[0091]

[0092] v is a finite field Randomly generate points.

[0093] The final zero-knowledge proof generated is:

[0094]

[0095] S20, the supervisory client verifies the zero-knowledge proof of the supplier's identity information, the zero-knowledge proof of the intellectual property identity information, and the zero-knowledge proof of the demander's identity information respectively, verifies whether the elements in the zero-knowledge proof π satisfy the properties of the group and domain, and outputs the result of whether the verification is passed.

[0096] The relevant commitments are calculated and verified as shown in formulas (6), (7), and (8).

[0097] [D]1=[Poseidon(t(x)·ZH(x)]1+v 6 u·[z]1 (6)

[0098]

[0099] e([Wθ]1+u·[Wθω]1,[X]2)=e(θ·[Wθ]1+uθω·[Wθω]1+[F]1-[E]1,[1]2) (9)

[0100] u is a finite field Randomly generate points.

[0101] Finally, the bilinear mapping verification of formula (9) proves that if the equation holds, it means that the input identity information is consistent with the actual one, and the fingerprint and property identity authentication stage has been successfully passed. If the equation does not hold, it means that the input identity information is inconsistent with the actual one, and there may be identity impersonation behavior, and the regulator will conduct further supervision.

[0102] The meanings of the characters that may be involved in the generation and verification of zero-knowledge proofs are shown in the following table:

[0103]

[0104] like Figure 3 As shown, this embodiment also provides an electronic device, which may include a processor 41 and a memory 42, wherein the memory 42 is coupled to the processor 41. It is worth noting that this figure is exemplary, and other types of structures may be used to supplement or replace this structure to implement data extraction, report generation, communication or other functions.

[0105] like Figure 3 As shown, the electronic device may further include: an input unit 43, a display unit 44 and a power supply 45. It is worth noting that the electronic device does not necessarily have to include Figure 3 In addition, electronic devices may also include Figure 3 For components not shown, reference may be made to the prior art.

[0106] The processor 41 is sometimes also called a controller or an operation control, and may include a microprocessor or other processor devices and / or logic devices. The processor 41 receives inputs and controls the operations of various components of the electronic device.

[0107] The memory 42 may be, for example, one or more of a cache, flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory, or other suitable devices, and may store information such as configuration information of the processor 41 and instructions executed by the processor 41. The processor 41 may execute programs stored in the memory 42 to implement information storage or processing. In one embodiment, the memory 42 also includes a buffer memory to store intermediate information.

[0108] An embodiment of the present invention further provides a computer program product, comprising computer-readable instructions. When the computer-readable instructions are executed in an electronic device, the program product enables the electronic device to perform the operating steps included in the method of the present invention.

[0109] An embodiment of the present invention further provides a storage medium storing computer-readable instructions, wherein the computer-readable instructions enable an electronic device to execute the operation steps included in the method of the present invention.

[0110] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the above description has generally described the composition and steps of each example according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0111] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0112] The above-described embodiments are merely specific implementations of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications, substitutions, and improvements within the technical scope disclosed in the present invention, and such modifications, substitutions, and improvements are intended to be encompassed within the scope of protection of the present invention. Therefore, the scope of protection of the present invention shall be subject to the scope of protection of the claims.

Claims

1. A two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof, characterized in that: The method includes the steps of authenticating biometric features and intellectual property features, wherein the steps include generating zero-knowledge proofs of biometric features and intellectual property features, and the generation process of the zero-knowledge proofs includes: Initially set up the circuit and generate the public parameter P according to the designed circuit. w is the generator of H, H is a finite field Multiplicative subgroup on , X is a finite field A random element in , where x is a finite field polynomial on , srs is the structured reference string, q L (x),q R (x),q M (x),q O (x),q C (x) are all gate circuit polynomials, They are all permuted polynomials; Compute the polynomials a(x), b(x), and c(x) over the multiplicative subgroup H of order n, where a(x) is the private input of the biometric or intellectual property feature, b(x) is the public input of the biometric or intellectual property feature after hashing in the database, and c(x) is the output; Construct the permutation constraint z(x), n is the number of all gates in the circuit, d7~d9, β, and γ are all finite fields Randomly generate points, Z H (x) = x n -1, l i (x) is the Lagrange basis function on the multiplicative subgroup, k1 and k2 are both non-residues that are not equal to each other, σ(j) is the permutation function, (w j ) j∈[e] is the common input, e is the number of common inputs; Convert the gate constraint and permutation constraint into a polynomial and construct the total constraint t(x). q L (x), q R (x), q M (x), q O (x) are all gate circuit polynomials, P I (x) is a public parameter, α is a finite field Randomly generate points; Construct the key intermediate function r(x), are all the values ​​of the function on θ, PI(θ) is a public parameter, Z H (θ)=θ n -1; is the value of the z(x) function on θω; Construct polynomial commitment W at two points θ and θω respectively θ (x) and W θω (x), then generate the Plonk zero-knowledge proof π, v is a finite field Randomly generate points; [a]1, [b]1, [z]1, [Poseidon(t(x)·Z H (x))]1、[W θ ]1. [W θω ]1are a·g1, b·g1, z·g1, Poseidon(t(x)·Z H (x))·g1、W θ g1, W θω ·g1 is the g1 group in the generator Operations on .

2. The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof according to claim 1 is characterized in that: The biometric and intellectual property authentication step also includes verifying the zero-knowledge proof of the biometric and the zero-knowledge proof of the intellectual property. The verification process of the zero-knowledge proof is as follows: calculating and verifying the relevant commitments [D]1, [F]1, and [E]1: [D]1=[Poseidon(t(x)·Z H (x)]1+v 6 u·[z]1 Verify e([W θ ]1+u·[W θω ]1,[X]2)=e(θ·[W θ ]1+uθω·[W θω ]1+[F]1-[E]1,[1]2) is true. If the equality is true, it means the authentication is passed. If the equality is not true, it means the authentication is failed. u is a finite field. Randomly generate points; [X]2 is X·g2 where the generator is the g2 group Operation on [1]2 is 1·g2 with the generator being the g2 group Operations on .

3. The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof according to claim 1 is characterized in that: The biometric feature is a fingerprint feature.

4. The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof according to claim 1 is characterized in that: An ID password authentication step is also included before the biometric and intellectual property feature authentication step. The ID password authentication step is as follows: first, it is determined whether the user ID has been registered. If not, the authentication failure is prompted and the biometric and intellectual property feature authentication step is not executed; if it has been registered, it is further determined whether the user ID and the login password match. If they match, the identity authentication is successful and the biometric and intellectual property feature authentication step is executed. Otherwise, the identity authentication failure is prompted and the biometric and intellectual property feature authentication step is not executed.

5. The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof according to claim 4 is characterized in that: Before the ID password authentication step, an ID password registration step is also included, and the ID password registration step includes: Receive the user ID and login password provided by the user, and determine whether the user ID and login password have been registered. If so, prompt that the registration failed. If not, the user ID and login password are hashed and saved, and prompt that the registration is successful.

6. The two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof according to claim 4 is characterized in that: Before the ID password authentication step, a biometric feature and intellectual property feature registration step is also included, and the biometric feature and intellectual property feature registration step includes: Receive the biometrics provided by the user, encrypt the received biometrics using the Poseidon hash function, and then determine whether the hashed biometrics has been registered. If so, it will prompt that the registration failed. If not, it will save the hashed biometrics and prompt that the registration was successful. Receive the intellectual property transaction certificate provided by the user, which consists of the intellectual property introduction, the property identity generated by encrypting the intellectual property characteristics, the transaction amount, and the access time. After the authenticity of the intellectual property transaction certificate is verified and passed, it will be published on the alliance chain to complete the property identity registration.

7. A two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof, characterized in that: The following steps are involved: The supply-side client and the demand-side client register their user ID and login password in the alliance chain respectively; The supply-side client and the demand-side client register their biometrics on the consortium chain respectively; The supplier client registers an intellectual property transaction certificate on the alliance chain, which consists of an intellectual property introduction, a property identity generated by encrypting intellectual property features, transaction money, and access time; The consortium chain authenticates the user ID and login password, and after passing the authentication, performs the biometric and intellectual property authentication steps; the biometric and intellectual property authentication steps include generating zero-knowledge proofs of biometrics and intellectual property. The generation process of the zero-knowledge proofs is as follows: Initially set up the circuit and generate the public parameter P according to the designed circuit. w is the generator of H, H is a finite field Multiplicative subgroup on , X is a finite field A random element in , where x is a finite field polynomial on , srs is the structured reference string, q L (x),q R (x),q M (x),q O (x),q C (x) are all gate circuit polynomials, They are all permuted polynomials; Compute the polynomials a(x), b(x), and c(x) over the multiplicative subgroup H of order n, where a(x) is the private input of the biometric or intellectual property feature, b(x) is the public input of the biometric or intellectual property feature after hashing in the database, and c(x) is the output; Construct the permutation constraint z(x), n is the number of all gates in the circuit, d7~d9, β, and γ are all finite fields Randomly generate points, Z H (x) = x n -1, l i (x) is the Lagrange basis function on the multiplicative subgroup, k1 and k2 are both non-residues that are not equal to each other, σ(j) is the permutation function, (w j ) j∈[l] is the common input, l is the number of common inputs; Convert the gate constraint and permutation constraint into a polynomial and construct the total constraint t(x). q L (x), q R (x), q M (x), Q O (x) are all gate circuit polynomials, PI(x) is a public parameter, and α is a finite field Randomly generate points; Construct the key intermediate function r(x), are all the values ​​of the function on θ, PI(θ) is a public parameter, Z H (θ)=θ n -1; is the value of the z(x) function on θω; Construct polynomial commitment W at two points θ and θω respectively θ (x) and W θω (x), then generate the Plonk zero-knowledge proof π, v is a finite field Randomly generate points; [a]1, [b]1, [z]1, [Poseidon(t(x)·Z H (x))]1、[W θ ]1. [W θω ]1are a·g1, b·g1, z·g1, Poseidon(t(x)·Z H (x))·g1、W θ g1, W θω ·g1 is the g1 group in the generator Operations on .

8. A computer program product comprising computer-readable instructions, characterized in that: When executed by a processor, the computer-readable instructions implement the steps in the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof as described in any one of claims 1 to 6 or claim 7.

9. A computer-readable storage medium comprising computer-readable instructions, characterized in that: When executed by a processor, the computer-readable instructions implement the steps in the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof as described in any one of claims 1 to 6 or claim 7.

10. An electronic device, characterized in that: include: Memory, which stores program instructions; A processor is connected to the memory and executes program instructions in the memory to implement the steps in the two-factor identity authentication method for intellectual property transactions based on improved zero-knowledge proof as described in any one of claims 1 to 6 or claim 7.

Images