Blockchain-based digital equity resource signature verification method and system

Abstract

The application provides a kind of digital rights resources signature verification method and system based on block chain, it is related to the field of block chain technology.The method collects the signature of each specific permission node and the signature of each double permission node by signature verifier, if the number of specific permission node signature is equal to, then the verifier collects the signature of each ordinary permission node;If the sum of the number of signatures of double permission node and ordinary permission node is greater than or equal to t, then signature verification is carried out based on the preset elliptic curve public key cryptography algorithm, the allocation purpose of specific permission node is realized, the participants are signed with specific permission and ordinary permission qualification respectively, signature verification is carried out when the demand condition of specific permission is met, which greatly increases the signature verification efficiency of specific permission in the process of digital rights resources transaction, reduces the possibility of collusion and other destruction of consensus existence, thereby ensuring the validity of digital rights resources transaction in block chain signature verification.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and in particular to a blockchain-based digital rights resource signature verification method and system. Background Technology

[0002] To provide smart contract developers with a more flexible trust model, the underlying blockchain platform of the digital bond system adopts an "endorsement-ordering-verification" approach to verify digital bond transactions, ensuring the legality and consistency of the transaction content. Specifically, when digital bonds, as digital equity resources, are endorsed, ordered, and verified through the consortium blockchain network, the consistency of the blockchain ledger must be maintained. Therefore, the blockchain system allows managers to set strategies to designate specific consortium institutions to participate in smart contract execution and transaction consensus.

[0003] Currently, the existing methods for signature verification in consortium blockchains typically involve participating institutions generating private and public keys, a signing institution signing the key, and then a verifying institution verifying the private key, public key, and signature. However, nodes involved in key generation, signing, and verification require identical transaction decision-making authority. This can easily lead to business risks. In digital bond transactions, some participating institutions, in pursuit of their own interests, may refuse to provide services or collude to undermine consensus, causing signature verification to fail and thus affecting the effective trading of digital bonds. Summary of the Invention

[0004] In view of the above problems, this application is made to provide a blockchain-based digital rights resource signature verification method and system that overcomes or at least partially solves the above problems. The technical solution is as follows:

[0005] Firstly, a blockchain-based digital rights resource signature verification method is provided. The blockchain-based digital rights resource signature includes n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for the nodes with specific permissions is [value missing]. Let's call a specific permission node that is being regulated and simultaneously acts as a regular permission node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: A specific permission node and t ordinary permission nodes submit correctly signed shards;

[0006] The method includes: an initialization step, a secret sharing fragment generation step, a signature generation step, and a signature verification step;

[0007] Initialization steps: Based on the first private key and first random parameters generated by the key generation center, construct the shared secret shards used to generate each specific permission node. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial;

[0008] Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ;

[0009] Calculate the first public key and the second public key using the first private key, the second private key, and the base points on the elliptic curve;

[0010] The steps for generating a secret shard are as follows: select identifiers for m specific permission nodes and select identifiers for nm ordinary permission nodes;

[0011] based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes;

[0012] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes;

[0013] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes;

[0014] Signature generation steps: Each node with specific permissions calculates and broadcasts the product of the first parameter secret fragment and the base point on the elliptic curve; each node with dual permissions calculates and broadcasts the product of the second parameter secret fragment and the base point on the elliptic curve; each node with ordinary permissions calculates and broadcasts the product of the parameter secret fragment and the base point on the elliptic curve.

[0015] When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights and resources, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual permission node, the first and second shared secret fragments of each ordinary permission node, and the signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated.

[0016] Signature verification steps: The verifier collects the signatures of each specific permission node and the signatures of each dual-permission node. If the number of signatures from a specific permission node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

[0017] Secondly, a blockchain-based digital rights resource signature verification system is provided. The blockchain-based digital rights resource signature system includes n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for the nodes with specific permissions is [value missing]. There are n nodes, where all nodes with specific permissions can be controlled to function as ordinary nodes. We can call a node with specific permissions that is controlled to function as an ordinary node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: A specific permission node and t ordinary permission nodes submit correctly signed shards;

