CN-122001630-A - Relay cross-link method and system applied to block chain cross-link

CN122001630ACN 122001630 ACN122001630 ACN 122001630ACN-122001630-A

Abstract

The invention discloses a relay cross-chain method and a relay cross-chain system applied to block chain cross-chain, and belongs to the technical field of block chain interoperation. The method comprises the steps of carrying out anonymous lottery by candidate nodes through an anonymous verifiable random function combined with weights and a temporary identity key in an anonymous committee election stage, adopting an asynchronous distributed key generation protocol and a reliable broadcasting protocol in a key generation stage, generating a threshold signature private key share on the premise of not reconstructing a complete private key, generating a threshold signature share containing an identity bit vector by the committee members in a cross-chain consensus stage, encrypting the bit vector by an aggregation node through a responsibility public key, generating zero knowledge proof, and constructing a binding relation between an identity ciphertext and an aggregation signature. The invention realizes the identity privacy protection of the whole process of cross-chain verification and solves the problem of key generation deadlock in an asynchronous network environment.

Inventors

WANG FENGQUN
JIN JIE
CUI JIE
WEN WUQUAN
ZHANG QINGYANG
ZHONG HONG

Assignees

安徽大学

Dates

Publication Date: 20260508
Application Date: 20260121

Claims (9)

1. The relay cross-chain method applied to the block chain cross-chain is characterized by comprising the following steps of: the method comprises the steps that S1, an anonymity committee elects, candidate nodes in a relay chain network generate a temporary identity key for a current period based on a long-term identity key, a random function and weight are authenticated by anonymity to locally calculate a random number, and whether the candidate nodes are elected as authentication committee members is authenticated on the premise that long-term identities are not revealed; s2, asynchronous distributed key generation, namely executing an asynchronous distributed key generation protocol between selected committee member nodes, and interacting and generating a threshold signature private key share and a system aggregation public key in an asynchronous network environment; S3, accountability cross-chain consensus that committee members sign the received cross-chain request by utilizing the threshold signature private key share to generate a signature share and a bit vector indicating participation state; And S4, signature aggregation and identity hiding, namely generating an aggregation node through election of a distributed consensus algorithm, collecting signature shares meeting the threshold requirement to generate an aggregation signature, encrypting the bit vector by using a preset accountability public key to generate an identity ciphertext, and generating a zero knowledge proof to construct a binding relation between a signer set hidden by the identity ciphertext and a public key set used for generating the aggregation signature, so as to form a verifiable but identity-hidden cross-chain consensus message.
2. The relay cross-chain method applied to blockchain cross-chains of claim 1, wherein in the anonymity committee election, candidate nodes generating temporary identity keys comprises: constructing bilinear mapping group system Selecting group generator ; Defining a mapping of arbitrary length messages to groups The hash function on: ; candidate node Holding long-term private keys Long term public key , ; Candidate node Selecting randomizing factors Calculating a temporary public key Wherein , Generating non-interactive zero knowledge proof using Chaum-Pedersen protocol 。
3. The relay cross-link method applied to blockchain cross-links of claim 2, wherein in the anonymity committee election, the candidate node verifying whether to elect comprises: obtaining common input of current period And mapped as group elements ; Computing pseudo-random numbers using anonymously verifiable random functions And generate a proof Is a zero knowledge proof of (1); Acquiring total weight of whole network Self weight of Target committee scale Calculating unit weight winning probability ; By using the random number Binary length of (2) Binomial distribution probability quality function Judging whether or not there is an integer The following inequality is satisfied: , If the number of the sub-weights selected by the candidate is calculated as Then it is determined that the node is selected and obtained Ticket weights.
4. The relay cross-chain method applied to blockchain cross-chains according to claim 1, wherein the step of asynchronously distributing key generation specifically comprises: s2.1 asynchronous secret sharing selected committee members Random selection of secret values as a distributor using an asynchronous verifiable secret sharing scheme And construct Polynomial of degree For each other member Calculating secret shares And transmitting in encrypted form while broadcasting the Pedersen commitment of polynomial coefficients ; S2.2 consensus confirmation that the validity of the secret shares is confirmed by running reliable broadcast protocol interaction among the members, and an asynchronous binary Bayesian and horribus protocol is run to determine the member set of the valid contribution shares Wherein ; S2.3 share derivation, each member is set-based Local aggregation calculates own threshold private key share System aggregate public key : , Wherein Is a member A commitment constant for the broadcast.
5. The method for relay cross-chain applied to blockchain cross-chain of claim 1, wherein in the accountability cross-chain consensus, a specific formula for generating signature shares is as follows Committee member Using private key shares Computing BLS signature shares : Wherein To map messages to groups Is used for the hash function of (a).
6. The relay cross-chain method applied to the blockchain cross-chain according to claim 1, wherein the construction of the binding relationship in the signature aggregation and identity hiding step specifically comprises: Aggregation node construction bit vector For nodes participating in signature Order-making Otherwise ; Using system accountability public keys Random number ElGamal encryption is carried out on the bit vector component to generate an identity ciphertext For each component in the text ; Verification node calculates temporary aggregation public key And verifies whether the bilinear peer-to-peer equation holds true to validate the aggregate signature Effectiveness is as follows: Simultaneous verification of zero knowledge proof To ensure that Is composed of cipher text Hidden identity in the vector is constructed correctly.
7. The relay cross-chain method applied to blockchain cross-chains of claim 6, further comprising the steps of malicious behavior tracking and accountability: When the double signature or the invalid transaction signature aiming at the same block height is monitored, submitting fraud evidence comprising an aggregate signature, an identity ciphertext and the zero knowledge proof by the accountability node; decrypting the identity ciphertext by using a accountability private key corresponding to the accountability public key, and restoring a node bit vector participating in signature so as to locate the long-term identity ID of the malicious node; And the intelligent contract automatically executes punishment operation of not receiving the locking weight of the malicious node and removing the qualification of the committee according to the positioning result.
8. The relay cross-chain method applied to blockchain cross-chains according to claim 1, wherein the method adopts a pipeline parallel processing mechanism: When the relay chain processes the cross-link request consensus step of the ith period and detects that the block height of the ith period reaches a preset election trigger threshold, the anonymity committee election step and the asynchronous distributed key generation step of the (i+1) th period are started in parallel in the background, so that the consensus key of the (i+1) th committee is built before the ith period is finished.
9. A relay cross-chain system for use in a blockchain cross-chain, comprising: a memory for storing computer program instructions; A processor coupled to the memory for executing the computer program instructions to perform the functions of the following modules: the anonymous election module is used for configuring candidate nodes to generate temporary identity keys based on long-term identity keys, and locally calculating random numbers by combining anonymous verifiable random functions and weights so as to verify whether the candidate nodes are selected as members of a verification committee; The asynchronous key generation module is used for configuring the selected member to execute an asynchronous distributed key generation protocol in an asynchronous network environment to generate a threshold signature private key share and a system aggregation public key; The accountability consensus module is used for signing the cross-chain request by the configuration committee member by utilizing the threshold signature private key share and generating a bit vector indicating the participation state; And the aggregation and binding module is used for collecting signature shares to generate an aggregate signature, encrypting the bit vector by using the accountability public key to generate an identity ciphertext, and generating a zero knowledge proof to construct a binding relationship between the identity ciphertext and the aggregate signature.

