Data security storage mechanism based on blockchain industrial Internet of Things

Jin Wang, Jiahao Chen, Yongjun Ren*, Pradip Kumar Sharma, Osama Alfarraj, Amr Tolba

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In the age of Industry 5.0, the industrial Internet of Things (IIoT) system has changed from the original “cyber-physical” system to a complex “human-cyber-physical” system, data security issues become more important. Blockchain technology can be used to ensure the security of IIoT data. However, the traditional blockchain system uses Merkle trees to store data, in which the proof size is large when verifying the integrity and correctness of the data. And it is unable to perform batch verification of the data. Large size proof will bring great pressure to communication, causing end-to-end communication delays, which seriously affect the stability, efficiency, and security of IIoT system. To solve it, in the paper, the incremental aggregator subvector commitment (IASVC) is used to replace Merkle tree, which reduces the size of proof and communication consumption. Each block processes 1000 transactions, the proof size of a single data piece is 15% of the original scheme. Moreover, our scheme can realize the aggregation verification of the proof. In addition, the qualifications of data upload on nodes are set using IASVC, which can reduce the storage pressure of nodes by storing a single commitment instead of the entire qualification list.

Original languageEnglish
Article number107903
Number of pages12
JournalComputers and Industrial Engineering
Volume164
Early online date25 Dec 2021
DOIs
Publication statusPublished - 1 Feb 2022

Keywords

  • Blockchain
  • Cryptographic commitment
  • Data storage
  • Industrial Internet of Things
  • Industry 5.0

Fingerprint

Dive into the research topics of 'Data security storage mechanism based on blockchain industrial Internet of Things'. Together they form a unique fingerprint.

Cite this