[0018] The system includes: an initialization unit, a secret sharing fragment generation unit, a signature generation unit, and a signature verification unit;

[0019] Initialization unit: Used to construct shared secret shards for generating each specific permission node based on the first private key and first random parameters generated by the key generation center. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial;

[0020] Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ;

[0021] Calculate the first public key and the second public key using the first private key, the second private key, and the base points on the elliptic curve;

[0022] Shared secret shard generation unit: used to select identifiers for m specific permission nodes and nm ordinary permission nodes;

[0023] based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes;

[0024] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes;

[0025] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes;

[0026] Signature generation unit: used for each specific permission node to calculate and broadcast the product of the first parameter secret fragment and the base point on the elliptic curve, each dual permission node to calculate and broadcast the product of the second parameter secret fragment and the base point on the elliptic curve, and each ordinary permission node to calculate and broadcast the product of the parameter secret fragment and the base point on the elliptic curve.

[0027] When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights and resources, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual permission node, the first and second shared secret fragments of each ordinary permission node, and the signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated.

[0028] Signature Verification Unit: Used by the verifier to collect signatures from each specific authorization node and each dual authorization node. If the number of signatures from a specific authorization node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

[0029] Using the above technical solution, the blockchain-based digital rights resource signature verification method and system provided in this application collects the signatures of each specific authority node and the signatures of each dual authority node through the signature verification party. If the number of signatures of the specific authority node is equal to... The verifier collects signatures from each ordinary permission node. If the total number of signatures from dual-permission nodes and ordinary permission nodes is greater than or equal to t, then signature verification is performed based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights resource, the signatures of each specific permission node, the signatures of each dual-permission node, the signatures of each ordinary permission node, the first public key, and the second public key. This achieves the purpose of allocating specific permission nodes, and allows participants to sign with specific and ordinary permission qualifications respectively. When the requirements of specific permissions are met, signature verification is performed, which greatly increases the efficiency of signature verification of specific permissions in the transaction of digital rights resources (such as digital bonds, funds, etc.), reduces the possibility of collusion and other consensus-breaking activities, and thus ensures the validity of digital rights resource transactions with signature verification in the blockchain. Attached Figure Description

[0030] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the description of the embodiments of this application will be briefly introduced below.

[0031] Figure 1 A flowchart of a blockchain-based digital rights resource signature verification method provided in an embodiment of this application is shown;

[0032] Figure 2 This illustration shows a schematic diagram of the composition of the blockchain-based digital rights resource signature verification mechanism provided in an embodiment of this application;

[0033] Figure 3 This illustration shows an exchange diagram of the MtA secure conversion protocol based on homomorphic encryption algorithm to implement dot multiplication to addition, provided in an embodiment of this application.

[0034] Figure 4 A structural diagram of the blockchain-based digital rights resource signature verification system provided in this application embodiment is shown. Detailed Implementation

[0035] Exemplary embodiments of the present application will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this application will be thorough and complete, and will fully convey the scope of the present application to those skilled in the art.

[0036] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such use can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the term "comprising" and its variations should be interpreted as open-ended terms meaning "including but not limited to."

[0037] To address the aforementioned technical problems, this application provides a blockchain-based digital rights resource signature verification method. The blockchain-based digital rights resource signature includes n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for the nodes with specific permissions is [value missing]. Let's call a specific permission node that is being regulated and simultaneously acts as a regular permission node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: One node with specific permissions and t nodes with ordinary permissions submit correctly signed shards.

[0038] In this embodiment, the digital rights and resources used in multi-party transactions in the blockchain may include, but are not limited to, digital bonds, funds, etc. Each participant in the blockchain (i.e., each participating node) is divided into specific permission nodes and ordinary permission nodes as signing institutions. Specific permission nodes can also be controlled to act as ordinary permission nodes at the same time.

[0039] like Figure 1 As shown, the blockchain-based digital rights resource signature verification method may include the following steps S101 to S104:

[0040] Step S101, initialization step.

[0041] Initialization steps: Based on the first private key and first random parameters generated by the key generation center, construct the shared secret shards used to generate each specific permission node. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial;