Description

Relay cross-link method and system applied to block chain cross-link Technical Field The invention belongs to the technical field of block chain and cross-chain interoperation, and particularly relates to a relay cross-chain method and system applied to block chain cross-chain. Background With the development of blockchain technology, the effect of data island among different chains is increasingly prominent, and a cross-chain technology becomes a key for realizing interoperability. Among them, the scheme based on the relay chain (RELAY CHAIN) is widely adopted because of its high degree of decentration. However, existing relay link cross-link schemes still face significant security and efficiency challenges during the cross-link request validation process, especially in terms of ensuring anonymity and accountability of the overall cross-link process. In addition, as more block chains join the relay chain, the number of transactions and status updates that need to be processed increases dramatically, easily resulting in system bottlenecks and reduced throughput. In recent years, some studies have attempted to address the problem of cross-chain security and efficiency at the consensus layer, particularly with respect to verifier committee elections and transaction voting mechanisms. Most existing studies use consensus protocols based on verifiable random functions to elect verifier committee members and use threshold signatures to effect transaction voting. However, these schemes tend to be difficult to achieve an effective balance between safety and efficiency. For example, some schemes achieve anonymity, but their ring signature proof size increases rapidly with increasing committee size, resulting in high interactivity and inefficiency, while others suffer from collusion attacks and distributed denial of service attacks due to the public and fixed committee membership. More importantly, the existing schemes generally lack an effective accountability mechanism, are difficult to trace and punish the passive or malicious behaviors of committee participants in time, and have insufficient asynchronous environmental adaptability caused by network fluctuation. Disclosure of Invention Aiming at the defects of the prior art, the invention aims to provide a relay chain crossing method and a system applied to block chain crossing, which can realize a relay chain crossing scheme with anonymity, asynchronous robustness and behavior accountability simultaneously in a complex network environment. The technical scheme is that the relay cross-link method applied to the block chain cross-link comprises the following steps: the method comprises the steps that S1, an anonymity committee elects, candidate nodes in a relay chain network generate a temporary identity key for a current period based on a long-term identity key, a random function and weight are authenticated by anonymity to locally calculate a random number, and whether the candidate nodes are elected as authentication committee members is authenticated on the premise that long-term identities are not revealed; s2, asynchronous distributed key generation, namely executing an asynchronous distributed key generation protocol between selected committee member nodes, and interacting and generating a threshold signature private key share and a system aggregation public key in an asynchronous network environment; S3, accountability cross-chain consensus that committee members sign the received cross-chain request by utilizing the threshold signature private key share to generate a signature share and a bit vector indicating participation state; And S4, collecting signature shares meeting the threshold requirement by an aggregation node (the aggregation node is derived from one of nodes selected by AVRF and the relationship between the aggregation node and other nodes is the difference between Follower and a leader node in a distributed system, and selected by Raft algorithm) to generate an aggregation signature, encrypting the bit vector by using a preset accountability public key to generate an identity ciphertext, and generating a zero knowledge proof to construct a binding relationship between a signer set hidden by the identity ciphertext and a public key set used for generating the aggregation signature, so as to form a verifiable but identity-hidden cross-chain consensus message. The invention also provides a relay cross-chain system applied to the block chain cross-chain, which comprises: a memory for storing computer program instructions; A processor coupled to the memory for executing the computer program instructions to perform the functions of the following modules: the anonymous election module is used for configuring candidate nodes to generate temporary identity keys based on long-term identity keys, and locally calculating random numbers by combining anonymous verifiable random functions and weights so as to verify whether the candidate nodes are selected