Next Article in Journal
A Hierarchical Spatial–Temporal Cross-Attention Scheme for Video Summarization Using Contrastive Learning
Next Article in Special Issue
HeriLedger—A New Generation of Blockchains for Cultural Heritage Preservation
Previous Article in Journal
Identification and Localisation Algorithm for Sugarcane Stem Nodes by Combining YOLOv3 and Traditional Methods of Computer Vision
Previous Article in Special Issue
SPCBIG-EC: A Robust Serial Hybrid Model for Smart Contract Vulnerability Detection
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

IoT-Chain and Monitoring-Chain Using Multilevel Blockchain for IoT Security

Department of Computer Engineering, Keimyung University, Daegu 1095, Korea
*
Author to whom correspondence should be addressed.
Submission received: 14 August 2022 / Revised: 23 October 2022 / Accepted: 24 October 2022 / Published: 28 October 2022
(This article belongs to the Special Issue Blockchain of Things: Benefits, Challenges and Future Directions)

Abstract

:
In general, the Internet of Things (IoT) relies on centralized servers due to limited computing power and storage capacity. These server-based architectures have vulnerabilities such as DDoS attacks, single-point errors, and data forgery, and cannot guarantee stability and reliability. Blockchain technology can guarantee reliability and stability with a P2P network-based consensus algorithm and distributed ledger technology. However, it requires the high storage capacity of the existing blockchain and the computational power of the consensus algorithm. Therefore, blockchain nodes for IoT data management are maintained through an external cloud, an edge node. As a result, the vulnerability of the existing centralized structure cannot be guaranteed, and reliability cannot be guaranteed in the process of storing IoT data on the blockchain. In this paper, we propose a multi-level blockchain structure and consensus algorithm to solve the vulnerability. A multi-level blockchain operates on IoT devices, and there is an IoT chain layer that stores sensor data to ensure reliability. In addition, there is a hyperledger fabric-based monitoring chain layer that operates the access control for the metadata and data of the IoT chain to lighten the weight. We propose an export consensus method between the two blockchains, the Schnorr signature method, and a random-based lightweight consensus algorithm within the IoT-Chain. Experiments to measure the blockchain size, propagation time, consensus delay time, and transactions per second (TPS) were conducted using IoT. The blockchain did not exceed a certain size, and the delay time was reduced by 96% to 99% on average compared to the existing consensus algorithm. In the throughput tests, the maximum was 1701 TPS and the minimum was 1024 TPS.

1. Introduction

The use of the Internet of Things (IoT) has been increasing, and it is applied to various services in numerous fields [1], such as healthcare, energy, and smart homes. The anticipated IoT device growth is also on the rise. According to Exploding Topics [2], there are over 700 million IoT devices installed worldwide. That number is expected to over 30 billion by 2025. As IoT devices in homes, industrial environments, transportation networks, and elsewhere continue to proliferate, so does the attack surface for malicious IoT network attackers.
The IoT attack activity in 2020 dramatically surpassed the combined volume of IoT activity observed by IBM Security X-Force [3] in 2019. The IoT network is a centralized structure, and all IoT devices mainly use a structure that is linked to the central cloud, or data are stored in the cloud storage using fog and edge computing technologies. Owing to the centralized structure, the central server processes all data, and security vulnerabilities exist owing to the risk of data forgery and falsification, along with attacks on the central processing system, such as distributed denial of service (DDoS) [4] attacks. Depicted in Figure 1 is the centralization problem of existing IoT servers.
Vulnerabilities in centralized server architecture (1) Problems owing to IoT device performance limitations: The data measured by the sensor are transmitted to the server. The performance is worse than those of the existing PCs and servers, so there exists a limit [5] to applying existing security vulnerability solutions. Therefore, the Mirai botnet [6] may become a device that executes a server DDoS attack owing to malware infection through firmware updates.
Vulnerabilities in centralized server architecture (2) Vulnerabilities owing to fog and edge nodes: These nodes receive real-time data from IoT devices and provide temporary data storage until the necessary data are sent to the cloud. If the fog node is subjected to a security attack [7], it is possible that IoT-generated data may be forged or tampered with. Furthermore, the edge node computes and processes data in edge computing close to the data collection source and sends the data to the cloud. It serves to transmit data. Edge nodes also exhibit a problem in that data are forged and stolen when subjected to a security attack [8].
Vulnerabilities in centralized server architecture (3) Security weakness owing to centralized structure: The administrator is responsible for the performance and management of data stored in the central server. Data may be forged or falsified because of the authority of the administrator of the centralized server [9]. Moreover, owing to attacks by hackers and infected devices, the centralized server affects all systems if one server is attacked as a result of a single point of failure [10].

1.1. Motivation

Blockchain technology is used to solve the problem of centralized structures [11]. Blockchain is a distributed system that shares information with all non-central participants and distributes data to all network nodes using a peer-to-peer (P2P) network. The problem of data forgery and falsification of existing centralized servers can be solved by allowing nodes in all networks to store the same data. In addition, by securing the reliability of data through an inter-node consensus algorithm, the security problem of IoT devices can be solved with the blockchain function.
However, due to the limitations of blockchain technology, there is a limit to operation in IoT devices, and high-performance external cloud and edge computing technologies are used. This guarantees the immutability of the stored data, but it goes through multiple gateways and nodes during the storage process and cannot guarantee the reliability of the data. Therefore, the blockchain-based IoT data management method cannot achieve decentralization and cannot solve the limitations of the existing centralized structure.

1.2. Challenges

Blockchain technology can solve the security vulnerabilities of IoT devices, but it has the following limitations.

1.2.1. Capacity Requirement

For an IoT device to become a full node that maintains the blockchain in the blockchain network, all of the blockchains must be stored in storage. However, IoT devices are not suitable for participating as full nodes in blockchain networks because of their low storage capacities.

1.2.2. Consensus Requirement

The consensus algorithm for block generation uses proof of work (PoW) [12], which requires a high amount of CPU operation, or practical Byzantine fault tolerance (PBFT) [13], which requires a certain amount of network communication. For IoT devices, a consensus algorithm that requires substantial computation is not suitable owing to its low performance [14], and a consensus algorithm that requires substantial communication in an IoT network with many nodes is not effective, particularly when using a wireless network.

1.2.3. Data Privacy

Blockchain discloses data transparently, as all nodes have the same blockchain. As IoT data are increasingly used, personal data are also created and managed; thus, data privacy must be guaranteed.

1.3. Contribution

We propose an IoT-operable blockchain that overcomes the limitations of the blockchain that cannot guarantee privacy because of the storage space requirement owing to the increase in the blockchain length, the amount of computation and network communication of the consensus algorithm, and data transparency. To this end, we present a multilevel blockchain structure consisting of the IoT-Chain, which is a lightweight blockchain that operates on IoT devices and is pluggable into Hyperledger Fabric or Ethereum, and the Monitoring-Chain, which is implemented based on Hyperledger Fabric.
The IoT-Chain, which is a blockchain that operates on IoT devices, and a monitoring chain to solve the performance limitations of devices that operate nodes of the IoT-Chain, are configured. In addition, by applying the lightweight consensus algorithm of IoT-Chain and the process of periodically distributing and storing IoT-Chain and storing only metadata after verification through consensus of all nodes, a reliable lightweight technique is applied to centralize existing IoT device data management. The limitations of the existing server structure can be solved through blockchain.

1.3.1. Capacity Requirement

We propose the IoT-Chain and Monitoring-Chain to lighten the blockchain. Blocks are created in the IoT-Chain through a consensus method in which all nodes using the Schnorr signature participate and verify the hash value of the last block to ensure the reliability between the two blockchains that can be operated on IoT devices. After distributing and storing the chain in a distributed file system, only the address value is embedded into the Monitoring-Chain, following which the blockchain of the IoT-Chain is initialized so that the blockchain capacity stored in the IoT-Chain does not exceed a specific size. The blockchain can be maintained even in IoT devices with limitations.

1.3.2. Consensus Requirement

We propose a block generation consensus algorithm that overcomes the limitations of the IoT device CPU operation and network communication volume. By using the verifiable random function (VRF) [15] and public key infrastructure (PKI) [16], we present a method to select a leader node for generating a block by determining verifiable random values.

1.3.3. Data Privacy

After distributing the IoT-Chain and embedding the returned address in the Monitoring-Chain, it was stored in the Monitoring-Chain network that is constructed based on Hyperledger Fabric [17], which is a permissioned blockchain, and it is only accessed by authorized users through smart contracts [18]. The data can be accessed to ensure the privacy of IoT data. The proposed blockchain structure was implemented and registered as an open source program [19]. It was verified that it can operate in IoT devices. Subsequent papers will consist of research relating to the proposed blockchain structure, and descriptions of the constructed blockchain module and system, architecture, analysis, experiments, and results.

2. Related Work

