Towards Efficient Consistency Auditing of Dynamic Data in Cross-Chain Interaction

As blockchain technology matures and its adoption grows across multiple industries, there is a growing need to make the data stored on blockchains adaptable to prevent misuse. However, such modifications can lead to inconsistency when interacting with other blockchains, necessitating the preservation of dynamic data consistency during these cross-chain interactions. While ensuring consistency for static data is relatively straightforward, doing so for dynamic data with efficiency remains a significant challenge. In response, we propose an efficient dynamic cross-chain data consistency auditing model (EDCA), which artfully integrates an advanced gamma multi-signature approach (AGMS) with the designed dynamic Merkle hash tree (D-MHT) to facilitate effective auditing of the consistency for dynamic data in cross-chain interaction. EDCA can produce relatively small auditor states while maintaining the storage proof. Moreover, EDCA is proven to satisfy strong security and privacy guarantees, tag unforgeability, and proof unforgeability. Experimental evaluations confirm that EDCA has high computational and communicational efficiency and can retain a small and relatively constant auditing overhead.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-01-27
DOI
https://doi.org/10.1109/tdsc.2025.3532320
Citations
4
Primary Topic
Advanced Database Systems and Queries
Type
article
Field-Weighted Citation Impact
5.95
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards Efficient Consistency Auditing of Dynamic Data in Cross-Chain Interaction

Longxiang Gao, Jiajia Jiang, Zhihong Tian, Yushu Zhang et al.
4 citations
IEEE Transactions on Dependable and Secure Computing
Advanced Database Systems and Queries
5.95
article

Towards Efficient Consistency Auditing of Dynamic Data in Cross-Chain Interaction

Longxiang Gao, Jiajia Jiang, Zhihong Tian, Yushu Zhang, Liehuang Zhu, Jiahao Zhao
article en
4 citations

Abstract

As blockchain technology matures and its adoption grows across multiple industries, there is a growing need to make the data stored on blockchains adaptable to prevent misuse. However, such modifications can lead to inconsistency when interacting with other blockchains, necessitating the preservation of dynamic data consistency during these cross-chain interactions. While ensuring consistency for static data is relatively straightforward, doing so for dynamic data with efficiency remains a significant challenge. In response, we propose an efficient dynamic cross-chain data consistency auditing model (EDCA), which artfully integrates an advanced gamma multi-signature approach (AGMS) with the designed dynamic Merkle hash tree (D-MHT) to facilitate effective auditing of the consistency for dynamic data in cross-chain interaction. EDCA can produce relatively small auditor states while maintaining the storage proof. Moreover, EDCA is proven to satisfy strong security and privacy guarantees, tag unforgeability, and proof unforgeability. Experimental evaluations confirm that EDCA has high computational and communicational efficiency and can retain a small and relatively constant auditing overhead.

IEEE Transactions on Dependable and Secure ComputingVol. 22(4)
Beijing Institute of Technology (CN), Qilu University of Technology (CN), Guangzhou University (CN), Shandong Academy of Sciences (CN), National Supercomputing Center in Wuxi (CN), Jiangxi University of Finance and Economics (CN), Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 5%
Advanced Database Systems and Queries
5.95
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.