CVCQ: Off-Chain Committee-Based Verifiable Cross-Chain Query Scheme for Large-Scale BIoT

Blockchain with the Internet of Things (BIoT) denotes that the blockchain system is used for managing node identities in centerless IoT. Large-scale BIoT (L-BIoT) means many blockchains are used for managing node identities from different IoTs. The verifiable query scheme for BIoT was widely discussed in real-time IoT system. However, the query scheme will require cross-chain operations when BIoT expands into L-BIoT. Cross-chain verifiable query schemes for BIoT exist two issues. 1) Multiround Consensus: Cross-chain query requires the relay chain and related chains to participate in consensus, and each interaction requires initiating one consensus round. 2) High-Overhead Verification: Each data item returned by various blockchains requires individual integrity verification. We propose CVCQ, an off-chain committee (OC)-based verifiable cross-chain query scheme for L-BIoT. CVCQ achieves only one-round consensus by shifting the on-chain data query and consensus to an OC. Meanwhile, the aggregation accumulator and proofs are utilized to verify data integrity, ensuring the low-overhead verification. We proved that CVCQ reduces complexity of consensus from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m^{\lambda +1}+m\cdot N^{\lambda })$ </tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m^{\lambda })$ </tex-math></inline-formula>, and decreases the computational complexity of verification from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m\log n)$ </tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(1)$ </tex-math></inline-formula>, when cross-chain data query involving m regional IoTs with N nodes and n data. The experiment results show that CVCQ outperforms the existing schemes by achieving higher on-chain throughput and lower latency.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-23
DOI
https://doi.org/10.1109/jiot.2024.3521413
Citations
1
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.78

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CVCQ: Off-Chain Committee-Based Verifiable Cross-Chain Query Scheme for Large-Scale BIoT

Lu Liu, Liangmin Wang, Pengyan Liu, Cunzheng Zhang et al.
1 citations
IEEE Internet of Things Journal
Cloud Computing and Resource Management
0.78
article

CVCQ: Off-Chain Committee-Based Verifiable Cross-Chain Query Scheme for Large-Scale BIoT

Lu Liu, Liangmin Wang, Pengyan Liu, Cunzheng Zhang, Zhan Xie, Xiaoyu Zhang, Liang Wang, Haotian Yang
article en
1 citations

Abstract

Blockchain with the Internet of Things (BIoT) denotes that the blockchain system is used for managing node identities in centerless IoT. Large-scale BIoT (L-BIoT) means many blockchains are used for managing node identities from different IoTs. The verifiable query scheme for BIoT was widely discussed in real-time IoT system. However, the query scheme will require cross-chain operations when BIoT expands into L-BIoT. Cross-chain verifiable query schemes for BIoT exist two issues. 1) Multiround Consensus: Cross-chain query requires the relay chain and related chains to participate in consensus, and each interaction requires initiating one consensus round. 2) High-Overhead Verification: Each data item returned by various blockchains requires individual integrity verification. We propose CVCQ, an off-chain committee (OC)-based verifiable cross-chain query scheme for L-BIoT. CVCQ achieves only one-round consensus by shifting the on-chain data query and consensus to an OC. Meanwhile, the aggregation accumulator and proofs are utilized to verify data integrity, ensuring the low-overhead verification. We proved that CVCQ reduces complexity of consensus from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m^{\lambda +1}+m\cdot N^{\lambda })$ </tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m^{\lambda })$ </tex-math></inline-formula>, and decreases the computational complexity of verification from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(m\log n)$ </tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(1)$ </tex-math></inline-formula>, when cross-chain data query involving m regional IoTs with N nodes and n data. The experiment results show that CVCQ outperforms the existing schemes by achieving higher on-chain throughput and lower latency.

IEEE Internet of Things JournalVol. 12(9)
Jiangsu University (CN), University of Leicester (GB), Jiangsu Academy of Agricultural Sciences (CN), Southeast University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 18%
Cloud Computing and Resource Management
0.78
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.