We compare existing lightweight blockchains in Table 1. The comparison is based on the node’s operating location, TPS, storage overhead, amount of computation, whether access control is supported, scalability, and whether off-chain storage is used. The amounts of computation were divided into PoW (high), PoS (mid), and PBFT (low) series based on the consensus algorithm. Sensor-chain [20] was proposed as a lightweight solution to use IoT devices appropriately for blockchain. Spatial blockchain [21], which divides the blockchain into spatial units, and the migration manager function [22], were used when migrating according to time. Each blockchain owns the blockchain according to the space, and as time passes, the contents of all blockchains are summarized in one block, following which the blockchain size is reduced by starting from that block. However, data loss may occur by summarizing the data that are collected from IoT devices as data such as averages, and only simple data such as sensor values can be used.
IOTA [23] is a cryptocurrency platform that is designed to apply blockchain to the IoT. It uses the proprietary tangle algorithm of the blockchain to reduce the blockchain size and to make it suitable. However, owing to the semicentralized form that cannot achieve complete decentralization of the IoT of the blockchain, the nodes that store a large amount of data may be attacked, and there are vulnerabilities in the hacking methods, such as centralized attacks. Furthermore, it is not suitable for IoT devices with low computing power using PoW as a consensus algorithm.
In BPIIoT [24] and Fusion-Chain [25], the InterPlanetary File System (IPFS) that utilizes a distributed hash table (DHT) for lightweight functions is used to store transactions, which are sensor data, in blocks, and to distribute and store blocks and accessible addresses. It uses a method to store only the values. However, in this study, the IPFS is not a method for distributing and storing the blocks to be stored. The blockchain is distributed and stored after the consensus of all nodes at a specific cycle, and then exported to another blockchain, and the blockchain is restarted.
EdgeChain [26], using edge computing, applies a credit-based resource management system to control all IoT devices from the edge server. Moreover, it stores all activations and transactions created by the IoT devices, and audits the data resources of the IoT devices through records. In the case of BlockEdge, blockchain is used to audit the different processes involved in industrial IoT applications.
HyperLoRa [27] detects tampering of IoT data using Hyperledger Fabric. Certain studies [28] have also used a smart grid network and permissioned blockchain.
BLA [29] uses blockchain in a fog-based IoV environment, and the Group Signature and Authentication Scheme for Blockchain-Based Mobile-Edge Computing [30] was used to authenticate new users in multi-access edge computing. This enables local authentication without the need for authentication from the cloud; thus, it is possible to reduce the latency required for verification in edge computing.
However, in all of the above methods, the blockchain does not work in IoT devices, and vulnerabilities exist, as illustrated in Figure 1. Regarding blockchains based on sharding, OmniLedger [31], RapidChain [32], and RepChain [33] are limited to cryptocurrency applications. RepChain also defines the reputation by using the trust and activeness of validators, based on their decisions on the list of transactions. RepChain uses the accumulated reputation values for balanced sharding and leader selection. However, when the leader node is selected through the accumulated values of the reputation, the randomness is reduced. In this study, a leader node was randomly selected using VRF.
HomeChain [34], which is a novel attribute-based access control scheme for IoT systems [35], and Fabric-IoT [36], have been used for the access control of IoT devices based on blockchain. In this study, the access control function for the user is implemented for security by using the smart contract of the blockchain, but forgery and falsification of the sensor data storage generated by the IoT device mean that stability is not guaranteed. Studies on consensus algorithms have been conducted, including PoBT [37], Algorand [38], and Tendermint [39].
PoBT consists of a structure that is suitable for IoT scalability and performance based on the consensus structure of Hyperledger Fabric, and Algorand is a VRF-based consensus algorithm. Tendermint is a PBFT-based consensus algorithm. In this study, although Hyperledger Fabric is used, a new blockchain that operates on IoT devices is proposed. A random-based consensus algorithm is suitable for IoT performance. Unlike PBFT, a consensus method and lightweight method that are suitable for network traffic and sensor generation speed are proposed. Moreover, as opposed to Algorand, this study presents a blockchain that is suitable for IoT devices by selecting a consensus leader node based on the size of a value without using VRF to form a committee.
Reference [40] proposed a consensus algorithm that improves the performance of the routing algorithm. A lightweight blockchain-based secure routing algorithm has been proposed to address the challenges [41] of swarm unmanned aircraft system (UAS) networking, and a proof of traffic consensus algorithm that reduces passive broadcasts is used.
Reference [42] proposed a consensus construction with high verification efficiency with base stations for cellular network connection. Unlike the above paper, in this paper, we propose an efficient group authentication method based on the consensus algorithm and Schnorr signature based on lightweight communication in IoT-Chain.
Reference [43] proposed a blockchain that requires minimal hardware and software performance. To this end, we propose a witness protocol, which can maintain a blockchain with minimal hardware, and does not require additional equipment or access to a centralized network. In contrast, the blockchain in this paper is a multi-level blockchain configuration so that blockchain nodes can participate in the maintenance of the blockchain and participate in the consensus algorithm and data verification process.

3. Background

3.1. Hyperledger Fabric

Hyperledger Fabric [17] is a private blockchain that provides network security and distributed ledger technology with scalability, confidentiality, and improved performance. Furthermore, as network roles are assigned for each node type in Hyperledger Fabric, network concurrency and parallelism are provided, which offers the advantage of high TPS compared to public blockchain platforms. In this study, the monitoring chain was implemented with Hyperledger Fabric, and the chaincode of Hyperledger Fabric was used to monitor the data generated by the IoT sensors and to implement the access control function to check the user’s authority when accessing the data.

3.2. InterPlanetary File System

The IPFS [44] distributes files such as photos, texts, and videos on the Internet and uses a unique hash value to load the distributed data rapidly. High-capacity files can be loaded quickly and efficiently, and by using a unique hash value, the existence of duplicate files can be known for efficient file storage. The nodes participating in the IPFS network manage the hash table independently and store data without a server. This provides a method of mapping filenames to values in the hash table that is held by each node without using a central server through the DHT. The DHT can suppress the load on the network, and enables the fast and accurate retrieval of files in the network. The IPFS is content addressed, where the file itself acts as an address. If the file name (CID) is found in the DHT through data, the node that has the distributed fragment of the file is found and the file is loaded. When distributing files, the IPFS converts all files on the network into the Merkle-DAG format. For each node, the CID, which is a hash of the node content, is used for Merkle-DAG. By using Merkle-DAG, the IPFS can address content, and prevent tampering and duplication. By using these functions, the IPFS distributes and stores the blockchain for every round of the IoT-Chain and returns a hash value to the monitoring chain. Data can be accessed on the IoT-Chain through the hash value that is stored in the Monitoring-Chain.

3.3. Schnorr Signature

The Schnorr signature [45] is similar to the method of extracting a public key from a single number (e.g., private key) in the elliptic curve digital signature algorithm (ECDSA) [46], but has the characteristic of linearity. The ECDSA involves many heavy operations, such as modular inverse and points multiplication, in the calculation process, whereas Schnorr has relatively few heavy operations in comparison. Schnorr signatures also enable collective signatures that combine the signatures of multiple signers into a single signature. As a result, N signatures can be verified once instead of N times, and the size of the signature is reduced. In this study, the Schnorr signature is used when signing following the verification of all nodes.

3.4. Verifiable Random Function

The VRF [15] is a function that outputs a verifiable pseudo-random value for the input. The VRF generates a unique and verifiable pseudorandom number Y for input X when the key pairs VK and SK are fixed. The VRF is similar to the digital signature method in that the output can be verified using a separate verification key. However, the digital signature differs from the VRF function in that multiple valid signatures exist for one input, and the output value is not sufficiently random to satisfy the pseudorandom number condition. In this study, it is used to select a leader node in the consensus process of the IoT-Chain that can be operated in IoT devices. All IoT-Chain nodes that create a transaction execute the VRF function, include the returned result value in the transaction, and send it to the leader node. The leader node selects the node with the largest VRF value as the next leader node and creates a block to propagate to all of the nodes.

4. Architecture

The proposed architecture is a multi-level blockchain structure consisting of an IoT-Chain network that can only be configured with IoT devices, and a monitoring chain to increase the size of the IoT-Chain and solve the limitations of controlling access to data. Through a multi-level blockchain structure, decentralized data management is possible only with IoT devices, and blocks are verified using consensus that does not require a computational load through a PBFT-based consensus algorithm in the IoT chain. In addition, when exporting blockchain from IoT-Chain to Monitoring-Chain, signatures of all IoT-Chain nodes are required during the consensus process, and network communication must be guaranteed not to be lost during consensus. Therefore, by using the Schnorr signature method, the capacity of the signature is reduced in the consensus process to reduce the message size during the consensus of the export process, and there are nodes that deliver only the external monitoring chain and metadata through the Exporter node. Forgery and falsification of the node’s data can be guaranteed through the Schnorr signature, which contains the compressed signatures of all nodes. The following describes the overall architecture of the structure proposed in this paper, the structure and operation of the IoT-Chain, and the Monitoring-Chain.

4.1. System Design

As depicted in Figure 2, N e t w o r k i c runs on IoT devices and maintains the IC that stores the sensor data. It consists of N o d e i c , N o d e l e a d e r , and N o d e e x p o r t . N o d e i c generates sensor data to generate T X . N o d e l e a d e r is randomly selected, collects T X generated by the node, generates B l o c k i c , and propagates them to all nodes. N o d e e x p o r t maintains a routing table for consensus, sets a path to receive the signatures of all nodes, detects a certain size, and verifies that B H l a s t of all N o d e i c is the same to start an agreement. Every N o d e i c encrypts B H l a s t via K e y p r i v to create S i g , which is combined with the signatures generated by other N o d e i c in the consensus path S i g s c h n o r r and adding K e y p u b to create K e y s c h n o r r , and can verify the signatures of all nodes with one verification. All B H l a s t are verified to be the same, and N o d e e x p o r t uploads I C to D F S and returns A d d r e s s i c to create B l o c k e x p o r t . N e t w o r k m c is implemented based on Hyperledger Fabric, receives B l o c k e x p o r t generated by B l o c k e x p o r t , and sends S i g s c h n o r r through S C to K e y s c h n o r r . If the decoded value is the same as B H l a s t , it is stored in M C , and the I C of all N o d e i c starts from B l o c k g e n e s i s again. In the IoT-Chain, there are nodes that generate transactions and exporter nodes that lighten the IoT-Chain by periodically communicating with a leader node and a monitoring chain that are randomly selected among nodes and generate blocks. In the case of a leader node, a block is created by receiving the broadcast transaction. An exporter node is a node registered in the monitoring chain as a gateway that ensures network communication rather than a general IoT device for communication with the monitoring chain. In addition, stable communication is ensured through the exporter node, preventing data loss during network communication, and it is possible to ensure that all nodes have verified data for the lightweight blockchain through a compressed signature during the consensus process. Table 2 lists the terms used in this study.

