A method for cross-chain data integrity verification based on a regulatory chain

By auditing and verifying cross-chain data through a regulatory chain, and utilizing elliptic curve groups and hash functions, the problem of data tampering in cross-chain data integrity verification is solved, achieving efficient data integrity verification and malicious entity location, and protecting data privacy.

CN116484434BActive Publication Date: 2026-11-10NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310304968.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-03-27
Publication Date
2026-11-10
Estimated Expiration
2043-03-27

AI Technical Summary

Technical Problem

Existing cross-chain data integrity verification methods cannot effectively prevent data tampering and cannot reverse-engineer the original data, resulting in a lack of data integrity assurance.

Method used

The regulatory chain is used to audit cross-chain data. By generating challenge information and integrity proofs, data processing and verification are performed using elliptic curve groups and hash functions. Combined with bilinear aggregate signature technology, batch verification is achieved to locate malicious entities.

Benefits of technology

It effectively prevents cross-chain data tampering, can locate malicious entities, protect data privacy, and improves verification efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116484434B_ABST
    Figure CN116484434B_ABST
Patent Text Reader

Abstract

This invention discloses a cross-chain data integrity verification method based on a regulatory chain. First, the sending chain segments the on-chain data, generates tags, and sends them to the receiving chain. Upon receiving the data, the receiving chain verifies the consistency between the data and the tags. If the verification is successful, the data is stored on the chain. During the audit period, the regulatory chain periodically challenges the regulated sending and receiving chains according to the required verification frequency. The smart contract in the receiving chain generates an integrity proof based on the on-chain data content and replies to the regulatory chain. The smart contract in the sending chain generates an integrity proof based on the on-chain data and corresponding tags and replies to the regulatory chain. Finally, the regulatory chain verifies the integrity of the cross-chain data based on the integrity proofs from the sending and receiving chains. When the integrity proof is compromised, the regulatory chain identifies the dishonest entity. Furthermore, based on single-record verification, this invention also enables batch verification, improving verification efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of blockchain cross-chain data integrity verification technology, specifically a cross-chain data integrity verification method based on a regulatory chain. Background Technology

[0002] Blockchain technology is a decentralized distributed ledger technology, whose greatest advantages are data immutability and security. However, with the continuous development of blockchain technology, cross-chain technology is gradually becoming a development trend. Cross-chain technology allows data transmission and sharing between different blockchains, thereby expanding the scope of blockchain applications. However, because data transmission between different blockchains involves data integrity verification, the development of cross-chain technology also faces some challenges.

[0003] Currently, cross-chain data integrity verification primarily uses hash values. Specifically, the data is hashed, the hash value is transmitted to another chain, and then the hash values ​​are verified on that chain to determine data integrity. However, this method has some drawbacks. First, because hash values ​​are one-way, it's impossible to deduce the original data from the hash value. Second, if an attacker successfully tampers with the original data, they can also tamper with the hash value, thus failing to completely guarantee data integrity.

[0004] Therefore, a new cross-chain data integrity verification method is needed to solve the above problems. Summary of the Invention

[0005] Purpose of the invention: The purpose of this invention is to provide a cross-chain data integrity verification method based on a custodian chain. This method, by deploying a custodian chain to audit cross-chain data, effectively prevents malicious sending and receiving chains from tampering with cross-chain data. Furthermore, when data integrity is compromised, dishonest entities can be located.

[0006] Technical solution: A cross-chain data integrity verification method based on a regulatory chain, comprising the following steps:

[0007] (1) After processing the original file D, the sending chain obtains a data group σ and sends the original file D and the data group σ to the receiving chain. The processing of the original file D by the sending chain includes parameter setting, data block division and signature generation.

[0008] (2) The receiving chain performs consistency verification on the original file D and the data group σ. After the verification is successful, the receiving chain stores the original file D and the data group σ on the chain.

[0009] (3) When the custodian chain verifies the integrity of cross-chain data, the custodian chain generates challenge information chal, chal = {z, c1, c2}, where z represents the number of challenges to be selected. This represents two parameters in the parameter set, where the challenge information chal is sent to the sending chain and the receiving chain;