[0042] Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ;

[0043] Calculate the first and second public keys using the first private key, the second private key, and the base points on the elliptic curve.

[0044] Step S102: Share the secret shard generation steps.

[0045] The steps for generating a secret shard are as follows: select identifiers for m specific permission nodes and select identifiers for nm ordinary permission nodes;

[0046] based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes;

[0047] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes;

[0048] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes.

[0049] Step S103, signature generation step.

[0050] Signature generation steps: Each node with specific permissions calculates and broadcasts the product of the first parameter secret fragment and the base point on the elliptic curve; each node with dual permissions calculates and broadcasts the product of the second parameter secret fragment and the base point on the elliptic curve; each node with ordinary permissions calculates and broadcasts the product of the parameter secret fragment and the base point on the elliptic curve.

[0051] When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated using the product of the parameter secret shards and the base points on the elliptic curve, the original message of the digital rights resource, the first and second shared secret shards of each specific permission node, the third and fourth shared secret shards of each dual permission node, and the first and second shared secret shards of each ordinary permission node.

[0052] Step S104, signature verification step.

[0053] Signature verification steps: The verifier collects the signatures of each specific permission node and the signatures of each dual-permission node. If the number of signatures from a specific permission node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

[0054] This embodiment collects the signatures of each specific permission node and the signatures of each dual-permission node through a signature verification party. If the number of signatures of a specific permission node equals... The verifier collects signatures from each ordinary permission node. If the total number of signatures from dual-permission nodes and ordinary permission nodes is greater than or equal to t, then signature verification is performed based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights resource, the signatures of each specific permission node, the signatures of each dual-permission node, the signatures of each ordinary permission node, the first public key, and the second public key. This achieves the purpose of allocating specific permission nodes, and allows participants to sign with specific and ordinary permission qualifications respectively. When the requirements of specific permissions are met, signature verification is performed, which greatly increases the efficiency of signature verification of specific permissions in the transaction of digital rights resources (such as digital bonds, funds, etc.), reduces the possibility of collusion and other consensus-breaking activities, and thus ensures the validity of digital rights resource transactions with signature verification in the blockchain.

[0055] See Figure 2As shown, the key generation center generates a first private key, a first random parameter, a second private key, and a second random parameter. Using the first and second private keys and the base points on the elliptic curve, it calculates the first and second public keys. m specific-authority nodes and nm ordinary-authority nodes generate their respective shared secret shards and signatures. Each specific-authority node can be manipulated to act as an ordinary-authority node; we can call a specific-authority node that is manipulated to act as an ordinary-authority node a dual-authority node. The signature verifier collects the signatures from each specific-authority node and the signatures from each dual-authority node. If the number of signatures from each specific-authority node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

[0056] This application provides a possible implementation method. In order to achieve effective signature verification between specific authorized nodes and ordinary authorized nodes, and to greatly reduce computational overhead, in the initialization step S101, a shared secret fragment for generating each specific authorized node is constructed based on the first private key and the first random parameters generated by the key generation center. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomials include:

[0057] Combining the preset elliptic curve public-key cryptography algorithm, and based on the first private key generated by the key generation center. Build for each specific permission node to generate Sharing secrets and fragments -1st degree first secret polynomial and used for generation Sharing secrets and fragments -1 degree second secret polynomial; and

[0058] Based on the first random parameter generated by the key generation center Build for each specific permission node to generate Sharing secrets and fragments -1 degree parametric polynomial.

[0059] This application provides one possible implementation method in its embodiments. The -1 degree first secret polynomial is as follows:

[0060] ;

[0061] in, yes -1 random number, as -1st degree first secret polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions;

[0062] The -1 degree second secret polynomial is as follows:

[0063] ;

[0064] in, yes -1 random number, as -1st degree second secret polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions;

[0065] The -1 degree parametric polynomial is as follows:

[0066] ;

[0067] in, yes -1 random number, as -1 degree parameter polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions.