4.2. Multilevel Blockchain

This section explains why it is composed of a multilevel blockchain. As depicted in Figure 3, we compare the structure (A) consisting of only the IoT chain and the structure (B) consisting of only the monitoring chain. Additionally, in (C), the problem of solving the limitations of the two structures (A, B) in the multilevel blockchain is explained. (A) is a case in which the blockchain is configured with only the monitoring chain in the IoT device’s external network. (A-1) Each IoT device forwards a transaction to the blockchain. For delivery, there are two methods: sending a transaction to the API server and sending it to the blockchain, and sending it to the blockchain. (A-2) is the method of delivery to the server, and data tampering may occur during this process. (A-3) is the process of delivering a transaction directly from an IoT device to a blockchain, and TPS degradation may occur in this process. (B) is a case of maintaining the blockchain with only IoT devices. (B-1) All blockchains are recorded in IoT devices, and even if data are lighter, data size increases. Thus, if it goes above a certain size, IoT devices will not be able to sustain the blockchain due to insufficient storage capacity. In addition, the consensus process is essential for block creation in the blockchain. The consensus algorithm is divided into PoW consensus, which requires CPU operation, and PBFT, which proceeds only through network communication. However, as both consensus algorithms have to be operated on IoT devices as in (B-2), they require CPU computation or high network traffic. (C) is a multi-level blockchain structure to supplement the limitations of (A) and (B). In this structure, IoT devices maintain the IoT-Chain. The monitoring chain supports the IoT-Chain. (C-1) When the storage capacity becomes insufficient, the blockchain from the genesis block to the present is recorded externally (C-2) to the external distributed file system. After recording, the data are backed up in the monitoring chain, and in this process, the export process is performed for data verification. This process is not verified by a single node, but by (C-3) monitoring chain nodes. Therefore, the monitoring chain supports the IoT-Chain in performing data backup and decentralized verification. In addition, the IoT-Chain network is not a private network, but it is necessary to record node information in the monitoring chain for verification in the export process. Therefore, anyone can participate in the network, and the participating sensors are based on P2P communication, ultra-low power, and ultra-low performance hardware, so basic calculations are possible, unlike in a sensor network environment.

4.3. IoT-Chain

N e t w o r k i c creates a block through a lightweight consensus algorithm, and following consensus using S i g s c h n o r r for each round, the address is returned after storing the blockchain in an external distributed file system (DFS). After transferring only the value to N e t w o r k m c , I C is lightened by starting from the Genesis Block. As depicted in Figure 4, presents the block structure of IC. The data in the block are composed of Index, BlockHash, PreviousHash, timestamp, and N o d e l e a d e r . N o d e l e a d e r recorded in the block instructs the generation of the next block. T X is created as a node. T X is stored in the body and includes the sensor data, S i g , and V a l r a n d .
Figure 5 depicts the process in which N o d e i c generates T X and sends T X to N o d e l e a d e r , and N o d e l e a d e r generates B l o c k i c . The node that generates T X from N e t w o r k i c executes the V R F and includes the returned value, sensor data, and S i g generated through K e y p r i v in T X , which is sent to N o d e l e a d e r .
The N o d e i c executes VRF every set round and delay, the N o d e i c with the lowest value is selected as the N o d e l e a d e r , and a B l o c k i c is generated from the N o d e l e a d e r . In this way, the next N o d e l e a d e r is unpredictable, thus preventing the attack. Round means the cycle to create a B l o c k i c , and delay is the time to select a N o d e l e a d e r . The selected N o d e l e a d e r creates as many blocks as rounds, and then all nodes execute VRF during delay and broadcast the result to the N e t w o r k i c in the gossip protocol. After the delay time is over, the node with the lowest value among the nodes is selected as the N o d e l e a d e r .
In this paper, to lighten the IoT chain, the blockchain is stored in a distributed file system, and only metadata are stored in the monitoring chain. This process corresponds to the export process, and a monitoring chain and exporter node are required for operation. The monitoring chain enables decentralized verification of the Schnorr signature, the result of the export process, as nodes verify through smart contracts. In addition, the export agreement proceeds in the ring signature [47] method. Therefore, it is necessary to have a node that initiates and terminates consensus, collects it, and sends the result of the consensus to the monitoring chain. The export node is responsible for initiating the export consensus and transferring the generated Schnorr signature to the monitoring chain.

4.4. Monitoring-Chain

The monitoring chain serves to support the export process in the IoT-Chain. In the IoT-Chain, after the export process is performed, the “Schnorr signature” is created by combining the signatures of the nodes. If the Schnorr signature is verified with the stored public key, it is verified that all N o d e i c signed it. However, due to the centralization problem, it cannot be guaranteed that all N o d e i c signed after a single N o d e e x p o r t e r verifies the signature. N o d e m c is verified through smart contracts, enabling decentralized verification of the export process. Additionally, for decentralized verification through smart contracts, IoT-Chain nodes do not need to know each other, but the monitoring chain needs to know all IoT-Chain nodes. Therefore, in order to participate in the IoT-Chain, N o d e i c must register the IoT-Chain node in the monitoring chain to participate in the IoT-Chain. This course is essential for lowering storage weight. In addition, the monitoring chain can maintain data and record metadata about the distributed storage of the IoT-Chain. The value maintained in the monitoring chain is an IoT-Chain of a certain length, which is maintained even when all IoT-Chain networks are terminated, and the recorded hash value allows access to the IoT-Chain stored in the distributed file system.
N e t w o r k m c stores I C in D F S every round in N e t w o r k i c and returns A d d r e s s i c and S i g s c h n o r r . B H l a s t receives B l o c k e x p o r t and stores it in M C . Depicted in Figure 6 is the block structure of M C . The BlockHeader includes Index, BlockHash, PreviousHash, and timestamp. T X is stored in the body and B l o c k e x p o r t is stored in T X .
In N e t w o r k i c , N e t w o r k m c is exported to round, where the I C is larger than a certain size. Depicted in Figure 7 is the process of embedding the I C from N e t w o r k i c to N e t w o r k m c . N o d e e x p o r t acts as a gateway between N e t w o r k i c and N e t w o r k m c , and among the nodes of N e t w o r k i c , the node with the highest network condition and hardware performance is selected. Alternatively, the routing protocol method of the inferior gateway routing protocol (IGRP), which is a dynamic routing method, maintains the routing table of the consensus process that checks that B H l a s t of all N o d e i c is the same.

4.5. Workflow

This section describes the operation process of the proposed N e t w o r k i c and N e t w o r k m c . The processes of registering B H g e n e s i s to N e t w o r k m c , creating T X and B l o c k i c , embedding I C from N e t w o r k i c to N e t w o r k m c , verifying B l o k c e x p o r t in N e t w o r k m c , and starting over from B l o c k g e n e s i s in N e t w o r k i c are explained in order.
Algorithm 1 is the process of saving the information of N o d e i c to register I C in N e t w o r k m c . All N o d e i c sends B H g e n e s i s of the same IoT-Chain to M C and stores it through S C . The operation process consists of a process of generating a signature and requesting to register a node, and a process of registering node information by verifying the signature. In the case of signature generation, it runs on the nodes of the IoT chain, and in the case of verification, it operates on the nodes constituting the monitoring chain. To register N e t w o r k i c in N e t w o r k m c , it is necessary to verify that all B H g e n e s i s owned by the node are the same. N o d e i c encrypts B H g e n e s i s through K e y p r i v to create S i g , and creates T X containing S i g and B H g e n e s i s to send to N e t w o r k m c . N o d e m c requests K e y p u b from C A for S i g included in T X , and all S i g included in T X are sent from N e t w o r k i c . If the decrypted value of B H g e n e s i s is the same, the corresponding B H g e n e s i s is stored in the M C . Multiple N e t w o r k i c can be distinguished through the saved B H g e n e s i s , and K e y p u b of N o d e i c can be requested from the C A .
Algorithm 1  N e t w o r k i c enrollment.
  1:
procedurePROCEDURE N o d e i c :
  2:
    for  N o d e i o t in N e t w o r k i c  do
  3:
         S i g C r e a t e S i g ( B H g e n e s i s , K e y P r i v )
  4:
         T X C r e a t e T x ( G e n e s i s B H , S i g )
  5:
         S e n d T X t o M C ( T X )
  6:
    end for
  7:
end procedure
  8:
   
  9:
procedurePROCEDURE N o d e m c :
10:
    for  N o d e m c in N e t w o r k m c  do
11:
         S i g , B H l a s t G e t T X ( )
12:
         K e y p u b C A
13:
        if  V e r i f y S i g ( S i g , B H l a s t , K e y p u b ) is true then
14:
            S e t S t a t e ( B H l a s t )
15:
        end if
16:
    end for
17:
end procedure
Algorithm 2 is the process of creating blocks and transactions in the IoT-Chain. The operation process consists of the process of creating a transaction, including the data collected from the IoT device through the sensor, and the process of creating a block by including the transaction in the block after verification. In the case of transaction creation, it operates on the nodes of the IoT chain. In the case of block generation after transaction verification, it is operated by a leader node randomly selected from among the nodes of the IoT chain every block generation round. N o d e i c generates sensor data and encrypts the sensor data using K e y p r i v for T X generation. The V R F is executed to return V a l r a n d and to transmit T X , including sensor data, S i g , and V a l r a n d , to N o d e l e a d e r recorded in the last block. N o d e l e a d e r verifies the values stored in T X with K e y p u b and has the largest value of V a l r a n d . After selecting N o d e i c as the next N o d e l e a d e r , it is recorded in B l o c k i c , distributed to N e t w o r k i c , and added to the I C . Unlike O ( n 2 ) , which is the communication amount of the PBFT-based algorithm that achieves consensus through network communication, a leader node is selected through a random function, and the block is verified with the communication amount of O ( n ) . Through the consensus algorithm with a reduced number of messages compared to the PBFT-based consensus algorithm, consensus is possible even in IoT devices with low computational power without using the PoW-based consensus algorithm that requires more computational power.
Algorithm 2  N e t w o r k i c B l o c k i c / T X creation.
  1:
