Alliance chain multi-signature transaction method and device based on lattice cryptography
Through the multi-signature transaction method based on grid cryptography, the security and performance of the alliance chain transaction solution is solved, post-quantum security and efficient transactions are achieved, and the scalability of large-scale endorsement nodes is supported.
Patent Information
- Application Number
- CN202211490943.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-11-25
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2042-11-25
AI Technical Summary
The existing alliance chain transaction solutions cannot resist quantum computing attacks in terms of security, and due to the increase in the scale of the endorsement node, the computing pressure and storage space are reduced, resulting in insufficient performance.
Using a multi-signature transaction method based on grid password, the system master key and public parameters are generated through the trusted key generation center, and the user public and private key of the endorsement node is generated using the GKGOSS sampling algorithm to build a multi-layer spanning tree for transaction proposals and signatures. Endorsement, using the G-Basic rejection sampling theorem to generate signatures, implement multiple signatures and verify, reducing computation and storage overhead.
It realizes post-quantum security and efficient multi-signature transactions, supports public key aggregation, reduces the computing and storage overhead of alliance chain nodes, improves transaction efficiency, and expands the number of endorsed nodes to thousands.
Smart Images

Figure CN115883099B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of digital signature technology, and in particular to a lattice-based alliance chain multi-signature transaction method and device. Background Art
[0002] Blockchain is a decentralized, traceable and tamper-proof distributed database that includes cryptographic algorithms, consensus mechanisms, distributed peer-to-peer networks, smart contracts and other technologies. It is widely used in digital currencies, medical big data sharing, supply chain networks and other scenarios. According to differentiated application scenarios and user needs, blockchain is divided into public chains, private chains and alliance chains. Among them, alliance chains are usually used in networks composed of multiple institutions or organizations. They are superior to public chains in terms of privacy protection and efficiency, and superior to private chains in terms of decentralization and scope of use scenarios. Therefore, they have become the blockchain network model used in mainstream application scenarios in recent years.
[0003] The typical representative of consortium chain is the Hyperledger project under the Linux Foundation, among which Fabric is the mainstream sub-project of the Hyperledger project and has become the supporting architecture of most consortium chain transaction solutions. However, related consortium chain transaction solutions have problems in both security and performance. On the one hand, the related technology generally uses traditional elliptic curve digital signature technology. Since the Shor quantum algorithm can solve the elliptic curve discrete logarithm problem in polynomial time, the related technology cannot resist quantum computing attacks and lacks security. On the other hand, since the consortium chain transaction solution requires the endorsement strategy to be followed, users need to collect enough transaction signature endorsements after initiating a transaction before the transaction consensus can be put on the chain. Therefore, as the scale of transaction proposals and endorsement nodes increases, the computing pressure of the consortium chain network increases, and the storage space decreases. The related technology has performance deficiencies. Summary of the invention
[0004] In view of this, the embodiments of the present invention provide a consortium chain multi-signature transaction method and device based on lattice cryptography to eliminate or improve one or more defects existing in the prior art and solve the security risks and performance deficiencies in the existing consortium chain transaction methods.
[0005] On the one hand, the present invention provides a lattice cryptographic-based alliance chain multi-signature transaction method, characterized in that the method is run on an alliance chain network, and the alliance chain network includes users, a trusted key generation center, a client node, an endorsement node specified by a preset endorsement policy, a sorting node, and a verification node; the method includes the following steps:
[0006] The user initiates a transaction through the client node based on a preset alliance chain network; wherein the preset includes: the trusted key generation center uses a first preset lattice cryptographic algorithm to generate a system master key and public parameters, and the public parameters include the number of endorsement nodes, NTRU ring polynomials and multiple hash functions; the hash value is calculated using the hash function according to the identity information of each endorsement node as the user public key of each endorsement node; the first ring polynomial vector and the second ring polynomial vector are calculated using a second preset lattice cryptographic algorithm according to the user public key and the master key, and the first ring polynomial vector and the second ring polynomial vector are used as the user private key of each endorsement node;
[0007] The client node is used as a root node and the endorsement node is used as a child node to construct a multi-layer spanning tree. Each endorsement node calculates a partial commitment value according to the user public key and the NTRU ring polynomial, sends the partial commitment value and user public key of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate commitment value set and a partial aggregate user public key set; the client node calculates a final aggregate commitment value and a final aggregate user public key according to the partial aggregate commitment value set, the partial aggregate user public key set, the corresponding transaction content and the identity information of each endorsement node, and constructs a transaction proposal according to the final aggregate commitment value, the final aggregate user public key and the corresponding transaction content, and sends it to each endorsement node;
[0008] Each endorsement node simulates the execution of the transaction proposal to obtain a simulated transaction result, and calculates a partial signature response value based on the respective user private keys and the final aggregate commitment value, and uses a third preset grid cryptographic algorithm to calculate the probability value that the signature of each endorsement node can be correctly output based on the partial signature response value, and sends the partial signature response value and signature of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate signature response value set; the client calculates the final aggregate signature response value based on the partial aggregate signature response value set, and obtains a multi-signature consisting of the signatures of each endorsement node; the multi-signature includes the transaction proposal, the final aggregate signature response value and the final aggregate commitment value;
[0009] The client node verifies the final aggregate signature response value and the final aggregate commitment value in the multi-signature using the transaction proposal, the final aggregate user public key and the identity information of each endorsing node. If the verification passes, the transaction proposal and the multi-signature are packaged and sent to the sorting node;
[0010] The sorting node sorts the transactions received within a preset time according to preset rules, packages the sorted batch transactions into data blocks and broadcasts them to the verification node across the network;
[0011] The verification node verifies the transaction proposal of each transaction in the data block, the final aggregate signature response value in the multi-signature, and the final aggregate commitment value. If the verification passes, the alliance chain network updates the ledger and completes the transaction.
[0012] In some embodiments of the present invention, the trusted key generation center generates a system master key and public parameters using a first preset lattice cryptographic algorithm, and further includes the following steps:
[0013] The alliance chain network sets system security parameters, the number of endorsement nodes and two hash functions;
[0014] Initialize an NTRU lattice, and generate an NTRU ring polynomial and an NTRU high-quality short lattice basis based on the first preset lattice cryptographic algorithm;
[0015] Using the NTRU high-quality short lattice basis as the master key, and using the parameters of the NTRU lattice, the number of the endorsement nodes, two hash functions, and the NTRU ring polynomial as the public parameters;
[0016] The first preset lattice cryptographic algorithm is a lattice-based trapdoor generation algorithm, and the calculation formula is:
[0017] TrapGen NTRU (n,q,σ);
[0018] Among them, TrapGen NTRU represents the NTRU lattice trapdoor generation algorithm; n, q, σ represent the integer, prime number and standard deviation of the NTRU lattice setting respectively.
[0019] In some embodiments of the present invention, the first ring polynomial vector and the second ring polynomial vector are calculated using a second preset lattice cryptographic algorithm according to the user public key and the master key, and the second preset lattice cryptographic algorithm is a lattice-based Gaussian sampling algorithm, and the calculation formula is:
[0020] Gaussian-Sampler NTRU ,σ,(pk i ,0));
[0021] Among them, Gaussian-Sampler NTRU represents the lattice-based Gaussian sampling algorithm; B represents the master key; σ represents the standard deviation of the NTRU lattice setting; pk i Represents the user public key of the i-th endorsing node.
[0022] In some embodiments of the present invention, the client node is used as a root node and the endorsement node is used as a child node to construct a multi-layer spanning tree, further comprising:
[0023] The endorsement nodes have a first-layer endorsement node, a second-layer endorsement node and a third-layer endorsement node from top to bottom with the client node as the root node; the client node is connected to multiple first-layer endorsement nodes, each first-layer endorsement node is connected to multiple second-layer endorsement nodes, and each second-layer endorsement node is connected to multiple third-layer endorsement nodes.
[0024] In some embodiments of the present invention, each endorsing node sends the partial commitment value and user public key of each endorsing node to the upper node from bottom to top according to the partial commitment value calculated by the user public key and the NTRU ring polynomial, and calculates a partial aggregate commitment value set and a partial aggregate user public key set, further comprising the following steps:
[0025] Each endorsing node randomly selects two third ring polynomial vectors and a fourth ring polynomial vector having the same distribution as the user public key;
[0026] Each endorsing node calculates the partial commitment value according to the NTRU ring polynomial, the third ring polynomial vector and the fourth ring polynomial vector;
[0027] The second-layer endorsement node sends the partial commitment value and the user public key to the first-layer endorsement node; the second-layer endorsement node calculates a partial aggregate commitment value and a partial aggregate user public key based on the partial commitment value and the user public key received from the third-layer endorsement node, and sends them to the first-layer endorsement node;
[0028] The first-layer endorsement node combines the partially aggregated commitment value set and the partially aggregated user public key set of all endorsement nodes and sends them to the client node.
[0029] In some embodiments of the present invention, the method of calculating partial signature response values by using a third preset grid cryptographic algorithm according to respective user private keys and the final aggregate commitment value, sending partial signature response values of each endorsement node to an upper-layer node from bottom to top, and calculating a partial aggregate signature response value set also includes the following steps:
[0030] The second-layer endorsement sends the partial signature response value to the first-layer endorsement node; the second-layer endorsement node calculates a partial aggregate signature response value according to the received third-layer endorsement node, and sends it to the first-layer endorsement node;
[0031] The first-layer endorsement node combines the partial aggregate signature response value set of all endorsement nodes and sends it to the client node.
[0032] In some embodiments of the present invention, a partial signature response value is calculated according to the respective user private keys and the final aggregate commitment value, and a third preset lattice cryptographic algorithm is used to calculate the probability value that the signature of each endorsement node can be correctly output according to the partial signature response value. The third preset lattice cryptographic algorithm is the lattice rejection sampling theorem, and the calculation formula of the probability value is:
[0033]
[0034] Wherein, min(·) means to find the minimum value; D means probability distribution; n and σ respectively represent the integer and standard deviation of the NTRU grid setting; z i represents the partial signature response value; M is a constant; s i,0 represents the first ring polynomial vector; s i,1 represents the second ring polynomial vector; R represents the final aggregate commitment value.
[0035] In some embodiments of the present invention, the client node verifies the final aggregate signature response value and the final aggregate commitment value in the multi-signature using the transaction proposal, the final aggregate user public key and the identity information of each endorsing node. The verification must satisfy the following conditions at the same time:
[0036]
[0037] R=H 2 (Z 0 +Z 1 *hR*PK,ID,Tx);
[0038] Where Z represents the final aggregate signature response value; Z 0 Represents the first final aggregate signature response value, Z 1 Represents the second final aggregate signature response value, Z is composed of Z 0 and Z 1 N represents the number of the endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting respectively; R represents the final aggregate commitment value; H 2 represents the hash function; h represents the NTRU ring polynomial; PK represents the final aggregated user public key; ID represents the identity information of each endorsing node; Tx represents the transaction proposal.
[0039] In some embodiments of the present invention, the verification node verifies the transaction proposal of each transaction in the data block and the final aggregate signature response value and the final aggregate commitment value in the multi-signature, and the verification must satisfy the following conditions at the same time:
[0040]
[0041] R=H 2 (Z 0 +Z 1 *hR*PK,ID,Tx);
[0042] Where Z represents the final aggregate signature response value; Z 0 Represents the first final aggregate signature response value, Z 1 Represents the second final aggregate signature response value, Z is composed of Z 0 and Z 1 N represents the number of the endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting respectively; R represents the final aggregate commitment value; H 2 represents the hash function; h represents the NTRU ring polynomial; PK represents the final aggregated user public key; ID represents the identity information of each endorsing node; Tx represents the transaction proposal.
[0043] On the other hand, the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any one of the methods mentioned above.
[0044] The beneficial effects of the present invention are at least:
[0045] The present invention provides a multi-signature transaction method and device for a consortium chain based on lattice cryptography. By initializing the consortium chain network, the trusted key generation center generates the system master key and public parameters using the NTRU lattice trapdoor generation algorithm, and generates the user public and private key pairs of the designated endorsement node using the lattice Gaussian sampling algorithm. The user initiates a transaction through the client node, the client node constructs a transaction proposal and sends it to the endorsement node for simulation execution, and the endorsement node generates the signature endorsement of the transaction proposal using the lattice rejection sampling theorem; the client node collects the simulated transaction results and signature endorsements of each endorsement node to generate multiple signatures; the client sends the valid transaction and its multiple signatures to the sorting node; the sorting node sorts the transaction set and packages it into data blocks and broadcasts it to the verification node, the verification node verifies the data blocks and synchronously updates the account book to realize the transaction. The present invention adopts lattice cryptography technology and uses difficult problems with small integers on the lattice to generate keys. It can resist quantum computing attacks, and the multiple signatures are unforgeable. Attackers cannot destroy alliance chain transactions by forging multiple signatures, and it has post-quantum security. At the same time, the present invention supports public key aggregation, and the verification node only uses the aggregated public key to verify the correctness of the transaction signature endorsement, which reduces the computing overhead and storage overhead of the alliance chain nodes, thereby improving the efficiency of the overall alliance chain transaction solution and making it highly efficient.
[0046] Furthermore, the endorsement node adopts a spanning tree structure. Each endorsement node can communicate from top to bottom or from bottom to top using the spanning tree structure. The huge amount of computation in the endorsement process can be reasonably distributed to each node through the spanning tree structure, thereby allowing the number of endorsement nodes to be expanded to thousands, making it scalable.
[0047] Additional advantages, purposes, and features of the present invention will be described in part in the following description, and will become apparent to those skilled in the art after studying the following, or may be learned from the practice of the present invention. The purposes and other advantages of the present invention may be achieved and obtained by the structures specifically indicated in the specification and the accompanying drawings.
[0048] Those skilled in the art will appreciate that the objectives and advantages that can be achieved with the present invention are not limited to the above specific description, and the above and other objectives that can be achieved by the present invention will be more clearly understood from the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] The drawings described herein are used to provide a further understanding of the present invention, constitute a part of the present application, and do not constitute a limitation of the present invention. In the drawings:
[0050] Figure 1 This is a schematic diagram of the structure of a consortium chain multi-signature transaction method based on lattice cryptography in one embodiment of the present invention.
[0051] Figure 2 This is a schematic diagram of the steps of a consortium chain multi-signature transaction method based on lattice cryptography in one embodiment of the present invention.
[0052] Figure 3 The figure is a schematic diagram of the endorsement node spanning tree structure in one embodiment of the present invention. DETAILED DESCRIPTION
[0053] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments and the accompanying drawings. Here, the illustrative embodiments of the present invention and their descriptions are used to explain the present invention, but are not intended to limit the present invention.
[0054] It should also be noted that, in order to avoid obscuring the present invention due to unnecessary details, only structures and / or processing steps closely related to the solutions according to the present invention are shown in the accompanying drawings, while other details that are not closely related to the present invention are omitted.
[0055] It should be emphasized that the term “include / comprises” when used herein refers to the presence of features, elements, steps or components, but does not exclude the presence or addition of one or more other features, elements, steps or components.
[0056] It should also be noted that, unless otherwise specified, the term “connection” herein may refer not only to a direct connection but also to an indirect connection involving an intermediate.
[0057] Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. In the accompanying drawings, the same reference numerals represent the same or similar components, or the same or similar steps.
[0058] It should be emphasized here that the step marks mentioned below are not intended to limit the order of the steps, but it should be understood that the steps can be executed in the order mentioned in the embodiment, or in a different order from the embodiment, or several steps can be executed simultaneously.
[0059] In order to solve the problems of security risks and insufficient performance in existing alliance chain transaction methods, the present invention provides an alliance chain multi-signature transaction method based on lattice cryptography, wherein multiple signatures are used for multiple signatories to generate a combined digital signature for the same message, and the combined signature only needs to be verified once in the signature verification stage. Compared with the prior art, multiple signatures greatly compress the storage space of alliance chain transaction signature endorsements, and improve the consensus verification speed of transaction signature endorsements, thereby improving signature efficiency and greatly improving the performance of alliance chain transaction solutions. Lattice cryptography is a post-quantum secure cryptographic system that generates keys using difficult problems on the lattice, such as the shortest vector problem (SVP), the closest vector problem (CVP), and the small integer solution problem (SIS). Currently, there is no quantum algorithm that can solve such difficult problems in polynomial time, and it has high security. In addition, since the operations of lattice cryptography are generally linear operations such as matrices, vectors, or ring polynomials, the operation speed of lattice cryptography is faster than the modular exponentiation operations and bilinear group operations used in the discrete logarithm cryptographic system in the prior art. Figure 1 and Figure 2 As shown, the method is run on a consortium chain network, which includes users, a trusted key generation center, a client node, an endorsement node specified by a preset endorsement policy, a sorting node, and a verification node. The method includes the following steps S101 to S106:
[0060] Step S101: The user initiates a transaction through a client node based on a preset alliance chain network; wherein the preset includes: the trusted key generation center uses a first preset lattice cryptographic algorithm to generate a system master key and public parameters, wherein the public parameters include the number of endorsement nodes, an NTRU ring polynomial, and multiple hash functions; a hash value is calculated using a hash function according to the identity information of each endorsement node as the user public key of each endorsement node; a first ring polynomial vector and a second ring polynomial vector are calculated using a second preset lattice cryptographic algorithm according to the user public key and the master key, and the first ring polynomial vector and the second ring polynomial vector are used as the user private key of each endorsement node;
[0061] Step S102: The client node is used as the root node and the endorsement node is used as the child node to build a multi-layer spanning tree. Each endorsement node calculates a partial commitment value according to the user public key and the NTRU ring polynomial, sends the partial commitment value and user public key of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate commitment value set and a partial aggregate user public key set; the client node calculates the final aggregate commitment value and the final aggregate user public key according to the partial aggregate commitment value set, the partial aggregate user public key set, the corresponding transaction content and the identity information of each endorsement node, and constructs a transaction proposal according to the final aggregate commitment value, the final aggregate user public key and the corresponding transaction content, and sends it to each endorsement node;
[0062] Step S103: Each endorsement node simulates the execution of the transaction proposal to obtain a simulated transaction result, and calculates a partial signature response value based on the respective user private keys and the final aggregate commitment value, and uses a third preset grid cryptographic algorithm to calculate the probability value that the signature of each endorsement node can be correctly output based on the partial signature response value, and sends the partial signature response value and signature of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate signature response value set; the client calculates the final aggregate signature response value based on the partial aggregate signature response value set, and obtains a multi-signature consisting of the signatures of each endorsement node; wherein the multi-signature includes the transaction proposal, the final aggregate signature response value and the final aggregate commitment value;
[0063] Step S104: The client node verifies the final aggregate signature response value and the final aggregate commitment value in the multi-signature using the transaction proposal, the final aggregate user public key, and the identity information of each endorsement node. If the verification passes, the transaction proposal and the multi-signature are packaged and sent to the sorting node;
[0064] Step S105: The sorting node sorts the transactions received within the preset time according to the preset rules, packages the sorted batch transactions into data blocks and broadcasts them to the verification nodes across the network;
[0065] Step S106: The verification node verifies the transaction proposal of each transaction in the data block, the final aggregate signature response value in the multi-signature, and the final aggregate commitment value. If the verification passes, the consortium chain network updates the ledger and completes the transaction.
[0066] In step S101, before the user conducts a transaction, the alliance chain network is first initialized, the system security parameters are set, and the number of endorsement nodes is determined, which needs to meet the requirements of the alliance chain multi-signature transaction endorsement policy. An NTRU grid is initialized, and a uniformly random NTRU ring polynomial and an NTRU high-quality short grid basis are generated using the first preset grid cryptographic algorithm; two collision-resistant hash functions are selected, one hash function is mapped to the ring polynomial set space set by the NTRU grid, and the other hash function is mapped to the fixed-length string space.
[0067] In some embodiments, set the NTRU lattice integer k>0, and let n=2 k , set the prime number q = 1mod2n, and let the standard deviation Ring polynomial set R q , where NTRU ring polynomials belong to the set of ring polynomials.
[0068] In some embodiments, the two hash functions are denoted as the first hash function H 1 and the second hash function H 2 , where the first hash function maps to the ring polynomial set space of the NTRU lattice setting, H 1 :{0,1} * →R q , the second hash function maps to the fixed-length string space, H 2 :{0,1} * →{0,1} n .
[0069] In some embodiments, the first preset lattice cryptographic algorithm is a lattice-based trapdoor generation algorithm, as shown in formula (1):
[0070] TrapGen NTRU (n,q,σ); (1)
[0071] Among them, TrapGen NTRU represents the NTRU lattice trapdoor generation algorithm; n, q, σ represent the integer, prime number and standard deviation of the NTRU lattice setting, respectively.
[0072] The generated NTRU high-quality short lattice basis is used as the master key of the system; the number of endorsement nodes, the parameters of the NTRU lattice, two hash functions and the generated NTRU ring polynomial are used as the public parameters of the system.
[0073] For example, the number of endorsing nodes is denoted as N, and the NTRU ring polynomial is denoted as h, then the public parameter PP = (N, n, q, σ, H 1 ,H 2 ,h).
[0074] The consortium chain network formulates the endorsement strategy of the transaction through the automated execution program of the smart contract as the constraint condition that the transaction must meet when endorsing. According to the number of endorsement nodes determined above, the spanning tree structure is constructed by each endorsement node and the client node, and the client node is set as the root node of the spanning tree structure, and each endorsement node is a child node of each layer in the spanning tree structure.
[0075] In some embodiments, the endorsing node is denoted as En i , where i represents the i-th endorsement node, i=1,2,...,N, and the client node is defined as the root node, and there are first-layer endorsement nodes, second-layer endorsement nodes, and third-layer endorsement nodes from top to bottom; wherein the client node is connected to multiple first-layer endorsement nodes, each first-layer endorsement node is connected to multiple second-layer endorsement nodes, and each second-layer endorsement node is connected to multiple third-layer endorsement nodes.
[0076] Specifically, Figure 3 As shown, the client node is denoted as Cl, the first-level endorsement node is denoted as P, the second-level endorsement node is denoted as S, and the third-level endorsement node is denoted as C. For example, the second first-level endorsement node of the root node Cl is denoted as P 2 , the first-layer endorsement node P 2 The first second-layer endorsement node is denoted as S 2,1 , the second-layer endorsement node S 2,1 The first third-layer endorsement node is denoted as C 2,1,1 , and so on.
[0077] The client node and the trusted key generation center obtain the identity information of the corresponding endorsement node according to the endorsement policy. The trusted key generation center uses the first hash function, takes the identity information of each endorsement node as input, calculates the corresponding hash value as the user public key of each endorsement node.
[0078] Specifically, the identity information of each endorsement node is recorded as ID i , the hash value calculation formula is shown in formula (2):
[0079] pk i =H 1 (ID i )∈R q ; (2)
[0080] Among them, the obtained pk i As the user public key of each endorsing node, and pk i Belongs to the set of ring polynomials R q .
[0081] The trusted key generation center uses the user public key and master key of each endorsement node as input, uses the second preset lattice cryptographic algorithm to calculate the first ring polynomial vector and the second ring polynomial vector, and uses the first ring polynomial vector and the second ring polynomial vector as the user private key of each endorsement node.
[0082] In some embodiments, the second preset lattice cryptographic algorithm is a lattice-based Gaussian sampling algorithm, and the calculation formula is shown in formula (3):
[0083] Gaussian-Sampler NTRU ,σ,(pk i ,0)); (3)
[0084] Among them, Gaussian-Sampler NTRU represents the lattice-based Gaussian sampling algorithm; B represents the master key; σ represents the standard deviation of the NTRU lattice setting; pk i Represents the user public key of the i-th endorsing node.
[0085] According to formula (3), two ring polynomial vectors with smaller lengths are obtained, namely, the first ring polynomial vector s i,0 and the second ring polynomial vector s i , 1 , then the user private key of each endorsement node can be expressed as sk i =(s i,0 ,s i,1 ).
[0086] The first ring polynomial vector and the second ring polynomial vector must satisfy formula (4) and formula (5) at the same time:
[0087] s i,0 +s i,1 *h=pk i ; (4)
[0088]
[0089] Among them, s i,0 represents the first ring polynomial vector; s i,1 represents the second ring polynomial vector; h represents the NTRU ring polynomial; pk i represents the user public key of the i-th endorsing node; n,σ represent the integer and standard deviation of the NTRU grid setting respectively.
[0090] The trusted key generation center transmits the corresponding user public and private key pairs to each transaction endorsement node through a secure channel for subsequent transaction endorsement.
[0091] After the alliance chain network is set up, each user can initiate the corresponding transaction through the client node. Among them, the user who initiates the transaction must be a user who has successfully registered and joined the alliance chain network. Specifically, when a user joins the alliance chain network, he needs to initiate an application to the alliance chain network. After the application is successful, the alliance chain network will issue a unique user certificate to the user. When a user initiates a transaction, the user's user certificate must be included in the transaction content.
[0092] In some embodiments, a transaction initiated by a user is recorded as Tx, where Tx = M||Cert u , where M represents the transaction content; Cert u Represents the user certificate for this user.
[0093] In step S102, after receiving the transaction initiated by the user, the client node performs preparation work with the endorsing node, specifically:
[0094] Each endorsement node randomly selects two third-ring polynomial vectors and fourth-ring polynomial vectors with the same distribution as the corresponding user public key; each endorsement node calculates a partial commitment value based on the NTRU ring polynomial, the third-ring polynomial vector and the fourth-ring polynomial vector; the second endorsement node sends the partial commitment value and the user public key to the first-layer endorsement node; the second-layer endorsement node calculates a partial aggregate commitment value and a partial aggregate user public key based on the partial commitment value and the user public key received from the third-layer endorsement node, and sends them to the first-layer endorsement node, and the first-layer endorsement node combines the partial aggregate commitment value set and the partial aggregate user public key set of all endorsement nodes and sends them to the client node; the client node calculates the final aggregate commitment value and the final aggregate user public key based on the partial aggregate commitment value set, the partial aggregate user public key set, the corresponding transaction content and the identity information set of each endorsement node, and constructs a transaction proposal based on the final aggregate commitment value, the final aggregate user public key and the corresponding transaction content.
[0095] For example, as shown in Figure (3), the third ring polynomial vector is denoted as r i,0 , let the fourth ring polynomial vector be r i,1 ,in, D represents the probability distribution, which means that the third ring polynomial vector and the fourth ring polynomial vector have the same distribution as the user's public key. The second-layer endorsement node uses the NTRU ring polynomial h and the third ring polynomial vector r to i,0 And the fourth ring polynomial vector is denoted by r i,1 Calculate the partial commitment value as shown in formula (6):
[0096] r i =r i,0 +r i,1 *h; (6)
[0097] The second-layer endorsing nodes will each commit part of their value r i And the user's private key pk i According to the spanning tree structure, it is sent from bottom to top to the first-layer endorsement node P. i ; Second-layer endorsement node S i Receive the third-layer endorsement node set {C i}Partial promise value set and user public key collection Calculate the partially aggregated commitment value and partially aggregated user public key. The calculation formulas are shown in formula (7) and formula (8):
[0098]
[0099]
[0100] Among them, R i Represents the partial aggregate commitment value; r i represents the partial commitment value of the second-layer endorsement node corresponding to the i-th first-layer endorsement node; {C i} represents the third-layer endorsement node set; r j PK represents the partial commitment value of the third-layer endorsement node corresponding to the j-th second-layer endorsement node; i Represents a partially aggregated user public key; pk i pk represents the user public key of the second-layer endorsement node corresponding to the i-th first-layer endorsement node; j Indicates the user public key of the third-layer endorsement node corresponding to the j-th second-layer endorsement node.
[0101] The first-layer endorsement node combines the partially aggregated commitment value set of all endorsement nodes and the partially aggregated user public key set and sends it to the client node, where the partially aggregated commitment value set of all endorsement nodes is recorded as The partially aggregated user public key set of all endorsing nodes is denoted as C 0 Represents the set of all endorsing peers.
[0102] The client node aggregates the commitment value set based on the partial Partially aggregated user public key set The corresponding transaction Tx and the identity information set of each endorsing node {ID i} Calculate the final aggregate commitment value R and the final aggregate user public key PK, and construct the transaction proposal Tx based on the final aggregate commitment value R, the final aggregate user public key PK and the corresponding transaction content. The corresponding calculation formulas are shown in formulas (9) to (11):
[0103]
[0104]
[0105] Tx=M||Cert u ; (11)
[0106] Among them, H 2 Represents the second hash function. The comments for the remaining parameters are mentioned in the previous paragraph.
[0107] In step S103, each endorsing node simulates the execution of the transaction proposal to obtain a simulated transaction result and calculates the signature endorsement. Specifically:
[0108] The third preset lattice cryptographic algorithm is used to generate and calculate partial signature response values according to the respective user private keys and the final aggregate commitment value, and the third preset lattice cryptographic algorithm is used to calculate the probability value that the signature of each endorsement node can be correctly output according to the partial signature response value. The second-layer endorsement sends the partial signature response value to the first-layer endorsement node; the second-layer endorsement node calculates the partial aggregate signature response value based on the received third-layer endorsement node and sends it to the first-layer endorsement node; the first-layer endorsement node combines the partial aggregate signature response value set of all endorsement nodes and sends it to the client node; the client calculates the final aggregate signature response value based on the partial aggregate signature response value set, and obtains the multi-signature of the transaction consisting of the signatures of each endorsement node.
[0109] For example, as shown in Figure (3), each endorsement node uses the final aggregate commitment value R and the user's private key sk i =(s i,0 ,s i,1 ), calculate the partial signature response value. The calculation formula of the partial signature response value of the second-layer endorsement node is shown in formula (12) to formula (14):
[0110] z i =(z i,0 ,z i,1 ); (12)
[0111] in,
[0112] z i,0 =s i,0 *R+r i,0 ; (13)
[0113] z i,1 =s i,1 *R+r i,1 ; (14)
[0114] z i,0 Indicates the first part of the signature response value, z i,1 Indicates the second part of the signature response value, z i By z i,0 and z i,1Composition; i,0 represents the first ring polynomial vector; r i,0 represents the third ring polynomial vector; R represents the final aggregate commitment value; s i,1 represents the second ring polynomial vector; r i,1 Represents the fourth ring polynomial vector.
[0115] In some embodiments, a third preset lattice cryptographic algorithm is used to calculate the probability value that the signature can be correctly output according to the partial signature response value of each endorsement node. The third preset lattice cryptographic algorithm is the lattice rejection sampling theorem. The calculation formula of the probability value is shown in formula (15):
[0116]
[0117] Where min(·) means finding the minimum value; D means probability distribution; n and σ respectively represent the integer and standard deviation of the NTRU grid setting; z i Indicates the partial signature response value; M is a constant; s i,0 represents the first ring polynomial vector; s i,1 represents the second ring polynomial vector; R represents the final aggregate commitment value.
[0118] The second-layer endorsing nodes send their respective partial signature response values z i According to the spanning tree structure, it is sent from bottom to top to the first-layer endorsement node P. i ; Second-layer endorsement node S i Receive the third-layer endorsement node set {C i}Partial signature response value set Calculate the partial aggregate signature response value, as shown in formula (16):
[0119]
[0120] Among them, Z i Represents the partial aggregate signature response value; z i Represents the partial signature response value of the second-layer endorsement node corresponding to the i-th first-layer endorsement node; {C i} represents the third-layer endorsement node set; z j Represents the partial signature response value of the third-layer endorsement node corresponding to the j-th second-layer endorsement node.
[0121] According to the partial signature response value z mentioned above i By z i,0 and z i,1 Formula (16) can also be written in the form of formula (17):
[0122]
[0123] Among them, Z i,0 and Z i,1 The calculation formula is shown in formulas (18) and (19):
[0124]
[0125]
[0126] Correspondingly, Z i,0 Represents the first part of the aggregate signature response value, Z i,1 Represents the second part of the aggregate signature response value, Z i By Z i,0 and Z i,1 composition.
[0127] The first-layer endorsement node combines the partial aggregate signature response value set of all endorsement nodes and sends it to the client node, where the partial aggregate signature response value set of all endorsement nodes is recorded as C 0 Represents the set of all endorsing nodes. The client node responds to the partial aggregate signature value set as Calculate the final aggregate signature response value as shown in formula (20):
[0128]
[0129] Similarly, the final aggregate signature response value can also be expressed as shown in formulas (21) to (23):
[0130] Z=(Z 0 ,Z 1 ); (twenty one)
[0131]
[0132]
[0133] Correspondingly, Z 0 Represents the first final aggregate signature response value, Z 1 Represents the second final aggregate signature response value, Z is composed of Z 0 and Z 1 composition.
[0134] The client node collects the signatures of all endorsing nodes, and constructs a multi-signature for the corresponding transaction based on the transaction proposal Tx, the final aggregate signature response value Z, and the final aggregate commitment value R. The multi-signature can be recorded as σ(Tx) = (Tx, Z, R), which is used to verify the legitimacy of the transaction.
[0135] In step S104, the client node uses the transaction proposal, the final aggregate user public key and the identity information of each endorsing node to verify the final aggregate signature response value and the final aggregate commitment value in the multi-signature. If the verification passes, the transaction proposal and the multi-signature are packaged and sent to the sorting node.
[0136] In some embodiments, when the client node verifies whether the multi-signature is valid, the equality conditions shown in formula (24) and formula (25) are used. If both equations are true, the verification is successful, otherwise the verification fails:
[0137]
[0138] R=H 2 (Z 0 +Z 1 *hR*PK,ID,Tx); (25)
[0139] Where Z represents the final aggregate signature response value; Z 0 Represents the first final aggregate signature response value, Z 1 Represents the second final aggregate signature response value, Z is composed of Z 0 and Z 1 N represents the number of endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting, respectively; R represents the final aggregate commitment value; H 2 represents the second hash function; h represents the NTRU ring polynomial; PK represents the final aggregated user public key; ID represents the identity information of each endorsing node; Tx represents a transaction proposal.
[0140] In step S105, the sorting node collects the transaction proposal set {Tx} and the multi-signature set {σ(Tx)} from different client nodes, sorts the transactions received within the preset time period according to the preset configuration rules, and then packages the sorted batch transactions into data blocks, and then broadcasts the data blocks to the verification nodes of the alliance chain network throughout the network. Among them, each verification node should receive a set of transactions in the same order of occurrence to ensure data consistency.
[0141] In step S106, the verification node verifies the transaction proposal of each transaction in the data block, the final aggregate signature response value in the multi-signature, and the final aggregate commitment value. If the verification passes, the consortium chain network updates the ledger and completes the transaction.
[0142] In some embodiments, when verifying whether the multi-signature verification is valid, the verification node uses the equation conditions shown in formula (24) and formula (25) mentioned above. If both equations are true, the verification is successful, otherwise the verification fails:
[0143]
[0144] R=H 2 (Z 0 +Z 1 *hR*PK,ID,Tx); (25)
[0145] Where Z represents the final aggregate signature response value; Z 0 Represents the first final aggregate signature response value, Z 1 Represents the second final aggregate signature response value, Z is composed of Z 0 and Z 1 N represents the number of endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting, respectively; R represents the final aggregate commitment value; H 2 represents the second hash function; h represents the NTRU ring polynomial; PK represents the final aggregated user public key; ID represents the identity information of each endorsing node; Tx represents a transaction proposal.
[0146] Based on formula (24) and formula (25), the transaction proposal Tx and its corresponding multi-signature σ(Tx) = (Tx, Z, R) are input and the multi-signature verification algorithm is executed, which can pass the verification correctly. Among them, due to the rejection sampling theorem, (z i,0 ,z i,1 ) is close to the distribution of Therefore, for any i=1,2,...,N, it satisfies therefore Established.
[0147] also,
[0148]
[0149]
[0150] And according to the algorithm design described above, we have as well as Therefore, formula (25) R = H 2 (Z 0 +Z 1 *hR*PK,ID,Tx) equation holds true, and the alliance chain multi-signature transaction method based on lattice cryptography provided by the present invention is correct.
[0151] The present invention also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of a low-sampling WiFi perception enhancement model training method, a low-sampling WiFi perception enhancement method, and a method for perceiving target object motion behavior based on low-sampling WiFi.
[0152] Corresponding to the above method, the present invention also provides a device, which includes a computer device, the computer device includes a processor and a memory, the memory stores computer instructions, the processor is used to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the device implements the steps of the method described above.
[0153] The embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the aforementioned edge computing server deployment method are implemented. The computer-readable storage medium can be a tangible storage medium, such as a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a floppy disk, a hard disk, a removable storage disk, a CD-ROM, or any other form of storage medium known in the technical field.
[0154] In summary, the present invention provides a multi-signature transaction method and device for a consortium chain based on lattice cryptography. By initializing the consortium chain network, the trusted key generation center generates the system master key and public parameters using the NTRU lattice trapdoor generation algorithm, and generates the user public and private key pairs of the designated endorsement node using the lattice Gaussian sampling algorithm. The user initiates a transaction through the client node, the client node constructs a transaction proposal and sends it to the endorsement node for simulated execution, and the endorsement node uses the lattice rejection sampling theorem to generate the signature endorsement of the transaction proposal; the client node collects the simulated transaction results and signature endorsements of each endorsement node to generate multiple signatures; the client sends the valid transaction and its multiple signatures to the sorting node; the sorting node sorts the transaction set and packages it into data blocks and broadcasts it to the verification node, the verification node verifies the data blocks and synchronously updates the ledger to realize the transaction. The present invention adopts lattice cryptography technology and uses difficult problems with small integers on the lattice to generate keys. It can resist quantum computing attacks, and the multiple signatures are unforgeable. Attackers cannot destroy alliance chain transactions by forging multiple signatures, and it has post-quantum security. At the same time, the present invention supports public key aggregation, and the verification node only uses the aggregated public key to verify the correctness of the transaction signature endorsement, which reduces the computing overhead and storage overhead of the alliance chain nodes, thereby improving the efficiency of the overall alliance chain transaction solution and making it highly efficient.
[0155] Furthermore, the endorsement node adopts a spanning tree structure. Each endorsement node can communicate from top to bottom or from bottom to top using the spanning tree structure. The huge amount of computation in the endorsement process can be reasonably distributed to each node through the spanning tree structure, thereby allowing the number of endorsement nodes to be expanded to thousands, making it scalable.
[0156] It should be understood by those skilled in the art that the exemplary components, systems and methods described in conjunction with the embodiments disclosed herein can be implemented in hardware, software or a combination of the two. Whether it is 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. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present invention are programs or code segments used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link via a data signal carried in a carrier.
[0157] It should be clear that the present invention is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present invention is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present invention.
[0158] In the present invention, features described and / or illustrated for one embodiment may be used in the same or similar manner in one or more other embodiments, and / or combined with features of other embodiments or replace features of other embodiments.
[0159] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the embodiments of the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
Claims
1. A multi-signature transaction method for alliance chain based on lattice cryptography, characterized in that: The method is run on a consortium chain network, which includes users, a trusted key generation center, client nodes, endorsement nodes specified by a preset endorsement policy, sorting nodes, and verification nodes; The method comprises the following steps: The user initiates a transaction through the client node based on a preset alliance chain network; wherein the preset includes: the trusted key generation center uses a first preset lattice cryptographic algorithm to generate a system master key and public parameters, and the public parameters include the number of endorsement nodes, NTRU ring polynomials and multiple hash functions; the hash value is calculated using the hash function according to the identity information of each endorsement node as the user public key of each endorsement node; the first ring polynomial vector and the second ring polynomial vector are calculated using a second preset lattice cryptographic algorithm according to the user public key and the master key, and the first ring polynomial vector and the second ring polynomial vector are used as the user private key of each endorsement node; The client node is used as a root node and the endorsement node is used as a child node to construct a multi-layer spanning tree. Each endorsement node calculates a partial commitment value according to the user public key and the NTRU ring polynomial, sends the partial commitment value and user public key of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate commitment value set and a partial aggregate user public key set; the client node calculates a final aggregate commitment value and a final aggregate user public key according to the partial aggregate commitment value set, the partial aggregate user public key set, the corresponding transaction content and the identity information of each endorsement node, and constructs a transaction proposal according to the final aggregate commitment value, the final aggregate user public key and the corresponding transaction content, and sends it to each endorsement node; Each endorsement node simulates the execution of the transaction proposal to obtain a simulated transaction result, and calculates a partial signature response value based on the respective user private keys and the final aggregate commitment value, and uses a third preset grid cryptographic algorithm to calculate the probability value that the signature of each endorsement node can be correctly output based on the partial signature response value, and sends the partial signature response value and signature of each endorsement node to the upper node from bottom to top, and calculates a partial aggregate signature response value set; the client calculates the final aggregate signature response value based on the partial aggregate signature response value set, and obtains a multi-signature consisting of the signatures of each endorsement node; the multi-signature includes the transaction proposal, the final aggregate signature response value and the final aggregate commitment value; The client node verifies the final aggregate signature response value and the final aggregate commitment value in the multi-signature using the transaction proposal, the final aggregate user public key and the identity information of each endorsing node. If the verification passes, the transaction proposal and the multi-signature are packaged and sent to the sorting node; The sorting node sorts the transactions received within a preset time according to preset rules, packages the sorted batch transactions into data blocks and broadcasts them to the verification node across the network; The verification node verifies the transaction proposal of each transaction in the data block, the final aggregate signature response value in the multi-signature, and the final aggregate commitment value. If the verification passes, the alliance chain network updates the ledger and completes the transaction.
2. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: The trusted key generation center uses a first preset lattice cryptographic algorithm to generate a system master key and public parameters, and also includes the following steps: The alliance chain network sets system security parameters, the number of endorsement nodes and two hash functions; Initialize an NTRU lattice, and generate an NTRU ring polynomial and an NTRU high-quality short lattice basis based on the first preset lattice cryptographic algorithm; Using the NTRU high-quality short lattice basis as the master key, and using the parameters of the NTRU lattice, the number of the endorsement nodes, two hash functions, and the NTRU ring polynomial as the public parameters; The first preset lattice cryptographic algorithm is a lattice-based trapdoor generation algorithm, and the calculation formula is: TrapGen NTRU (n,q,σ); Among them, TrapGen NTRU represents the NTRU lattice trapdoor generation algorithm; n, q, σ represent the integer, prime number and standard deviation of the NTRU lattice setting respectively.
3. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: A first ring polynomial vector and a second ring polynomial vector are obtained by calculating the user public key and the master key using a second preset lattice cryptographic algorithm, wherein the second preset lattice cryptographic algorithm is a lattice-based Gaussian sampling algorithm, and the calculation formula is: Gaussian-Sampler NTRU (B,σ,(pk i ,0)); Among them, Gaussian-Sampler NTRU represents the lattice-based Gaussian sampling algorithm; B represents the master key; σ represents the standard deviation of the NTRU lattice setting; pk i Represents the user public key of the i-th endorsing node.
4. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: The client node is used as a root node and the endorsement node is used as a child node to construct a multi-layer spanning tree, further comprising: The endorsement nodes have a first-layer endorsement node, a second-layer endorsement node and a third-layer endorsement node from top to bottom with the client node as the root node; the client node is connected to multiple first-layer endorsement nodes, each first-layer endorsement node is connected to multiple second-layer endorsement nodes, and each second-layer endorsement node is connected to multiple third-layer endorsement nodes.
5. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 4 is characterized in that: Each endorsing node sends the partial commitment value and user public key of each endorsing node to the upper node from bottom to top according to the partial commitment value calculated by the user public key and the NTRU ring polynomial, and calculates a partial aggregate commitment value set and a partial aggregate user public key set, further comprising the following steps: Each endorsing node randomly selects two third ring polynomial vectors and a fourth ring polynomial vector having the same distribution as the user public key; Each endorsing node calculates the partial commitment value according to the NTRU ring polynomial, the third ring polynomial vector and the fourth ring polynomial vector; The second-layer endorsement node sends the partial commitment value and the user public key to the first-layer endorsement node; the second-layer endorsement node calculates a partial aggregate commitment value and a partial aggregate user public key based on the partial commitment value and the user public key received from the third-layer endorsement node, and sends them to the first-layer endorsement node; The first-layer endorsement node combines the partially aggregated commitment value set and the partially aggregated user public key set of all endorsement nodes and sends them to the client node.
6. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 4 is characterized in that: The method further comprises the following steps: calculating a partial signature response value according to respective user private keys and the final aggregate commitment value, calculating the signature of each endorsement node according to the partial signature response value using a third preset grid cryptographic algorithm, sending the partial signature response value and signature of each endorsement node to the upper node from bottom to top, and calculating a partial aggregate signature response value set. The second-layer endorsement sends the partial signature response value to the first-layer endorsement node; the second-layer endorsement node calculates a partial aggregate signature response value according to the received third-layer endorsement node, and sends it to the first-layer endorsement node; The first-layer endorsement node combines the partial aggregate signature response value set of all endorsement nodes and sends it to the client node.
7. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: The partial signature response value is calculated according to the respective user private keys and the final aggregate commitment value, and the probability value that the signature of each endorsement node can be correctly output is calculated according to the partial signature response value using a third preset lattice cryptographic algorithm. The third preset lattice cryptographic algorithm is the lattice rejection sampling theorem, and the calculation formula of the probability value is: Wherein, min(·) means to find the minimum value; D means probability distribution; n and σ respectively represent the integer and standard deviation of the NTRU grid setting; z i represents the partial signature response value; M is a constant; s i,0 represents the first ring polynomial vector; s i,1 represents the second ring polynomial vector; R represents the final aggregate commitment value.
8. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: The client node verifies the final aggregate signature response value and the final aggregate commitment value in the multi-signature using the transaction proposal, the final aggregate user public key and the identity information of each endorsement node. The verification must satisfy the following conditions at the same time: R=H2(Z0+Z1*hR*PK,ID,Tx); Among them, Z represents the final aggregate signature response value; Z0 represents the first final aggregate signature response value, Z1 represents the second final aggregate signature response value, and Z is composed of Z0 and Z1; N represents the number of the endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting respectively; R represents the final aggregate commitment value; H2 represents the hash function; h represents the NTRU ring polynomial; PK represents the final aggregate user public key; ID represents the identity information of each endorsing node; Tx represents the transaction proposal.
9. The alliance chain multi-signature transaction method based on lattice cryptography according to claim 1 is characterized in that: The transaction proposal of each transaction in the data block and the final aggregate signature response value and the final aggregate commitment value in the multi-signature are verified at the verification node. The verification must satisfy the following conditions at the same time: R=H2(Z0+Z1*hR*PK,ID,Tx); Among them, Z represents the final aggregate signature response value; Z0 represents the first final aggregate signature response value, Z1 represents the second final aggregate signature response value, and Z is composed of Z0 and Z1; N represents the number of the endorsing nodes; n and σ represent the integer and standard deviation of the NTRU grid setting respectively; R represents the final aggregate commitment value; H2 represents the hash function; h represents the NTRU ring polynomial; PK represents the final aggregate user public key; ID represents the identity information of each endorsing node; Tx represents the transaction proposal.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.