[0068] This application embodiment provides a possible implementation method. In the initialization step S101, based on the second private key and second random parameters generated by the key generation center, a first secret polynomial of degree t-1, a second secret polynomial of degree t-1, and a parameter polynomial of degree t-1 for generating shared secret shards for each dual-authority node and each ordinary-authority node are constructed, including:

[0069] Combining a pre-defined elliptic curve public-key cryptography algorithm with a second private key generated by the key generation center. For each dual-authority node and each ordinary-authority node, construct a system for generating... The shared secret fragments of the first secret polynomial of degree t-1 are used to generate The shared secret partition of the second secret polynomial of degree t-1; and

[0070] Based on the second random parameter generated by the key generation center For each dual-authority node and each ordinary-authority node, construct a system for generating... The shared secret is the t-1 degree parametric polynomial of the segmentation.

[0071] This application provides a possible implementation method, where the first secret polynomial of degree t-1 is as follows:

[0072] ;

[0073] in, These are t-1 random numbers, used as the first secret polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes;

[0074] The second secret polynomial of degree t-1 is as follows:

[0075] ;

[0076] in, These are t-1 random numbers, used as the second secret polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes;

[0077] The t-1 degree parametric polynomial is as follows:

[0078] ;

[0079] in, These are t-1 random numbers, used as the parameter polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes.

[0080] This application embodiment provides a possible implementation method in which, in step S102, the secret fragment generation step, identifiers are selected for m specific permission nodes and identifiers are selected for nm ordinary permission nodes, including:

[0081] Select an identifier for m specific permission nodes , ;as well as

[0082] Select an identifier for nm ordinary permission nodes , .

[0083] This application embodiment provides a possible implementation method. In step S102, the secret fragment generation step is based on... -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each of the m specific permission nodes, including:

[0084] based on -1st degree first secret polynomial , -1st degree second secret polynomial , -1 degree parameter polynomial and the identifiers of m specific permission nodes. Calculate the first shared secret shard of each of the m specific permission nodes. Second, share the secret fragments. Secret partitioning with the first parameter They are as follows:

[0085] ;

[0086] ;

[0087] ;

[0088] in, It is Lagrange interpolation. .

[0089] This application embodiment provides a possible implementation method. In step S102, the secret fragment generation step is based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parameter polynomial of degree t-1, and... Each dual-authority node has its own identifier, and the calculation is performed. The third shared secret shard, fourth shared secret shard, and second parameter secret shard of each dual-authority node include:

[0090] Based on the first secret polynomial of degree t-1 t-1 degree second secret polynomial t-1 degree parametric polynomial and Each dual-authority node has its own identifier. ,calculate The third shared secret shard of each dual-authority node. Fourth, share the secret fragments. Second parameter secret partitioning They are as follows:

[0091] ;

[0092] ;

[0093] ;

[0094] in, It is Lagrange interpolation. .

[0095] This application embodiment provides a possible implementation method. In step S102, the shared secret fragment generation step, based on the t-1 degree first secret polynomial, the t-1 degree second secret polynomial, the t-1 degree parametric polynomial, and the identifiers of the nm ordinary privilege nodes, calculates the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each of the nm ordinary privilege nodes, including:

[0096] Based on the first secret polynomial of degree t-1 t-1 degree second secret polynomial t-1 degree parametric polynomial and the identifiers of each of the nm ordinary permission nodes. Calculate the first shared secret shard of each of the nm ordinary privilege nodes. Second, share the secret fragments. and parameter secret sharding They are as follows:

[0097] ;

[0098] ;

[0099] ;

[0100] in, It is Lagrange interpolation. .

[0101] This application provides a possible implementation method in which each participating node pre-sets the same public parameters, including... p , q , E and G ,in p and q It is a prime number. E It is defined in a finite field Elliptic curve on, yes E On q Level base point;

[0102] In step S101, during initialization, the first private key is used. Second private key and the base point on the elliptic curve G The first public key calculated is The calculated second public key is ;

[0103] In step S103, the product of the first parameter secret slice and the base point on the elliptic curve is: The product of the second parameter, the secret slice, and the base point on the elliptic curve is: The product of the parameter secret partition and the base point on the elliptic curve is ;