[0010] (4) After receiving the challenge information, the sending chain and the receiving chain respectively generate their own integrity proof P based on the on-chain data through their on-chain smart contracts. A ={ζ A μ A} and P B ={ζ B μ B ,σ}, reply to the regulatory chain;

[0011] (5) When the supervisory chain receives integrity proof P from the sending chain and the receiving chain A and P B At that time, the chain of custody first verifies the integrity certificates of both parties, and the verification process is as follows:

[0012] First, calculate α. A =h′(ζ A ) and α B =h′(ζ B Then, verify the equation. Is it valid?

[0013] If the equation holds true, the sending and receiving chains are deemed honest, and the cross-chain data integrity verification passes; otherwise, the integrity verification fails.

[0014] For verification failures, the chain of custody needs to locate malicious entities. The location of malicious entities is verified using the following equation:

[0015]

[0016] The integrity proof of the receiving chain is verified by the above formula. If the equation does not hold, it means that the receiving chain did not honestly upload data to the chain, and the receiving chain is judged to be malicious; otherwise, the sending chain did not honestly send the on-chain data to the receiving chain, and the sending chain is judged to be malicious.

[0017] Among them, h i = h(ID||ts||i), where ID is the data identifier, ts is the cross-chain timestamp, and i is the data block index.

[0018] (6) When the regulatory chain needs to perform batch audits on more than one cross-chain data, the regulatory chain generates several challenge messages and sends them to the corresponding sending chain and receiving chain respectively. The blockchain that receives the challenge message replies with an integrity certificate to the regulatory chain, and the regulatory chain completes the batch verification by aggregating the integrity certificates.

[0019] Furthermore, the processing of the original file D in step (1) includes:

[0020] Parameter settings: G represents an elliptic curve group, G T It is a multiplicative cyclic group, G and G T Having the same order p; selecting a field Z of the residue class modulo q. q Let g be the generator of G, u be a random element ∈ G, and h be the two hash functions: h: (0, 1) * →G, Two pseudo-random permutation functions π and T are selected, and the system common parameters SP = {g, f, π, e, h, h′, u};

[0021] Data Blocking: The sending chain divides the data D into n blocks, represented as D = {b1, b2, ..., bn}. n};

[0022] Signature generation: The sending chain calculates a signature for each data block.

[0023] Furthermore, in step (2), the consistency verification of the original file D and the data group σ by the receiving chain is performed by the following equation:

[0024]

[0025] If the equation is true, it means that the data group σ received by the receiving link was generated from the original file D, and the verification passes; otherwise, the verification fails.

[0026] Furthermore, the process of generating integrity proofs for the sending chain and the custodian chain in step (4) includes:

[0027] Location challenge index: Calculated separately for the sending and receiving chains: Therefore, the challenge index C = {(i, v} is obtained. i )}, where i is the index of the data block being challenged, v i It is a relevant auxiliary coefficient. Let represent a pseudo-random permutation function with parameter c1, where l is an integer from 1 to z. This represents a pseudo-random permutation function with parameter c2;

[0028] Send chain computation integrity proof: computed based on the challenged block Where, μ′ A b represents the aggregation of the challenged data blocks. i This represents the data block with index i; the sending chain performs a blinding operation on the data, as follows:

[0029] Random selection and calculation Then calculate αA =h′(ζ A ) and μ A =α A μ′ A +r A Finally, the integrity proof P will be performed. A ={ζ A μ A Send to the regulatory chain;

[0030] Receive chain computation integrity proof: computed based on the challenged block. Where, μ′ B b represents the aggregation of the challenged data blocks. i This refers to the data block with index i. The receiving chain performs a blinding operation on the data as follows: randomly selects... and calculation Then calculate α B =h′(ζ B ) and μ B =α B μ′ B +r B and computational data tag aggregation Finally, the integrity proof P will be presented. B ={ζ B μ B , σ} is sent to the regulatory chain;

[0031] Where, ζ A and ζ B It is the auxiliary verification coefficient, μ A and μ B It is the aggregation of challenged data blocks after blinding, and σ is the aggregation of the corresponding signatures of the challenged data blocks.

[0032] Furthermore, the batch verification process in step (6) includes:

[0033] Challenge generation and proof acquisition: Assume the supervisory chain verifies z sending chains, and the verification task in each sending chain is t. k For each k∈[1, z], the supervisory chain generates a corresponding challenge, and each sending chain and the receiving chain corresponding to each cross-chain record replies with a corresponding integrity proof;

[0034] Batch verification: Let α = α A +α B , ζ=ζ A +ζ B , μ=μ A +μ B ;

[0035] The chain of custody can quickly verify the integrity proof using the following equation:

[0036]

[0037] in, It is the number of t in each of the z sending chains. k For each sending record, the auxiliary verification coefficients generated by the sending chain and receiving chain are aggregated. It is a bilinear pairing of the challenged signatures of all cross-chain records in a sending chain and the public key of that sending chain, where u is a system public parameter selected during the setup phase;

[0038] If the equation holds true, it means that all sending and receiving chains are honest and the cross-chain data is complete; otherwise, there are dishonest sending and receiving chains, and the monitoring chain will verify each record individually to find malicious entities.

[0039] Beneficial effects: Compared with existing technologies, the method described in this invention utilizes a supervisory chain to verify the integrity of cross-chain data, enabling the location of malicious entities when the integrity of cross-chain data is compromised. Simultaneously, data blinding technology ensures that data content is not accessed by the supervisory chain, protecting data privacy. Furthermore, this invention employs bilinear aggregate signature technology to achieve batch verification of cross-chain records, improving verification efficiency. Attached Figure Description

[0040] Figure 1 This is a schematic diagram of the model characters of this invention;

[0041] Figure 2 This is an interactive summary diagram of the method described in this invention;

[0042] Figure 3 This is a detailed diagram of the verification process of the method described in this invention. Detailed Implementation

[0043] The technical solutions disclosed in this invention will now be clearly and completely described with reference to the accompanying drawings in the embodiments of this invention.

[0044] refer to Figure 1 , Figure 2 and Figure 3 The present invention provides a cross-chain data integrity verification method based on a regulatory chain. In conjunction with the above-described technical solution, the implementation of the present invention mainly includes the following six stages:

[0045] (1) Smart contract deployment phase, which is completed by the custodian chain, the sending chain and the receiving chain.

[0046] The regulatory chain deploys registration and verification smart contracts on-chain. The sending and receiving chains each deploy integrity proof generation contracts. Specifically, the registration smart contract is primarily responsible for providing registration services to the regulated chain, the verification smart contract is primarily responsible for verifying the integrity of cross-chain data, including generating challenges and verification proofs, and the integrity proof generation contract is primarily responsible for generating integrity proofs based on the challenges and on-chain data.

[0047] (2) Parameter setting stage, which is completed by the chain of custody.

[0048] G is an elliptic curve group, G T It is a multiplicative cyclic group, G and G T They have the same order p. Choose a domain Z of the residue class modulo q. q Let g be the generator of G, u be a random element ∈ G, and h be the hash function: (0, 1). * →G, Choose two pseudo-random permutation functions, π and f.

[0049] (3) Registration phase, which is completed by the sending chain.

[0050] Sending chain selects private key Calculate x·inv≡1(mod p), public key pk=g inv The sending chain publishes its public key within the system, and the custodian chain, upon receiving it, completes the registration process in the registration smart contract.

[0051] (4) Data transmission stage, which is completed by the transmission chain.

[0052] The sending chain divides the data to be crossed into blocks and generates signatures for each data block. The specific process is as follows:

[0053] Data Blocking: The sending chain divides the data D into n blocks, represented as D = {b1, b2, ..., bn}. n};

[0054] Signature generation: The sending chain calculates a signature for each data block.

[0055] Data transmission: The sending chain sends {ts, D, σ} to the receiving chain.

[0056] (5) Data reception stage, which is completed by the receiving chain.

[0057] The receiving chain performs consistency verification on the original file D and the data group σ, verifying the equation. If the equation is true, the verification passes and the data is uploaded to the blockchain; otherwise, the verification fails and the receiving chain rejects the data to be uploaded.