procedurePROCEDURE N o d e i c :
  2:
     D a t a G e n e r a t e S e n s o r D a t a ( )
  3:
     S i g C r e a t e S i g ( D a t a , K e y P r i v )
  4:
     V a l r a n d V R F ( )
  5:
     T X C r e a t e T X ( D a t a , S i g , V a l r a n d )
  6:
     B l o c k l a s t G e t L a t e s t B l o c k ( )
  7:
     N o d e l e a d e r B l o c k L a s t . L e a d e r N o d e
  8:
     S e n d T X ( T X , N o d e l e a d e r )
  9:
end procedure
10:
  
11:
procedurePROCEDURE N o d e l e a d e r :
12:
     T X R e c e v i c e T X ( )
13:
    if  T X s . L e n g t h is count then
14:
         T X s T X
15:
        Count( T X s ) is not count
16:
         N o d e l e a d e r G e t M a x R a n d o m V a l u e N o d e ( T X s )
17:
         B l o c k i c C r e a t e B l o c k ( T x s , N o d e l e a d e r )
18:
         B r o a d c a s t ( B l o c k i c )
19:
    end if
20:
end procedure
Algorithm 3 is a lightweight storage process for I C . Nodes in N e t w o r k i c proceed with “export consensus” to store I C in D F S . After the export consensus process, B l o c k e x p o r t s with the Schnorr signature is delivered to N e t w o r k m c through the export node. This process is used to periodically store the IoT chain in a distributed file system and record only metadata for verification in the monitoring chain in order to reduce the capacity of the IoT chain. For verification, it is necessary to start the process of verifying data through the hash value of the last block of the IoT chain. In addition, the final block hash value, which is the verified result, and the signatures of IoT-Chain nodes, must be compressed to generate a Schnorr signature. For operation, the export process of the IoT chain is executed in the Exporter Node. The process of verifying and signing the last block hash value is executed in the nodes of the IoT-Chain. B l o c k i c is created in N e t w o r k i c , the size of the I C increases, and the round exceeds a certain size. Each N o d e i c initiates a consensus verifying that B H l a s t are all the same for embedding into N e t w o r k m c . Among the nodes, N o d e e x p o e r t , which is a pre-selected gateway node based on the network and hardware status, is the route of consensus of all nodes through the routing protocol. N o d e e x p o e r t creates a S i g encrypted with B H l a s t with K e y p r i v , creates B l o c k e x p o r t containing B H l a s t and S i g , and delivers it to the next node on the route. After receiving it, N o d e i c sends S i g s c h n o r r to K e y p u b , which is verified through the C A . If the B H l a s t returned by creating and decrypting K e y s c h n o r r is the same as the B H l a s t of its own I C , the corresponding B H l a s t is encrypted with K e y p r i v to create a S i g , the S i g is combined with a Schnorr signature method, and the S i g is added by S i g s c h n o r r to generate the combined S i g . It is created, passed to the next N o d e i c in the route, and this is repeated until the next N o d e i c does not exist. Every node in the N e t w o r k i c repeats this process, the last N o d e i c sends a B l o c k e x p o r t to N o d e e x p o r t , and S i g s c h n o r r sends a B l o c k e x p o r t to all nodes in C A . If the same B H l a s t value is returned after decrypting with K e y s c h n o r r created by combining K e y p u b , the I C is distributed and stored in the D F S , and subsequently, A d d r e s s i c is returned. N o d e e x p o r t transmits B l o c k e x p o r t to N e t w o r k m c . When using the existing multi-signature method, a signature size of about O ( n ) and a number of verifications are required, depending on the number of network nodes. The proposed algorithm compresses the signature using the Schnorr signature method. As a result, the number of validations required for group signatures and the storage capacity of the signatures are reduced by O ( 1 ) . To create metadata of the IoT-Chain, signatures of all IoT-Chain nodes are required. However, in order to receive the signatures of all nodes, the number of signatures increases as much as the number of nodes, the size of the message also increases, and O ( n ) signature verification processes exist. In the structure of this paper, verification and verification data transmission are possible in a single signature by compressing the signature using the Schnorr signature.
Algorithm 3  B l o c k e x p o r t creation.
  1:
procedurePROCEDURE N o d e e x p o r t :
  2:
    if  S i z e O f ( I C ) is M a x i m u m  then
  3:
         S i g C r e a t e S i g ( B H l a s t )
  4:
         r a w R o u t e r o u t i n g T a b l e
  5:
         R o u t e C r e a t e S i g ( r a w R o u t e )
  6:
         B l o c k e x p o r t C r e a t e B l o c k e x p o r t ( B H L a s t , S i g , R o u t e )
  7:
         S t a r t E m b e d d i n g ( B l o c k E x p o r t , C e r t , R o u t e )
  8:
    end if
  9:
end procedure
10:
  
11:
procedurePROCEDURE N o d e i c :
12:
    for  N o d e i c in N e t w o r k i c  do
13:
         B l o c k e x p o r t r e c e i v e ( )
14:
         K e y s p u b C A
15:
         K e y s c h n o r r A g g r e g a t e P u b ( K e y s c h n o r r , K e y s p u b )
16:
        if  V e r i f i c a t i o n ( B l o c k e x p o r t . S i g s c h n o r r , K e y s c h n o r r ) is t r u e  then
17:
            S i g C r e a t e S i g ( B H l a s t , K e y p r i v )
18:
            S i g s c h n o r r B l o c k e x p o r t . S i g s c h n o r r
19:
            S i g s c h n o r r C r e a t e S c h n o r r S i g ( S i g s c h n o r r , S i g )
20:
            B l o c k e x p o r t . S i g s c h n o r r S i g s c h n o r r
21:
        end if
22:
        if  e x i s t ( c o n s e n s u s R o u t e . N e x t ) is t r u e  then
23:
            B r o a d c a s t ( B l o c k E x p o r t , K e y s c h n o r r , R o u t e )
24:
            e x i s t ( c o n s e n s u s R o u t e . N e x t ) is f a l s e
25:
            B r o a d c a s t ( B l o c k E x p o r t , K e y s c h n o r r , N o d e e x p o r t )
26:
        end if
27:
    end for
28:
end procedure
Algorithm 4 is the process of transferring and saving B l o c k e x p o r t from N e t w o r k i c to N e t w o r k m c . In this process, after verifying the block hash value made by the nodes of the IoT chain, it is guaranteed that all nodes maintain the same blockchain. After this verification process is performed, the process of transmitting the compressed signature and hash value to the monitoring chain is performed. In addition, the process of verifying the result value delivered to the monitoring chain and storing it in the monitoring chain is performed. The resulting value of the export process is executed by the exporter node and transmitted to the monitoring chain, and the verification process is performed in the monitoring chain node. In N e t w o r k m c , S i g s c h n o r r , which is stored in B l o c k e x p o r t and delivered by N o d e e x p o r t , is requested by the C A . The returned K e y p u b is combined and verified, and B l o c k e x p o r t is stored in the M C . In N e t w o r k i c , the I C is restarted by storing the address in the M C and embedding the I C and then performing the hash operation with the stored B H l a s t and creating the connected block.
Algorithm 4   B l o c k e x p o r t verification.
  1:
procedurePROCEDURE N o d e e x p o r t :
  2:
     B l o c k e x p o r t r e c e i v e ( )
  3:
     S i g s c h n o r r B l o c k e x p o r t . S i g s c h n o r r
  4:
     K e y s p u b C A
  5:
     K e y s c h n o r r C r e a t e S c h n o r r P u b ( K e y s p u b )
  6:
    if  V e r i f i c a t i o n ( S i g s c h n o r r , K e y s c h n o r r ) is t r u e  then
  7:
         A d d r e s s i c D F S ( I C )
  8:
         B l o c k e x p o r t . A d d r e s s A d d r e s s i c
  9:
         S e n d B l o c k T o M C ( B l o c k e x p o r t )
10:
    end if
11:
end procedure
12:
  
13:
procedurePROCEDURE N o d e m c :
14:
    for  N o d e m c in N e t w o r k m c  do
15:
         B l o c k e x p o r t R e c e i v c e ( )
16:
         K e y s p u b C A
17:
         K e y s c h n o r r C r e a t e S c h n o r r P u b ( K e y s p u b )
18:
        if  V e r i f i c a t i o n ( S i g s c h n o r r , K e y s c h n o r r ) is t r u e  then
19:
            P u t S t a t e ( B l o c k e x p o r t )
20:
        end if
21:
    end for
22:
end procedure
23:
  
24:
procedurePROCEDURE N o d e i c :
25:
     R e s e t I o T C h a i n ( B l o c k E x p o r t . B H l a s t )
26:
end procedure

5. Security Analysis

In this section, on the lightweight blockchain using the proposed multilevel structure of N e t w o r k i c and N e t w o r k m c , we analyze the existing security solution application’s limitations owing to the low performance, which is the weakness of existing IoT devices, security vulnerabilities of fog nodes and edge nodes, and whether vulnerabilities caused by data forgery owing to the centralized server structure, single-point errors of the central server, and DDoS attacks can be resolved. The STRIDE threat model technique was applied for the existing IoT blockchain threat analysis.