[0104] In step S103, the signature generation step is performed according to a preset elliptic curve public key cryptography algorithm. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The following parameters are used to calculate the signatures of each specific permission node, including: the product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve; the original message of the digital rights resource; the first and second shared secret fragments of each specific permission node; the third and fourth shared secret fragments of each dual permission node; and the first and second shared secret fragments of each ordinary permission node.

[0105] Based on the preset elliptic curve public key cryptography algorithm, The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The calculation involves the product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights resource, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual-permission node, and the first and second shared secret fragments of each ordinary permission node. ; ;

[0106] Then calculate ; ;inM This is the original message regarding digital rights and resources. It is a hash function; It is a model q Operations;

[0107] Each specific permission node calculates its own signature share. ;

[0108] ;

[0109] Each dual-authority node calculates its own signature share. ;

[0110] ;

[0111] in, , It is obtained by implementing a secure conversion protocol from dot product to addition based on homomorphic encryption algorithm;

[0112] Each ordinary permission node calculates its own signature share. ;

[0113] ;

[0114] in, It is obtained by implementing a secure conversion protocol from dot product to addition based on homomorphic encryption algorithm;

[0115] Will and As a signature for each specific permission node;

[0116] Will and As the signature of each dual-authority node;

[0117] Will and As a signature for each ordinary permission node.

[0118] It should be noted that the MtA (Multiplicative to Additive) protocol, which implements a secure conversion from dot product to addition based on homomorphic encryption algorithms, allows participating parties to... Possessing secret 'a', the participating party Having secret b, and without revealing a and b, obtain it through secure two-party calculation. and Satisfying the equation In a specific conversion process, such as Figure 3 As shown, the specific steps are as follows:

[0119] Step 1: Select the homomorphic encryption algorithm HEnc and generate a homomorphic key pair. and use your own public key pk right Homomorphic encryption is used to obtain Then, the homomorphic ciphertext and public key pk Send to .

[0120] Step 2: calculate and randomly select and use the public key pk right Encrypt, obtain Then calculate , Finally send Give .

[0121] Step 3: calculate .

[0122] This application embodiment provides a possible implementation method. In step S104, the signature verification party collects the signatures of each specific authorization node and the signatures of each dual authorization node. If the number of signatures of a specific authorization node is equal to... The verifier collects signatures from each ordinary authorized node. If the total number of signatures from dual-authorized nodes and ordinary authorized nodes is greater than or equal to t, then signature verification is performed based on a preset elliptic curve public key cryptography algorithm, the original message of the digital rights resource, the signatures of each specific authorized node, the signatures of each dual-authorized node, the signatures of each ordinary authorized node, the first public key, and the second public key, including:

[0123] The verifier collects signatures from each specific permission node. and , ;

[0124] The verifier collects signatures from each dual-authority node. and , ;

[0125] If the number of signatures of a specific permission node equals Then the verifier collects the signatures of each ordinary permission node. and , ;

[0126] Based on the preset elliptic curve public key cryptography algorithm and the original message of digital rights and resourcesM The signatures of each specific permission node, the signatures of each dual-permission node, the signatures of each ordinary permission node, and the first public key. Second public key Calculate separately , and ;

[0127] calculate , and ;

[0128] judge , Check if all conditions are met. If all conditions are met, the signature verification is successful.

[0129] It should be noted that the sequence numbers of the steps in the above embodiments do not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application. In practical applications, all the above possible implementation methods can be arbitrarily combined in a combined manner to form possible embodiments of this application, which will not be described in detail here.

[0130] Based on the blockchain-based digital rights and resources signature verification method provided in the above embodiments, and based on the same inventive concept, this application also provides a blockchain-based digital rights and resources signature verification system.

[0131] Figure 4 This is a structural diagram of the blockchain-based digital rights resource signature verification system provided in this application embodiment. Figure 4 As shown, this blockchain-based digital rights resource signature involves n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for nodes with specific permissions is [value missing]. There are n nodes, where all nodes with specific permissions can be controlled to function as ordinary nodes. We can call a node with specific permissions that is controlled to function as an ordinary node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: A specific permission node and t ordinary permission nodes submit the correct signed fragments, which may include an initialization unit 410, a secret fragment generation unit 420, a signature generation unit 430, and a signature verification unit 440.