[0058] Among them, data group σ i It is the signature of the data block with index i, pk is the public key of the sending chain, g is the generator of group G, and h i = h(ID||ts||i), where ID is the data identifier, ts is the cross-chain timestamp, and i is the data block index.

[0059] (6) Cross-chain data integrity verification stage, which is jointly completed by the custodian chain, the sending chain and the receiving chain.

[0060] When the custodian chain verifies the integrity of cross-chain data, it generates a challenge message (chal) and sends it to both the sending and receiving chains. Upon receiving the challenge message, each chain's on-chain smart contract generates its own integrity proof based on the on-chain data and replies to the custodian chain. When the custodian chain receives the integrity proofs from both chains, it first verifies both proofs simultaneously using an equation. If the equation holds, it indicates that both the sending and receiving chains are honest, and the cross-chain data integrity verification passes. Otherwise, the integrity verification fails, and the custodian chain needs to locate malicious entities. It first verifies the integrity proof of the receiving chain separately. If the equation does not hold, it indicates that the receiving chain did not honestly upload data and is malicious. Otherwise, it indicates that the sending chain did not honestly send on-chain data to the receiving chain and is malicious. Specifically, this involves the following steps:

[0061] Challenge information generation: The chain of custody selects the number z to be challenged, and two parameters. chal = {z, c1, c2}. Location challenge index: Calculated separately for the sending and receiving chains. The challenge index is C = {(i, v} i )}, where i is the index of the data block being challenged, v i It is a relevant auxiliary coefficient.