5.1. STRIDE Threat Modeling

According to the Microsoft Threat Modeling Tool threats in Table 3, there are six threats in the STRIDE model: identity spoofing, data tampering, denial, information disclosure, denial of service, and elevation of privilege. We applied the STRIDE model to analyze the threats of existing blockchain-based IoT data management methods and compared them with the proposed structure. Figure 8 shows the data flow of the proposed structure and the existing blockchain-based IoT device data management method. The existing blockchain-based IoT data management method consists of the IoT Device Zone, IoT Filed Gateway Zone, and Cloud/Edge Computing Zone, and the threats of each component were analyzed and compared with those identified in this paper. Table 4 is the analysis of results, and its contents are as follows.

5.2. IoT Device Zone Threats

As for the existing IoT device zone threats, there is a method that attempts to log in with spoofed authentication and a threat that exploits it through authentication information. In the structure of this paper, a private key exists for each device and is managed through CA, and all device requests can be used if they are authenticated through a signature. In addition, it is assumed that the private key is not leaked to anyone other than the device and the user.

5.3. IoT Flied Gateway Zone Threats

IoT devices are not suitable for application to existing security solutions owing to their low performances. However, the storage requirements of the blockchain and excessive computational amounts of the consensus algorithm will result in traffic problems in the network. Therefore, in the existing blockchain-based IoT data management method, it acts as a client that stores data by sending a transaction through the gateway to a blockchain node operating in an external cloud with a gateway. However, this can lead to information disclosure and data tampering through spoofing attacks on the gateway. In this study, we minimized the use of gateways by using a lightweight blockchain that can operate on IoT devices rather than external blockchain nodes. In addition, during the export process for storage lightening, gateways are randomly selected to prevent attacks.

5.4. Cloud and Edge Computing Zone Threats

Existing blockchain-based IoT data management stores data in the cloud and central server. Additionally, the central server is managed by an authorized administrator. Data reliability and integrity cannot be guaranteed due to the possibility of data tampering by privileged administrators and DDoS and SPOF attacks. Through the proposed lightweight blockchain, all IoT devices participate as nodes rather than clients of N e t w o r k i c to generate B l o c k i c through a consensus algorithm and maintain the I C to ensure data reliability, and the same ledger is held by all N o d e i c , thereby eliminating the possibility of forgery. Moreover, by uploading the I C for each specific round to the D F S , A d d r e s s i c is returned and embedded into N e t w o r k m c , implemented based on the private blockchain HF, and distributed and stored because of the decentralized structure, whereby all N o d e i c agree for consensus. Thus, decentralization can be guaranteed, and there is no possibility of service failure owing to DDoS attacks and single-point errors.

6. Experiment

Table 5 is the experimental environments. An experiment was conducted using three Raspberry Pi 4 B computers (system on chip: Broad-com BCM2711, quadcore Cortex-A72 (ARM v8) 64-bit SoC @ 1.5 GHz, memory: 4 GB LPDDR4-3200 SDRAM, OS: Raspbian GNU Linux 10). As depicted in Figure 9, an IoT device network was configured to verify whether the N e t w o r k i c configuration can be built in an IoT network. Furthermore, by considering the increase in the blockchain size and latency according to the data generated by the actual IoT device, the average file size according to the file format, and the average data size generated by the IoT device for TPS measurement, the experimental data were converted into 8, 128, 1K, and 10K. Decentralization was guaranteed, and there was no possibility of service failure owing to DDoS attacks and single-point errors.

6.1. IoT-Chain Size

In N e t w o r k i o t , after consensus is reached for each round in which the I C becomes a specific size, the I C is distributed and stored in the D F S to convert A d d r e s s i c into N e t w o r k m c . The blockchain size is lightened through the process of sending it, embedding it, and starting the I C again. Depicted in Figure 10 are the size of the I C to which the proposed export was applied and the I C to which the proposed export was not applied. The standard of the round was when the size of the I C became 5 kB. The experiment demonstrated that the size of I C to which the export process was applied did not exceed 5000 kB, but it was confirmed that the size of the blockchain continued to increase when it was not applied.

6.2. Consensus Algorithm

In N e t w o r k i c , the delay time is reduced by randomly selecting N o d e l e a d e r for consensus when creating B l o c k i c . As a result, only the delay time corresponding to 0.004 s is displayed. For a performance comparison, the PBFT consensus algorithm implemented in the Fusion-Chain of the IoT-Chain node was applied, and the PoW consensus algorithm with N o n c e = 2 was applied to compare the delay time. As a result of generating B l o c k i c from N e t w o r k i c by applying the proposed consensus algorithm, there was an average delay of 0.0044 s, as depicted in Figure 11. However, when blocks were generated through the PBFT consensus algorithm, the average delay time was 0.1266 s. The average delay time of 5.528 s was measured when using PoW. Through the proposed consensus algorithm, the block generation time was reduced by 96% compared to PBFT and 99% compared to PoW. Moreover, when a leader node is selected, a DDoS attack can occur because all nodes can know the leader node when using the method of sending a transaction to the leader node recorded in the last block, but the problem could be solved with a delay of only 0.0044 s. The experimental results confirmed that the latency was reduced compared to the representative consensus algorithm with high CPU computation and network communication.
As depicted in Figure 12, which is the experimental result of comparing the average CPU usage of the leader node and the consensus participating node during consensus for block generation, it was confirmed that the proposed consensus algorithm had the lowest average CPU usage.
The experiments were conducted by changing the consensus algorithm of IoT-Chain to PoW, PBFT, and the proposed consensus algorithm. In the case of CPU usage, average CPU usage was sampled for 1 s, and the average CPU usage values of the leader node (PBFT, proposed consensus algorithm) and mining node (PoW) were measured from block creation to consensus. The number of nodes of all IoT-Chains was the same, five, and the difficulty nonce value of PoW was set to two.

6.3. Block Propagation Delay

The time for the block to propagate from N o d e l e a d e r to N o d e i c was measured according to the data size to check whether the data size affected the propagation to nodes after the block was created in N e t w o r k i c . To measure the block propagation delay time according to various data sizes in N e t w o r k i c , the data were divided into sizes of 8, 128, 1K, and 10K bytes; and blocks were created in the leader node for five IoT devices, N o d e i c .
For the experiment, after the block was created, the block propagation delay time from N o d e l e a d e r to all N o d e i c was measured, and the maximum, minimum, and average Boxplot graphs are displayed.
By operating and configuring N e t w o r K i c , we measured the propagation time after agreeing to B l o c k i c , as depicted in Figure 13. It was confirmed that the propagation time of B l o c k i c increased depending on the data size, but the increase was not large, and the maximum average delay time was only 36 ms.

6.4. Schnorr Signature

To export the I C from N e t w o r k i c to N e t w o r k m c , S i g was created using the Schnorr signature method to verify that the I C of N o d e i c was the same as B H l a s t . To measure the delay time of the method, the delay time of generating S i g s c h n o r r by combining the signatures generated by encrypting 128 bytes of data with K e y p r i v according to the number of nodes was measured, as depicted in Figure 14. The experimental results revealed that the IoT device generated S i g s c h n o r r while increasing the number of N o d e i c , but the delay time for generating S i g s c h n o r r from each N o d e i c was constant. It was confirmed that when generating the Schnorr signatures, there was no significant difference in delay time, even if the number of signatures to be combined increased.

6.5. Export Latency

Figure 15 depicts the results of measuring the delay time when exporting the I C from N e t w o r k i c to N e t w o r k m c . The delay time consisted of three parts: generating the Schnorr signature, uploading the I C to the D F S , and transferring N e t w o r k i c to N e t w o r k m c B l o c k e x p o r t . The transmission latency consisted of N e t w o r k i c using the D F S to embed the I C with N e t w o r k m c . N o d e e x p o r t uploaded the I C held in the configured D F S by all N o d e i c that were verified, and it was confirmed that the delay time was only 50 ms. For embedding from N e t w o r k i c to N e t w o r k m c , all N o d e i c have the same I C and go through the process of agreeing to export. During this process, all nodes in N o d e i c must receive and verify S i g . However, since signatures of each node are all generated, there is an O(N) overhead due to signatures in N o d e i c .
In this paper, the signatures of nodes participating in consensus can be combined into one signature through the Schnorr signature. In this way, each node reduces the storage capacity through S i g s c h n o r r compressed with signatures in O(1), and verification is possible at the same time.
As a result of measuring the delay time of the Schnorr signature, it was confirmed that the total delay time of signature verification of N o d e i c increases linearly in the consensus process because each node verifies the signature O(1) times. Additionally, to insert I C from N e t w o r k i c to N e t w o r k m c , I C was uploaded to D F S , and the returned address and the combined signature of all nodes were sent to M C , so the final result, the size of the signature stored, is the size of one signature.Fabric SDK can be executed asynchronously with a delay that includes all processes from propagating a transaction to M C (Hyperledger Fabric), consensus and saving it, so it was confirmed that the delay in the export process takes about 2 s.

6.6. IoT-Chain Transactions per Second

As depicted in Figure 16, an experiment was conducted to confirm the change in the T P S according to the number of N o d e i c in N e t w o r k i c and the data size. The size of the experimental data was 8, 128, 1K, or 10K bytes. T X was created, and for the T P S calculation, (1) S i z e B l o c k c h a i n / S i z e T x = S i z e T x P e r B l o c k and (2) S i z e T x P e r B l o c k / T i m e B l o c k C r e a t i o n = T P S .
(1) and (2) were used to calculate the T P S . When the data size was 8 bytes, the T P S decreased to 1701, 1634, and 1542 as the number of N o d e i c increased. In the case of 128 bytes, it decreased to 1586, 1583, and 1487. In the case of 1K, it decreased in the order of 1517, 1453, and 1401. At 10K, the T P S decreased to 1220, 1178, and 1024. In all tested cases, the T P S was kept above 1000.