[0132] Initialization unit 410: Used to construct a shared secret shard for generating each specific permission node based on the first private key and the first random parameters generated by the key generation center. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial;

[0133] Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ;

[0134] Calculate the first public key and the second public key using the first private key, the second private key, and the base points on the elliptic curve;

[0135] Secret Sharding Generation Unit 420: Used to select identifiers for m specific permission nodes and nm ordinary permission nodes;

[0136] based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes;

[0137] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes;

[0138] Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes;

[0139] Signature generation unit 430: used for each specific permission node to calculate and broadcast the product of the first parameter secret fragment and the base point on the elliptic curve, each dual permission node to calculate and broadcast the product of the second parameter secret fragment and the base point on the elliptic curve, and each ordinary permission node to calculate and broadcast the product of the parameter secret fragment and the base point on the elliptic curve.

[0140] When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights and resources, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual permission node, the first and second shared secret fragments of each ordinary permission node, and the signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated.

[0141] Signature verification unit 440: Used by the verifier to collect signatures from each specific authorization node and each dual authorization node. If the number of signatures from a specific authorization node is equal to... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

[0142] Those skilled in the art will clearly understand that the specific working process of the systems, devices, and modules described above can be referred to the corresponding process in the foregoing method embodiments. For the sake of brevity, it will not be repeated here.

[0143] Those skilled in the art will understand that the technical solution of this application, or all or part of it, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several program instructions to cause an electronic device (e.g., a personal computer, server, or network device) to execute all or part of the steps of the methods described in the embodiments of this application when running the program instructions. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, portable hard drive, read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.

[0144] Alternatively, all or part of the steps of the foregoing method embodiments can be implemented by hardware (such as electronic devices like personal computers, servers, or network devices) associated with program instructions. The program instructions can be stored in a computer-readable storage medium. When the program instructions are executed by the processor of the electronic device, the electronic device executes all or part of the steps of the methods described in the embodiments of this application.

[0145] The above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit it. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that within the spirit and principles of this application, modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein; and these modifications or substitutions do not cause the corresponding technical solutions to leave the protection scope of this application.

Claims

1. A blockchain-based digital rights resource signature verification method, characterized in that, The blockchain-based digital rights resource signature includes n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for nodes with specific permissions is [value missing]. Let's call a specific permission node that is being regulated and simultaneously acts as a regular permission node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: A specific permission node and t ordinary permission nodes submit correctly signed shards; The method includes: an initialization step, a secret sharing fragment generation step, a signature generation step, and a signature verification step; Initialization steps: Based on the first private key and first random parameters generated by the key generation center, construct the shared secret shards used to generate each specific permission node. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial; Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ; Calculate the first public key and the second public key using the first private key, the second private key, and the base points on the elliptic curve; The steps for generating a secret shard are as follows: select identifiers for m specific permission nodes and select identifiers for nm ordinary permission nodes; based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes; Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes; Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes; Signature generation steps: Each node with specific permissions calculates and broadcasts the product of the first parameter secret fragment and the base point on the elliptic curve; each node with dual permissions calculates and broadcasts the product of the second parameter secret fragment and the base point on the elliptic curve; each node with ordinary permissions calculates and broadcasts the product of the parameter secret fragment and the base point on the elliptic curve. When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights and resources, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual permission node, the first and second shared secret fragments of each ordinary permission node, and the signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated. Signature verification steps: The verifier collects the signatures of each specific permission node and the signatures of each dual-permission node. If the number of signatures from a specific permission node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

2. The method according to claim 1, characterized in that, In the initialization step, based on the first private key and the first random parameters generated by the key generation center, a shared secret shard for generating each specific permission node is constructed. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomials include: Combining the preset elliptic curve public-key cryptography algorithm, and based on the first private key generated by the key generation center. Build for each specific permission node to generate Sharing secrets and fragments -1st degree first secret polynomial and used for generation Sharing secrets and fragments -1 degree second secret polynomial; and Based on the first random parameter generated by the key generation center Build for each specific permission node to generate Sharing secrets and fragments -1 degree parametric polynomial.