[0062] Send chain computation integrity proof: computed based on the challenged block To protect cross-chain data privacy, a blinding operation is performed on the data: First, randomly select... and calculation Then, calculate α. A =h′(ζ A ) and μ A =α A μ′ A +r A Finally, the integrity proof P will be presented. A ={ζ A μ A Send it to the regulatory chain.

[0063] Receive chain computation integrity proof: computed based on the challenged block. To protect cross-chain data privacy, a blinding operation is performed on the data: First, randomly select... and calculation Then, calculate α. B =h′(ζ B ) and μ B =α B μ′ B +r B And computational data label aggregation. Finally, the integrity proof P B ={ζ B μ B , σ} is sent to the regulatory chain.

[0064] Integrity verification: The chain of custody first calculates α. A =h′(ζ A ) and α B =h′(ζ B Then verify the equation: Does it hold true? If the equation holds true, it means that the sending chain and the receiving chain are honest, and the cross-chain data integrity verification passes; otherwise, the integrity verification fails, and the custodian chain needs to locate malicious entities.

[0065] Malicious Entity Locator: Chain of Supervision Verification Equation: If the equation does not hold true, it means that the receiving chain did not honestly upload data to the chain and is malicious; otherwise, the sending chain did not honestly send the on-chain data to the receiving chain and is malicious.

[0066] Where, ζ A and ζ B It is the auxiliary verification coefficient, μ A and μ B It is the aggregation of challenged data blocks after blinding, and σ is the aggregation of the corresponding signatures of the challenged data blocks.

[0067] (7) Batch verification stage, which is completed by the custodian chain, the sending chain and the receiving chain.

[0068] When the supervisory chain needs to verify t from z sending chains k For a cross-chain record, k∈[1, z]. Batch auditing is completed in the following two steps.

[0069] Challenge generation and proof acquisition: Assume the supervisory chain verifies z sending chains, and the verification task in each sending chain is t. k There are 1, k∈[1, z]. The supervisory chain generates the corresponding challenge, and each sending chain and the receiving chain corresponding to each cross-chain record replies with the corresponding integrity proof.

[0070] Batch verification: Let α = αA +α B , ζ=ζ A +ζ B , μ=μ A +μ B The chain of custody can quickly verify the integrity proof using the following equation:

[0071]

[0072] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

[0073] Example 1

[0074] Based on the steps implemented in this invention, the data block size is set to 4KB and 8KB respectively, and the file size is set to 256KB, 1M, 4M and 8M. On this basis, the time spent on generating the send chain signature, verifying the receive chain signature, generating proofs for the send chain and receive chain and verifying the regulatory chain is statistically analyzed.

[0075] Table 1 shows the statistical results of signature generation in the sending chain and signature verification in the receiving chain. Analysis of Table 1 reveals that the signature generation time in the sending chain is significantly longer than the verification time in the receiving chain. This is because signing requires generating a corresponding signature for each data block, resulting in high computational complexity. In contrast, signature verification in the receiving chain only requires applying a bilinear pairing formula to the aggregated signatures for rapid verification. Furthermore, Table 1 also shows that larger file blocks result in shorter processing times. This is because larger file blocks require fewer computational steps, leading to faster processing. However, for security reasons, it is not advisable to set very large file blocks. Therefore, this embodiment presents the optimal choice: dividing the data blocks into 8KB sizes yields the best results.

[0076] Table 1 Comparison of time costs for generating signatures on the sending chain and verifying signatures on the receiving chain.

[0077]

[0078] Table 2 shows the statistical results of the time spent generating proofs for the sending and receiving chains and verifying them for the custodian chain. Here, the file block size is set to 8KB, and the number of challenges ranges from 50 to 500. Analysis of Table 2 shows that the proof generation time for the sending chain remains relatively constant with the number of challenges. This is because the sending chain only needs to find the corresponding data block based on the index for calculation, without involving complex computations. For the receiving chain, the proof calculation time increases continuously with the number of challenges. This is because the receiving chain also needs to calculate tag aggregation. As the number of challenges increases, more tags need to participate in the calculation, and tag aggregation involves exponential operations, which significantly impacts the calculation time. For the custodian chain, the proof verification calculation time increases continuously with the number of challenges. This is because as the number of challenges increases, the custodian chain needs to calculate more hash values ​​during the verification process, and hash mapping has a significant impact on computation.

[0079] Table 2 Comparison of the time costs of generating proofs for the sending and receiving chains and verifying the supervisory chain as the number of challenges changes.

[0080]

[0081] Furthermore, this embodiment also statistically analyzed the time spent on batch verification. Specifically, it compared the computation time for individual verification and batch verification for 100 to 500 audit tasks, and the statistical results are shown in Table 3. Analysis of Table 3 shows that batch verification saves computation time compared to individual verification, significantly improving verification efficiency.

[0082] Table 3 Comparison of computation time costs for individual validation and batch validation

[0083]

[0084]

[0085] As can be seen from the above embodiments, the verification method of the present invention uses homomorphic verifiable tags for data processing, and the supervisory chain verifies data by randomly selecting data blocks. Furthermore, the supervisory chain aggregates multiple proofs to complete batch verification, greatly improving verification efficiency. This method has good verification efficiency and is a highly efficient verification algorithm.

Claims

1. A cross-chain data integrity verification method based on a blockchain of supervision, characterized in that, The method includes the following steps: (1) Sending chain to the original file After processing, a data set is obtained. and the original file and data group Send to the receiving chain, the sending chain for the original file The processing includes parameter setting, data segmentation, and signature generation; Original document The processes include: Parameter settings: Represents an elliptic curve group. It is a multiplication cyclic group. and Have the same order Select a remaining class module domain Choose the generator g of G, and random elements. Two hash functions: Select two pseudo-random permutation functions and System common parameters ; Data chunking: The sending chain will divide the data Divide into n blocks, represented as ; Signature generation: The sending chain calculates a signature for each data block. Among them, data groups The subscript is The signature of the data block, It is a data identifier. It is a cross-chain timestamp. It is the data block index. It is a random element of group G. Indicates the subscript is Data blocks; (2) The receiving chain for the original file and data group After a consistency verification is performed and passes, the original file is received and stored on the blockchain. and data group ; (3) When the custodian chain verifies the integrity of cross-chain data, the custodian chain generates challenge information. , ,in This indicates the number of challenges to choose from. This represents two parameters in the parameter set, where the challenge information is included. Send to both the sending and receiving chains; (4) After receiving the challenge information, the sending chain and the receiving chain shall generate their respective integrity proofs by their on-chain smart contracts based on the on-chain data. and Restore the regulatory chain; in, and It is an auxiliary verification coefficient. and It is a challenged aggregation of data blocks after blinding. It is the aggregation of the signatures corresponding to the challenged data block; (5) When the supervisory chain receives integrity certificates from the sending chain and the receiving chain and At that time, the chain of custody first verifies the integrity certificates of both parties, and the verification process is as follows: First calculate and Then check and verify the equation. Whether it is valid, It is the public key of the sending chain, and the challenge index. ,in It is the index of the data block being challenged. These are relevant auxiliary coefficients; If the equation holds true, the sending and receiving chains are deemed honest, and the cross-chain data integrity verification passes; otherwise, the integrity verification fails. For verification failures, the chain of custody needs to locate malicious entities. The location of malicious entities is verified using the following equation: The integrity proof of the receiving chain is verified by the above formula. If the equation does not hold, it means that the receiving chain did not honestly upload data to the chain, and the receiving chain is judged to be malicious; otherwise, the sending chain did not honestly send the on-chain data to the receiving chain, and the sending chain is judged to be malicious. (6) When the regulatory chain needs to perform batch audits on more than one cross-chain data, the regulatory chain generates several challenge messages and sends them to the corresponding sending chain and receiving chain respectively. The blockchain that receives the challenge message replies with the integrity proof to the regulatory chain, and the regulatory chain completes the batch verification by aggregating the integrity proof.

2. The cross-chain data integrity verification method based on the chain of custody as described in claim 1, characterized in that, In step (2), the receiving chain receives the original file. and data group Consistency verification is performed using the following equation: If the equation holds true, it means that the data group received by the receiving link is... It is generated from the original file D, and verification passes; otherwise, verification fails; among which, , It is a data identifier. It is a cross-chain timestamp. It is the data block index.

3. The cross-chain data integrity verification method based on the chain of custody as described in claim 1, characterized in that, The process of generating integrity proofs for the sending chain and the custodian chain in step (4) includes: Location challenge index: Calculated separately for the sending and receiving chains: This leads to the challenge subscript. ,in It is the index of the data block being challenged. It is a relevant auxiliary coefficient. The parameter is pseudo-random permutation function, It is an integer from 1 to z. The parameter is The pseudo-random permutation function; Send chain computation integrity proof: computed based on the challenged block. ;in, This represents the aggregation of the challenged data blocks. Indicates the subscript is The data block; the sending chain performs a blinding operation on the data, as follows: Random selection and calculation Then calculate and Finally, the integrity proof will be performed. Send to the custodian chain; Receive chain computation integrity proof: computed based on the challenged block. ,in, This represents the aggregation of the challenged data blocks. Indicates the subscript is The receiving chain performs a blinding operation on the data blocks as follows: randomly selects... and calculation Then calculate and and computational data tag aggregation Finally, the integrity proof will be performed. Send to the custodian chain; among which, and It is an auxiliary verification coefficient. and It is a challenged aggregation of data blocks after blinding. It is the aggregation of the signatures corresponding to the challenged data block.

4. The cross-chain data integrity verification method based on the chain of custody as described in claim 1, characterized in that, The batch verification process in step (6) includes: Generating Challenges and Obtaining Proofs: Assume the custodian chain verifies z sending chains, and the verification task in each sending chain is as follows: indivual, The regulatory chain generates corresponding challenges, and each sending chain and the receiving chain corresponding to each cross-chain record responds with a corresponding integrity proof; Batch verification: set , , ; The chain of custody can quickly verify the integrity proof using the following equation: , in, yes In each of the sending chains For each sending record, the auxiliary verification coefficients generated by the sending chain and receiving chain are aggregated. It is a bilinear pairing of the challenged signatures of all cross-chain records in a sending chain and the public key of that sending chain. These are system common parameters selected during the setup phase; If the equation holds true, it means that all sending and receiving chains are honest and the cross-chain data is complete; otherwise, there are dishonest sending and receiving chains, and the monitoring chain will verify each record individually to find malicious entities.