7. Conclusions

We have proposed a lightweight blockchain and multilevel blockchain structure for IoT security. The challenges of existing blockchains, such as increasing the blockchain capacity, the consensus algorithm’s calculation amount, the network communication volume, and privacy not being guaranteed, can be overcome through this blockchain structure. To solve the problem of increasing the blockchain capacity, the I C that can be operated in the IoT is stored in the D F S for each specific round, and the returned A d d r e s s i c is delivered to N e t w o r k m c and stored to save the I C . To solve the problem of excessive computation and network traffic of the existing consensus algorithm, the V R F -based leader node election method, which is a random function, is used, and the average delay time was only 0.004 s. A stable and tamper-resistant embedding method was applied by constructing a multi-chain architecture and establishing a reliable metadata delivery consensus method and export node between chains (IoT-Chain–Monitoring-Chain). We have proposed a consensus algorithm that is suitable for IoT devices that produce data and generate transactions. It was confirmed that the block propagation time was not affected by the data size. Moreover, in the case of the I C export, when generating Schnorr signatures during the consensus process, the delay time was not affected by the number of nodes. As a result of the total time measurement analysis of the export, only the delay time of the Schnorr signature increased linearly according to the number of nodes. Furthermore, it was confirmed that the upload time to the D F S and the transfer time from N e t w o r k i c to N e t w o r k m c were constant. After distributing the I C to solve the privacy problem, A d d r e s s i c was stored in the M C that was implemented based on the private blockchain HF so that only users who have been granted access to data can access the data. The results of the TPS measurement demonstrated that one of the performance indicators of the blockchain system, N e t w o r k i c , is suited to devices similar to actual IoT devices. As a result of constructing and measuring the T P S , it was proven to maintain more than 1000 tps. In a future study, the Schnorr signature and data transmission delay time from N e t w o r K i c to N e t w o r k m c will be reduced to decrease the export time, and a study will be conducted on configuring the optimal route of the routing table of N o d e e x p o r t .

Author Contributions

Conceptualization, D.N.; methodology, D.N.; programming, D.N.; writing—original draft preparation, D.N.; supervision and review, S.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Bisa Research Grant of Keimyung University in 2021.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Knuth, D. Internet of Things (IoT) Market - Growth, Trends, COVID-19 Impact, and Forecasts (2021–2026) [Online]. Available online: https://www.mordorintelligence.com/industry-reports/internet-of-things-moving-towards-a-smarter-tomorrow-market-industry (accessed on 25 May 2021).
  2. Howarth, J. 6 Important IoT Trends For 2022–2024 [Online]. Available online: https://explodingtopics.com/blog/iot-trends (accessed on 24 October 2022).
  3. McMillen, D. Internet of Threats: IoT Botnets Drive Surge in Network Attacks [Online]. Available online: https://securityintelligence.com/posts/internet-of-threats-iot-botnets-network-attacks/ (accessed on 25 June 2021).
  4. CDnetworks. What Is a DDOS Attack? [Online]. Available online: https://www.cdnetworks.com/ko/cloud-security-blog/what-is-ddos-attack/ (accessed on 10 December 2021).
  5. GREEN, A. The Mirai Botnet Attack and Revenge of the Internet of Things [Online]. Available online: http://varonis.com/blog/the-mirai-botnet-attack-and-revenge-of-the-internet-of-things/ (accessed on 6 August 2021).
  6. Antonakakis, M.; April, T.; Bailey, M.; Bernhard, M.; Bursztein, E.; Cochran, J.; Durumeric, Z.; Halderman, J.A.; Invernizzi, L.; Kallitsis, M.; et al. Understanding the mirai botnet. In Proceedings of the 26th {USENIX} Security Symposium ({USENIX} Security 17), Vancouver, BC, Canada, 16–18 August 2017; pp. 1093–1110. [Google Scholar]
  7. Mukherjee, M.; Matam, R.; Shu, L.; Maglaras, L.; Ferrag, M.A.; Choudhury, N.; Kumar, V. Security and privacy in fog computing: Challenges. IEEE Access 2017, 5, 19293–19304. [Google Scholar] [CrossRef]
  8. Alwarafy, A.; Al-Thelaya, K.A.; Abdallah, M.; Schneider, J.; Hamdi, M. A Survey on Security and Privacy Issues in Edge-Computing-Assisted Internet of Things. IEEE Internet Things J. 2020, 8, 4004–4022. [Google Scholar] [CrossRef]
  9. CheckPoint. Main Cloud Security Issues and Threats in 2021 [Online]. Available online: https://www.checkpoint.com/cyber-hub/cloud-security/what-is-cloud-security/top-cloud-security-issues-threats-and-concerns/ (accessed on 1 December 2021).
  10. Kumar, V. Single Point of Failure|A Simple Overview [Online]. Available online: https://www.rankred.com/single-point-of-failure/ (accessed on 7 October 2021).
  11. David Rodeck, J.S. What Is Blockchain? [Online]. Available online: https://www.forbes.com/advisor/investing/what-is-blockchain/ (accessed on 30 April 2022).
  12. Frankenfield, J. Proof of Work (PoW) [Online]. Available online: https://www.investopedia.com/terms/p/proof-work.asp (accessed on 20 May 2022).
  13. Castro, M.; Liskov, B. Practical byzantine fault tolerance. Proc. OSDI 1999, 99, 173–186. [Google Scholar]
  14. Ray, P.P. A survey on Internet of Things architectures. J. King Saud Univ.-Comput. Inf. Sci. 2018, 30, 291–319. [Google Scholar]
  15. Micali, S.; Rabin, M.; Vadhan, S. Verifiable random functions. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (cat. No. 99CB37039), New York, NY, USA, 17–19 October 1999; pp. 120–130. [Google Scholar]
  16. Maurer, U. Modelling a public-key infrastructure. In European Symposium on Research in Computer Security; Springer: Berlin/Heidelberg, Germany, 1996; pp. 325–350. [Google Scholar]
  17. Androulaki, E.; Barger, A.; Bortnikov, V.; Cachin, C.; Christidis, K.; De Caro, A.; Enyeart, D.; Ferris, C.; Laventman, G.; Manevich, Y.; et al. Hyperledger fabric: A distributed operating system for permissioned blockchains. In Proceedings of the Thirteenth EuroSys Conference, Porto, Portugal, 23–26 April 2018; pp. 1–15. [Google Scholar]
  18. Buterin, V. A next-generation smart contract and decentralized application platform. White Pap. 2014, 3, 1–36. [Google Scholar]
  19. IoT-Chain Source Code [Online]. Available online: https://github.com/nadongjun/sensor-chain (accessed on 30 May 2021).
  20. Shahid, A.R.; Pissinou, N.; Staier, C.; Kwan, R. Sensor-chain: A lightweight scalable blockchain framework for internet of things. In Proceedings of the 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), Atlanta, GA, USA, 14–17 July 2019; pp. 1154–1161. [Google Scholar]
  21. Alsalih, W.; Islam, K.; Rodríguez, Y.N.; Xiao, H. Distributed voronoi diagram computation in wireless sensor networks. In Proceedings of the SPAA, Munich, Germany, 14–16 June 2008; p. 364. [Google Scholar]
  22. Dennis, R.; Owenson, G.; Aziz, B. A temporal blockchain: A formal analysis. In Proceedings of the 2016 International Conference on Collaboration Technologies and Systems (CTS), Orlando, FL, USA, 31 October–4 November 2016; pp. 430–437. [Google Scholar]
  23. Silvano, W.F.; Marcelino, R. Iota Tangle: A cryptocurrency to communicate Internet-of-Things data. Future Gener. Comput. Syst. 2020, 112, 307–319. [Google Scholar] [CrossRef]
  24. Bai, L.; Hu, M.; Liu, M.; Wang, J. BPIIoT: A light-weighted blockchain-based platform for industrial IoT. IEEE Access 2019, 7, 58381–58393. [Google Scholar] [CrossRef]
  25. Na, D.; Park, S. Fusion Chain: A Decentralized Lightweight Blockchain for IoT Security and Privacy. Electronics 2021, 10, 391. [Google Scholar] [CrossRef]
  26. Pan, J.; Wang, J.; Hester, A.; Alqerm, I.; Liu, Y.; Zhao, Y. EdgeChain: An edge-IoT framework and prototype based on blockchain and smart contracts. IEEE Internet Things J. 2018, 6, 4719–4732. [Google Scholar] [CrossRef] [Green Version]
  27. Hou, L.; Zheng, K.; Liu, Z.; Xu, X.; Wu, T. Design and prototype implementation of a blockchain-enabled LoRa system with edge computing. IEEE Internet Things J. 2020, 8, 2419–2430. [Google Scholar] [CrossRef]
  28. Gai, K.; Wu, Y.; Zhu, L.; Xu, L.; Zhang, Y. Permissioned blockchain and edge computing empowered privacy-preserving smart grid networks. IEEE Internet Things J. 2019, 6, 7992–8004. [Google Scholar] [CrossRef]
  29. Yao, Y.; Chang, X.; Mišić, J.; Mišić, V.B.; Li, L. BLA: Blockchain-assisted lightweight anonymous authentication for distributed vehicular fog services. IEEE Internet Things J. 2019, 6, 3775–3784. [Google Scholar] [CrossRef]
  30. Zhang, S.; Lee, J.H. A group signature and authentication scheme for blockchain-based mobile-edge computing. IEEE Internet Things J. 2019, 7, 4557–4565. [Google Scholar] [CrossRef]
  31. Kokoris-Kogias, E.; Jovanovic, P.; Gasser, L.; Gailly, N.; Syta, E.; Ford, B. Omniledger: A secure, scale-out, decentralized ledger via sharding. In Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 20–24 May 2018; pp. 583–598. [Google Scholar]
  32. Zamani, M.; Movahedi, M.; Raykova, M. Rapidchain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada, 15–19 October 2018; pp. 931–948. [Google Scholar]
  33. Huang, C.; Wang, Z.; Chen, H.; Hu, Q.; Zhang, Q.; Wang, W.; Guan, X. RepChain: A Reputation-Based Secure, Fast, and High Incentive Blockchain System via Sharding. IEEE Internet Things J. 2020, 8, 4291–4304. [Google Scholar] [CrossRef]
  34. Lin, C.; He, D.; Kumar, N.; Huang, X.; Vijayakumar, P.; Choo, K.K.R. Homechain: A blockchain-based secure mutual authentication system for smart homes. IEEE Internet Things J. 2019, 7, 818–829. [Google Scholar] [CrossRef]
  35. Ding, S.; Cao, J.; Li, C.; Fan, K.; Li, H. A novel attribute-based access control scheme using blockchain for IoT. IEEE Access 2019, 7, 38431–38441. [Google Scholar] [CrossRef]
  36. Liu, H.; Han, D.; Li, D. Fabric-IoT: A blockchain-based access control system in IoT. IEEE Access 2020, 8, 18207–18218. [Google Scholar] [CrossRef]
  37. Biswas, S.; Sharif, K.; Li, F.; Maharjan, S.; Mohanty, S.P.; Wang, Y. PoBT: A lightweight consensus algorithm for scalable IoT business blockchain. IEEE Internet Things J. 2019, 7, 2343–2355. [Google Scholar] [CrossRef]
  38. Gilad, Y.; Hemo, R.; Micali, S.; Vlachos, G.; Zeldovich, N. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China, 28 October 2017; pp. 51–68. [Google Scholar]
  39. Buchman, E. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. PhD Thesis, University of Guelph, Guelph, ON, Canada, 2016. [Google Scholar]
  40. Wang, J.; Liu, Y.; Niu, S.; Song, H. Lightweight blockchain assisted secure routing of swarm UAS networking. Comput. Commun. 2021, 165, 131–140. [Google Scholar] [CrossRef]
  41. Wang, J.; Liu, Y.; Song, H. Counter-Unmanned Aircraft System (s)(C-UAS): State of the Art, Challenges, and Future Trends. IEEE Aerosp. Electron. Syst. Mag. 2021, 36, 4–29. [Google Scholar] [CrossRef]
  42. Wang, J.; Liu, Y.; Niu, S.; Song, H.; Jing, W.; Yuan, J. Blockchain enabled verification for cellular-connected unmanned aircraft system networking. Future Gener. Comput. Syst. 2021, 123, 233–244. [Google Scholar] [CrossRef]
  43. Anagnostakis, A.G.; Giannakeas, N.; Tsipouras, M.G.; Glavas, E.; Tzallas, A.T. IOT Micro-blockchain Fundamentals. Sensors 2021, 21, 2784. [Google Scholar] [CrossRef]
  44. Benet, J. Ipfs-content addressed, versioned, p2p file system. arXiv 2014, arXiv:1407.3561. [Google Scholar]
  45. Maxwell, G.; Poelstra, A.; Seurin, Y.; Wuille, P. Simple schnorr multi-signatures with applications to bitcoin. Des. Codes Cryptogr. 2019, 87, 2139–2164. [Google Scholar] [CrossRef]
  46. Johnson, D.; Menezes, A.; Vanstone, S. The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 2001, 1, 36–63. [Google Scholar] [CrossRef]
  47. Bresson, E.; Stern, J.; Szydlo, M. Threshold ring signatures and applications to ad hoc groups. In Annual International Cryptology Conference; Springer: Berlin/Heidelberg, Germany, 2002; pp. 465–480. [Google Scholar] [CrossRef]
  48. Microsoft Threat Modeling Tool threats [Online]. Available online: https://docs.microsoft.com/en-us/azure/security/develop/threat-modeling-tool-threats (accessed on 3 September 2022).