3. The method according to claim 2, characterized in that, The -1 degree first secret polynomial is as follows: ； in, yes -1 random number, as -1st degree first secret polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions; The -1 degree second secret polynomial is as follows: ； in, yes -1 random number, as -1st degree second secret polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions; The -1 degree parametric polynomial is as follows: ； in, yes -1 random number, as -1 degree parameter polynomial The coefficient; for x Choose m distinct integers. As an identifier for nodes with specific permissions.

4. The method according to claim 3, characterized in that, In the initialization step, based on the second private key and second random parameters generated by the key generation center, a t-1 degree first secret polynomial, a t-1 degree second secret polynomial, and a t-1 degree parameter polynomial are constructed to generate the shared secret shards for each dual-authority node and each ordinary-authority node, including: Combining a pre-defined elliptic curve public-key cryptography algorithm with a second private key generated by the key generation center. For each dual-authority node and each ordinary-authority node, construct a system for generating... The shared secret fragments of the first secret polynomial of degree t-1 are used to generate The shared secret partition of the second secret polynomial of degree t-1; and Based on the second random parameter generated by the key generation center For each dual-authority node and each ordinary-authority node, construct a system for generating... The shared secret is the t-1 degree parametric polynomial of the segmentation.

5. The method according to claim 4, characterized in that, The first secret polynomial of degree t-1 is as follows: ； in, These are t-1 random numbers, used as the first secret polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes; The second secret polynomial of degree t-1 is as follows: ； in, These are t-1 random numbers, used as the second secret polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes; The t-1 degree parametric polynomial is as follows: ； in, These are t-1 random numbers, used as the parameter polynomial of degree t-1. The coefficient; for x Select n distinct integers. As an identifier for ordinary permission nodes.

6. The method according to claim 5, characterized in that, In the process of sharing secret shards, identifiers are selected for m specific permission nodes and for nm ordinary permission nodes, including: Select an identifier for m specific permission nodes , ;as well as Select an identifier for nm ordinary permission nodes , .

7. The method according to claim 6, characterized in that, In the process of sharing secret shard generation, based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each of the m specific permission nodes, including: based on -1st degree first secret polynomial , -1st degree second secret polynomial , -1 degree parameter polynomial and the identifiers of m specific permission nodes. Calculate the first shared secret shard of each of the m specific permission nodes. Second, share the secret fragments. Secret partitioning with the first parameter They are as follows: ； ； ； in, It is Lagrange interpolation. .

8. The method according to claim 7, characterized in that, In the secret fragment generation step, based on the (t-1)th degree first secret polynomial, the (t-1)th degree second secret polynomial, the (t-1)th degree parameter polynomial, and... Each dual-authority node has its own identifier, and the calculation is performed. The third shared secret shard, fourth shared secret shard, and second parameter secret shard of each dual-authority node include: Based on the first secret polynomial of degree t-1 t-1 degree second secret polynomial t-1 degree parametric polynomial and Each dual-authority node has its own identifier. ,calculate The third shared secret shard of each dual-authority node. Fourth, share the secret fragments. Second parameter secret partitioning They are as follows: ； ； ； in, It is Lagrange interpolation. .

9. The method according to claim 8, characterized in that, In the shared secret fragment generation step, based on the t-1 degree first secret polynomial, the t-1 degree second secret polynomial, the t-1 degree parametric polynomial, and the identifiers of the nm ordinary privilege nodes, the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each of the nm ordinary privilege nodes are calculated, including: Based on the first secret polynomial of degree t-1 t-1 degree second secret polynomial t-1 degree parametric polynomial and the identifiers of each of the nm ordinary permission nodes. Calculate the first shared secret shard of each of the nm ordinary privilege nodes. Second, share the secret fragments. and parameter secret sharding They are as follows: ； ； ； in, It is Lagrange interpolation. .

10. A blockchain-based digital rights resource signature verification system, characterized in that, The blockchain-based digital rights resource signature includes n participating nodes, of which m are nodes with specific permissions and nm are nodes with ordinary permissions. The signature threshold for nodes with specific permissions is [value missing]. There are n nodes, where all nodes with specific permissions can be controlled to function as ordinary nodes. We can call a node with specific permissions that is controlled to function as an ordinary node a dual-permission node; n and m are positive integers, and n is greater than m. Integers greater than zero For a signature to be valid if it is less than or equal to m, the following conditions must be met: A specific permission node and t ordinary permission nodes submit correctly signed shards; The system includes: an initialization unit, a secret sharing fragment generation unit, a signature generation unit, and a signature verification unit; Initialization unit: Used to construct shared secret shards for generating each specific permission node based on the first private key and first random parameters generated by the key generation center. -1st degree first secret polynomial, -1st degree second secret polynomial and -1 degree parametric polynomial; Based on the second private key and second random parameters generated by the key generation center, construct the (t-1)th degree first secret polynomial, (t-1)th degree second secret polynomial, and (t-1)th degree parameter polynomial for generating the shared secret shards of each dual-authority node and each ordinary-authority node, where t is a positive integer and t is greater than 1. ; Calculate the first public key and the second public key using the first private key, the second private key, and the base points on the elliptic curve; Shared secret shard generation unit: used to select identifiers for m specific permission nodes and nm ordinary permission nodes; based on -1st degree first secret polynomial, -1st degree second secret polynomial, Given a -1 degree parametric polynomial and the identifiers of m specific permission nodes, calculate the first shared secret fragment, the second shared secret fragment, and the first parametric secret fragment for each specific permission node among the m specific permission nodes; Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the m dual-authority nodes, calculate the third shared secret fragment, the fourth shared secret fragment, and the second parametric secret fragment of each dual-authority node among the m dual-authority nodes; Based on the first secret polynomial of degree t-1, the second secret polynomial of degree t-1, the parametric polynomial of degree t-1, and the identifiers of the nm ordinary privilege nodes, calculate the first shared secret fragment, the second shared secret fragment, and the parametric secret fragment of each ordinary privilege node among the nm ordinary privilege nodes; Signature generation unit: used for each specific permission node to calculate and broadcast the product of the first parameter secret fragment and the base point on the elliptic curve, each dual permission node to calculate and broadcast the product of the second parameter secret fragment and the base point on the elliptic curve, and each ordinary permission node to calculate and broadcast the product of the parameter secret fragment and the base point on the elliptic curve. When each specific permission node obtains other The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve, and Each dual-authority node obtains the product of the second parameter secret slice of all other dual-authority nodes and the base point on the elliptic curve, and each ordinary-authority node obtains the product of the other t- parameters. When multiplying the secret fragments of parameters of ordinary authorized nodes with the base points on the elliptic curve, the preset elliptic curve public key cryptography algorithm is used. The product of the first parameter secret fragment of a specific permission node and the base point on the elliptic curve. The product of the second parameter secret slice of the dual-authority node and the base point on the elliptic curve, t- The product of the parameter secret fragments of each ordinary permission node and the base point on the elliptic curve, the original message of the digital rights and resources, the first and second shared secret fragments of each specific permission node, the third and fourth shared secret fragments of each dual permission node, the first and second shared secret fragments of each ordinary permission node, and the signatures of each specific permission node, each dual permission node, and each ordinary permission node are calculated. Signature Verification Unit: Used by the verifier to collect signatures from each specific authorization node and each dual authorization node. If the number of signatures from a specific authorization node equals... If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier collects the signatures from each ordinary-authority node. If the total number of signatures from dual-authority nodes and ordinary-authority nodes is greater than or equal to t, then the verifier performs signature verification based on the preset elliptic curve public key cryptography algorithm, the original message of the digital rights and resources, the signatures of each specific-authority node, the signatures of each dual-authority node, the signatures of each ordinary-authority node, the first public key, and the second public key.

Images