Figure 1. Comparison of IoT data management methods according to architecture (red indicates vulnerability).
Figure 1. Comparison of IoT data management methods according to architecture (red indicates vulnerability).
Sensors 22 08271 g001
Figure 2. System Architecture: (1) All N o d e i c register their identity through C A and then participate in the network and register the I C by storing the Genesis Block hash value in the M C . All IoT-Chain nodes must obtain a key through CA and register a certificate for the public key. In (2) N e t w o r k i c , N o d e i c generates the sensor data, B l o c k i c is generated, and the length of the I C increases. (3) To maintain the I C at no more than a certain size (storage capacity of IoT device), N o d e e x p o r t is all B H l a s t of all N o d e i c . By starting a consensus to verify that all N o d e i c have the same I C , S i g s c h n o r r and K e y s c h n o r r are created. (4) N o d e e x p o r t uploads I C to D F S and returns A d d r e s s i c and B l o c k e x p o r t with S i g s c h n o r r , and B H l a s t is created and passed to N e t w o r k m c . N o d e m c requests K e y p u b from C A , creates K e y s c h n o r r , validates S i g s c h n o r r , and if verified, B l o c k e x p o r t is M C , which is saved and embedded. (5) For user access control, the smart contract verifies the access rights of the user, and if verified, it allows access to B l o c k e x p o r t stored in the M C . (6) The user can access the I C stored in the D F S through A d d r e s s i c stored in B l o c k e x p o r t .
Figure 2. System Architecture: (1) All N o d e i c register their identity through C A and then participate in the network and register the I C by storing the Genesis Block hash value in the M C . All IoT-Chain nodes must obtain a key through CA and register a certificate for the public key. In (2) N e t w o r k i c , N o d e i c generates the sensor data, B l o c k i c is generated, and the length of the I C increases. (3) To maintain the I C at no more than a certain size (storage capacity of IoT device), N o d e e x p o r t is all B H l a s t of all N o d e i c . By starting a consensus to verify that all N o d e i c have the same I C , S i g s c h n o r r and K e y s c h n o r r are created. (4) N o d e e x p o r t uploads I C to D F S and returns A d d r e s s i c and B l o c k e x p o r t with S i g s c h n o r r , and B H l a s t is created and passed to N e t w o r k m c . N o d e m c requests K e y p u b from C A , creates K e y s c h n o r r , validates S i g s c h n o r r , and if verified, B l o c k e x p o r t is M C , which is saved and embedded. (5) For user access control, the smart contract verifies the access rights of the user, and if verified, it allows access to B l o c k e x p o r t stored in the M C . (6) The user can access the I C stored in the D F S through A d d r e s s i c stored in B l o c k e x p o r t .
Sensors 22 08271 g002
Figure 3. Multilevel blockchain structure.
Figure 3. Multilevel blockchain structure.
Sensors 22 08271 g003
Figure 4. IoT-Chain block: block structure of IoT-Chain.
Figure 4. IoT-Chain block: block structure of IoT-Chain.
Sensors 22 08271 g004
Figure 5. B l o c k i c generation process: (1) N o d e i c executes the VRF function when T X is created, returns V a l r a n d , and encrypts data with its own K e y p r i v and Sig. After generation, N o d e l e a d e r is checked to generate the next block in the last block of the blockchain and to send T X . (2) The T X structure, S i g , and V a l r a n d of N o d e l e a d e r that received T X are verified. (3) If all V a l r a n d are verified, the node with the largest V a l r a n d among the nodes that transmitted T X is selected as the next N o d e l e a d e r , recorded in a block, and distributed to all nodes.
Figure 5. B l o c k i c generation process: (1) N o d e i c executes the VRF function when T X is created, returns V a l r a n d , and encrypts data with its own K e y p r i v and Sig. After generation, N o d e l e a d e r is checked to generate the next block in the last block of the blockchain and to send T X . (2) The T X structure, S i g , and V a l r a n d of N o d e l e a d e r that received T X are verified. (3) If all V a l r a n d are verified, the node with the largest V a l r a n d among the nodes that transmitted T X is selected as the next N o d e l e a d e r , recorded in a block, and distributed to all nodes.
Sensors 22 08271 g005
Figure 6. Monitoring-Chain block: Structure of B l o c k m c implemented based on H F . After saving the D F S to lighten the I C , A d d r e s s i c , and S i g s c h n o r r , S i g p u b is saved. Signature, Index, and TxValidationCode of N o d e m c are stored in Metadata.
Figure 6. Monitoring-Chain block: Structure of B l o c k m c implemented based on H F . After saving the D F S to lighten the I C , A d d r e s s i c , and S i g s c h n o r r , S i g p u b is saved. Signature, Index, and TxValidationCode of N o d e m c are stored in Metadata.
Sensors 22 08271 g006
Figure 7. The export process between N e t w o r k i c and N e t w o r k m c : (1) N o d e e x p o r t maintains the routing table and agrees to verify that the B H l a s t of all nodes is the same. (2) The combined signature of all nodes is sent to N o d e e x p o r t , and K e y p u b of N o d e i c is requested from C A to generate and verify K e y s c h n o r r . (3) I C is saved in the D F S and A d d r e s s i c is returned. (4) B l o c k e x p o r t , including A d d r e s s i c , K e y s c h n o r r , and S i g s c h n o r r , is transferred to N e t w o r k m c and saved. (5) All N o d e i c of N e t w o r k i c restart the I C starting with B l o c k g e n e s i s with PreviousHash of B H l a s t of I C embedded in M C .
Figure 7. The export process between N e t w o r k i c and N e t w o r k m c : (1) N o d e e x p o r t maintains the routing table and agrees to verify that the B H l a s t of all nodes is the same. (2) The combined signature of all nodes is sent to N o d e e x p o r t , and K e y p u b of N o d e i c is requested from C A to generate and verify K e y s c h n o r r . (3) I C is saved in the D F S and A d d r e s s i c is returned. (4) B l o c k e x p o r t , including A d d r e s s i c , K e y s c h n o r r , and S i g s c h n o r r , is transferred to N e t w o r k m c and saved. (5) All N o d e i c of N e t w o r k i c restart the I C starting with B l o c k g e n e s i s with PreviousHash of B H l a s t of I C embedded in M C .
Sensors 22 08271 g007
Figure 8. Dataflow diagram in IoT.
Figure 8. Dataflow diagram in IoT.
Sensors 22 08271 g008
Figure 9. IoT device for IoT-Chain network configuration.
Figure 9. IoT device for IoT-Chain network configuration.
Sensors 22 08271 g009
Figure 10. Size comparison according to IoT-Chain export consensus.
Figure 10. Size comparison according to IoT-Chain export consensus.
Sensors 22 08271 g010
Figure 11. Latency comparison according to IoT-Chain consensus algorithm.
Figure 11. Latency comparison according to IoT-Chain consensus algorithm.
Sensors 22 08271 g011
Figure 12. CPU usage comparison according to IoT-Chain consensus algorithm.
Figure 12. CPU usage comparison according to IoT-Chain consensus algorithm.
Sensors 22 08271 g012
Figure 13. B l o c k i c propagation time according to data size.
Figure 13. B l o c k i c propagation time according to data size.
Sensors 22 08271 g013
Figure 14. Latency measurement results for generating Schnorr signatures.
Figure 14. Latency measurement results for generating Schnorr signatures.
Sensors 22 08271 g014
Figure 15. Export latency: the results of measuring the delay time when exporting the I C from N e t w o r k i c to N e t w o r k m c .
Figure 15. Export latency: the results of measuring the delay time when exporting the I C from N e t w o r k i c to N e t w o r k m c .
Sensors 22 08271 g015
Figure 16. IoT-Chain TPS measurement.
Figure 16. IoT-Chain TPS measurement.
Sensors 22 08271 g016
Table 1. Comparison of the existing Lightweight blockchain.
Table 1. Comparison of the existing Lightweight blockchain.
Node
Location
TX
Throughput
Storage
Overhead
CPU
Overhead
Access
Control
ScalabilityOff
Chain
Storage
MethodSummary/Discussion
Sensor
Chain [20]
On IoT
Device
-LowLowXOX
-
Blockchain structure organized by region
-
PoS Consensus Algorithm
-
Lightweight by aggregating sensor values stored in the block chain at specific cycles
-
A lightweight blockchain framework suitable for IoT devices with low computing power and storage.
-
IoT Data loss can occur because the data is averaged and summarized.
Richard
Dennis,
et al. [22]
On IoT
Device
-Low-XOX
-
’rolling’ method that deletes all blocks older than a preset period
-
Propose a temporal “rolling” blockchain which solves the problem of its current exponential growth, instead replacing it with a constant fixed-size blockchain
-
IoT Data loss occurs by erasing blocks of a certain period.
IOTA [23]On
Server
1000+HighHighXOX
-
DAG (Directed Acyclic Graph) based Tangle Consensus Algorithm
-
PoW Consensus Algorithm
-
Tangle algorithm-based cryptocurrency platform for IoT data storage
-
CPU operation is required using PoW method.
Li Bai,
et al. [24]
On
Server
-LowMidOXBuilt
in
-
Data access control using smart contracts
-
On-demand data sharing using smart contracts
-
Off-chain networks to solve storage and data processing challenges
-
A light-weighted Blockchain-based platform for IIoT to address security, trust, and island connection problem in the process of IIoT ecosystem construction
-
Blockchain nodes cannot be operated on-iot device.
Fusion
Chain [25]
On IoT
Device
-LowLowXOBuilt
in
-
Distributed storage for storing ’blocks’
-
PBFT-based consensus algorithm
-
PKI method to ensure data privacy
-
A decentralized lightweight blockchain that can operate on IoT devices by solving the limitations of blockchain for IoT Security and Privacy
-
Based on the PBFT consensus algorithm, O ( n 2 ) is required.
Edge
chain [26]
On
Server
-HighLowOOX
-
Blockchain-based IoT data management
-
IoT device regulation using smart contracts
-
Credit-based Edge Device Resource Management
-
Integrates a permissioned blockchain to link the edge cloud resources with each IoT devices account, resource usage and hence behavior of the IoT device
-
TPS measurement experiment was not carried out.
* Proposed
Structure
On IoT
Device
1000+LowLowOOBuilt
in
-
IoT-Chain for IoT device data generation and temporary storage
-
Monitoring-chain for IoT data monitoring and data access control
-
Schnorr signature-based data access control and signature lightweight
-
Data transfer method between blockchain networks using distributed file system
-
PBFT-based consensus algorithm
-
A lightweight multi-level blockchain network consisting only of IoT device node that can ensure IoT security and data privacy
Table 2. Notation.
Table 2. Notation.
SymbolDescription
I C IoT-Chain
M C Monitoring-Chain
H F Hyperledger Fabric
N e t w o r k i c Network composed of IoT-Chain nodes
N e t w o r k m c Hyperledger Fabric-based Monitoring-Chain network
D F S Distributed file system
A d d r e s s i c Address returned after uploading IoT-Chain to D F S
R o u t e Consensus path maintained by export nodes
K e y p r i v Private key for signing IoT-Chain nodes
S i g Signature of IoT-Chain node
K e y p u b Public key to verify IoT-Chain node signature
S i g s c h n o r r Combined signatures for consensus upon export
K e y s c h n o r r Combined public key to verify consensus during export
C A Certificate authority for IoT-Chain node registration
C e r t Certificate for public key verification of IoT-Chain node
V a l r a n d Verifiable random value returned after VRF function execution
R o u n d Restart cycle for IoT-Chain lightweight
S C Smart contracts installed on the Monitoring-Chain
B l o c k i c Blocks created in IoT-Chain
B l o c k e x p o r t Address, last block hash signature is stored in block
B l o c k m c Blocks created in Monitoring-Chain
B l o c k g e n e s i s Genesis Block when IoT-Chain is restarted
B H l a s t Last block hash value of IoT-Chain
B H g e n e s i s Genesis Block hash
N o d e i c Nodes that create transactions and maintain the blockchain in IoT-Chain
N o d e m c Node that maintains the blockchain in Monitoring-Chain
N o d e l e a d e r Nodes that are randomly selected from IoT-Chain to generate blocks
N o d e e x p o r t Node acting as a gateway in IoT-Chain
Table 3. STRIDE Threat Modeling [48].
Table 3. STRIDE Threat Modeling [48].
TreatThreat DefinitionProperty Violated
SSpoofing IdentifyPretending to be something or someone other than yourselfAuthentication
TTampering with DataModifying something on disk, network, memory, or elsewhereIntegrity
RRepudiationClaiming that you didn’ t do something or were not responsible;
can be honest or false
Non-repudiation
IInformation DisclosureProviding information to someone not authorized to access itConfidentiality
DDenial of ServiceExhausting resources needed to provide serviceAvailability
EElevation of PrivilegeAllowing someone to do something they are not authorized to doAuthorization
Table 4. STRIDE threat modeling—results.
Table 4. STRIDE threat modeling—results.
ZoneComponentProperty
Violated
Description
IoT
Device
IoT Device
/User
SAuthorization can be obtained when a device or user authenticates by disguising as another user.
EAttacks on data are possible if the access right of the device or user is allowed.
IoT Field
Gateway
IoT Cloud
Gateway
S, TRIDInformation disclosure and data tampering occur through techniques such as spoofing attacks on
gateways that exist outside the IoT network.
IoT Edge
Gateway
S, TRID
Cloud/Edge
Computing
Cloud
Eventhub
TRID- Due to centralized EventHub management, communication interference between
gateways and eavesdropping may occur.
- Data forgery occurs in storage due to centralized administrators or DDoS attacks.
Edge
Eventhub
TRID
Table 5. Experimental environment.
Table 5. Experimental environment.
TypeNameFunctionSpecs (Version)
HWNode in Monitoring ChainRunning Monitoring Chain NodeDellEMC PowerEdge R740 server
(CPU: Intel Xeon Silver 4210R 2.4 G,
RAM: 32 GB, Ubuntu 18.04)
Node in IoT ChainRunning IoT Chain NodeRaspberry Pi 4 B
(system on chip: Broad-com BCM2711,
quadcore Cortex-A72 (ARM v8) 64-bit SoC @ 1.5 GHz,
memory: 4 GB LPDDR4-3200 SDRAM,
OS: Raspbian GNU Linux 10)
SWNode.jsImplementation Node
in IoT Chain
v14.12.0
Fabric-clientConnect IoT Chain to
Monitoring Chain
v1.4.17
Hyperledger FabricDeploy Node in
Monitoring Chain
v2.0
GolangImplementation
Monitoring Chain Smart
Contract
v1.13
DockerDeploy Node in
Monitoring Chain
v20.10.7
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Na, D.; Park, S. IoT-Chain and Monitoring-Chain Using Multilevel Blockchain for IoT Security. Sensors 2022, 22, 8271. https://doi.org/10.3390/s22218271

AMA Style

Na D, Park S. IoT-Chain and Monitoring-Chain Using Multilevel Blockchain for IoT Security. Sensors. 2022; 22(21):8271. https://doi.org/10.3390/s22218271

Chicago/Turabian Style

Na, Dongjun, and Sejin Park. 2022. "IoT-Chain and Monitoring-Chain Using Multilevel Blockchain for IoT Security" Sensors 22, no. 21: 8271. https://doi.org/10.3390/s22218271

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop