Blockchains and Smart Contracts for the Internet of Things
TL;DR: The conclusion is that the blockchain-IoT combination is powerful and can cause significant transformations across several industries, paving the way for new business models and novel, distributed applications.
Abstract: Motivated by the recent explosion of interest around blockchains, we examine whether they make a good fit for the Internet of Things (IoT) sector. Blockchains allow us to have a distributed peer-to-peer network where non-trusting members can interact with each other without a trusted intermediary, in a verifiable manner. We review how this mechanism works and also look into smart contracts—scripts that reside on the blockchain that allow for the automation of multi-step processes. We then move into the IoT domain, and describe how a blockchain-IoT combination: 1) facilitates the sharing of services and resources leading to the creation of a marketplace of services between devices and 2) allows us to automate in a cryptographically verifiable manner several existing, time-consuming workflows. We also point out certain issues that should be considered before the deployment of a blockchain network in an IoT setting: from transactional privacy to the expected value of the digitized assets traded on the network. Wherever applicable, we identify solutions and workarounds. Our conclusion is that the blockchain-IoT combination is powerful and can cause significant transformations across several industries, paving the way for new business models and novel, distributed applications.
Citations
More filters
TL;DR: In this paper, a highway landslide located in the mountainous region of Southwest China is taken as a representative example to carry out the initiation mechanism and deformation characteristics analysis, and study the intelligent partitioning method in this paper.
Abstract: An increasing number of landslides are occurring during the construction of highways in mountainous areas all over the world. A recent highway landslide located in the mountainous region of Southwest China is taken as a representative example to carry out the initiation mechanism and deformation characteristics analysis, and study the intelligent partitioning method in this paper. The geological conditions of the landslide are obtained through detailed geological surveys and investigation. A three-dimensional (3D) monitoring network with a total of 72 multi-points, including 53 surface displacement monitoring points and 19 deep displacement monitoring holes, is established to examine the spatial deformation characteristics of the landslide for nearly 25 months. The monitoring results of the surface displacement show that the dynamic deformation of the landslide can be divided into three stages, namely initial deformation stage, accelerated deformation stage, and stabilization stage. Based on the strata distribution obtained by the borehole investigation and the results of deep displacement monitoring, the depth of the slip surface can be reliably determined. The smart contract method in blockchain technology combined with the multi-point monitoring dataset is novelty applied to realize the intelligent automatic partition of the highway landslide without any human involvement. This method can provide the basis for further independent analysis of different landslide zones. According to the investigation and analysis, the initiation mechanism for the highway landslides is attributed to both internal poor geological conditions and external intense precipitation and engineering excavation.
17 citations
TL;DR: In this article , a generic architecture design that incorporates public key infrastructure (PKI) to establish trust of IoT services is introduced, which can potentially solve the trust problem and based on their experiment it can be scaled well.
Abstract: ABSTRACT The advancement of hardware, software, and Internet infrastructure leads to the increasing quantities of smart Internet of Things (IoT) devices. Meanwhile, security issues have increasingly brought to us the concerns due to the evolving IoT scope and mass communications. Trusting service vendors depends on their devices that generate information and provide executions. Blockchain becomes an attractive choice, as evidenced by its wide adoptions. However, trusting IoT-based services becomes an important issue since the implementation of Blockchain-based IoT (BIoT) services is proprietary and independent. This paper introduces a generic architecture design that incorporates Public Key Infrastructure (PKI) to establish trust of BIoT services. This can potentially solve the trust problem and based on our experiment it can be scaled well. We also demonstrate how specification languages can be useful to express requirements. It decouples users from Blockchain and thus they can specify qualities of BIoT services without deep knowledge to work with Blockchain.
17 citations
TL;DR: A secure method to exchange resources (SMER) between heterogeneous IoT devices is proposed, which adopts a compensable mechanism for resource exchange and a series of security mechanisms to ensure the security of resource exchanges.
Abstract: The number of IoT (Internet of things) connected devices increases rapidly. These devices have different operation systems and therefore cannot communicate with each other. As a result, the data they collected is limited within their own platform. Besides, IoT devices have very constrained resources like weak MCU (micro control unit) and limited storage. Therefore, they need direct communication method to cooperate with each other, or with the help of nearby devices with rich resources. In this paper, we propose a secure method to exchange resources (SMER) between heterogeneous IoT devices. In order to exchange resources among devices, SMER adopts a compensable mechanism for resource exchange and a series of security mechanisms to ensure the security of resource exchanges. Besides, SMER uses a smart contract based scheme to supervise resource exchange, which guarantees the safety and benefits of IoT devices. We also introduce a prototype system and make a comprehensive discussion.
17 citations
07 Mar 2019
TL;DR: This article proposes a conceptual solution—Blockchained IoT—and shows that this concept is able to be realized on-chip level using mass-produced dynamical random access memory (DRAM) and coarsely evaluated the probability of two DRAM IC chips being associated with an identical cyber-physical chip identification accidentally.
Abstract: The widespread computer network has been changing drastically and substantially since blockchain and IoT entered the stage. Blockchain is good at protecting data transactions between logical nodes with a desirable guaranty. Internet of Things (IoT), on the other hand, by providing ultimate convenience to consumers, is expected to give rise to many various merits in a broad business scene. The security of IoT is still an open problem and if blockchain can reinforce IoT security, as many authors have hoped in recent papers, these newcomers appear to make a good collaboration to reinforce IoT security. However, software copes with logical nodes and IoT involves a vast number of physical nodes (IoT devices). Enabling blockchain to protect IoT cannot be brought to reality without respectively identifying logical and physical nodes. This is identical to the Proof-of-Trust problem. In this article, we propose a conceptual solution—Blockchained IoT—and show that this concept is able to be realized on-chip level using mass-produced dynamical random access memory (DRAM). We have completed the first test of longevity and temperature dependence (−40 °C to 105 °C) to confirm the necessary characteristics for the 5G base stations that are known to have an issue of self-heating. Furthermore, we have coarsely evaluated the probability of two DRAM IC chips being associated with an identical cyber-physical chip identification accidentally. Then, such a probability is minimal.
17 citations
01 Jul 2018
TL;DR: IPchain this paper is a blockchain to store the allocations and delegations of IP addresses, with the aim of easing the deployment of secure interdomain routing systems, which is of vital importance to the Internet since it prevents unwanted traffic redirections.
Abstract: We present IPchain, a blockchain to store the allocations and delegations of IP addresses, with the aim of easing the deployment of secure interdomain routing systems. Interdomain routing security is of vital importance to the Internet since it prevents unwanted traffic redirections. IPchain makes use of blockchains' properties to provide flexible trust models and simplified management when compared to existing systems. In this paper we argue that Proof of Stake is a suitable consensus algorithm for IPchain due to the unique incentive structure of this use-case. We have implemented and evaluated IPchain's performance and scalability storing around 150k IP prefixes in a 1GB chain.
17 citations
References
More filters
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Abstract: I have long felt that, because it was posed as a cute problem about philosophers seated around a table, Dijkstra’s dining philosopher’s problem received much more attention than it deserves. (For example, it has probably received more attention in the theory community than the readers/writers problem, which illustrates the same principles and has much more practical importance.) I believed that the problem introduced in [41] was very important and deserved the attention of computer scientists. The popularity of the dining philosophers problem taught me that the best way to attract attention to a problem is to present it in terms of a story. There is a problem in distributed computing that is sometimes called the Chinese Generals Problem, in which two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive. I stole the idea of the generals and posed the problem in terms of a group of generals, some of whom may be traitors, who have to reach a common decision. I wanted to assign the generals a nationality that would not offend any readers. At the time, Albania was a completely closed society, and I felt it unlikely that there would be any Albanians around to object, so the original title of this paper was The Albanian Generals Problem. Jack Goldberg was smart enough to realize that there were Albanians in the world outside Albania, and Albania might not always be a black hole, so he suggested that I find another name. The obviously more appropriate Byzantine generals then occurred to me. The main reason for writing this paper was to assign the new name to the problem. But a new paper needed new results as well. I came up with a simpler way to describe the general 3n+1-processor algorithm. (Shostak’s 4-processor algorithm was subtle but easy to understand; Pease’s generalization was a remarkable tour de force.) We also added a generalization to networks that were not completely connected. (I don’t remember whose work that was.) I also added some discussion of practical implementation details.
5,208 citations
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Abstract: Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one or more of them may be traitors who will try to confuse the others. The problem is to find an algorithm to ensure that the loyal generals will reach agreement. It is shown that, using only oral messages, this problem is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals. With unforgeable written messages, the problem is solvable for any number of generals and possible traitors. Applications of the solutions to reliable computer systems are then discussed.
4,901 citations
[...]
TL;DR: It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Abstract: Large-scale peer-to-peer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby undermining this redundancy. One approach to preventing these "Sybil attacks" is to have a trusted agency certify identities. This paper shows that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
4,816 citations
"Blockchains and Smart Contracts for..." refers background in this paper
...Because of the Sybil attack [15], consensus in public networks is costly...
[...]
...anyone can join though, this would be catastrophic because of the Sybil attack [15]: a single entity could join with multiple identities, get multiple votes, and thus influence the network to favor this entity’s interests....
[...]
22 Feb 1999
TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Abstract: This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3% slower than a standard unreplicated NFS.
3,562 citations
"Blockchains and Smart Contracts for..." refers background or methods in this paper
...5If more than 3f + 1 nodes are used, then the quorum thresholds listed in [26] may lead to forks....
[...]
...Tendermint vs PBFT—Tendermint....
[...]
...Sieve [38], a mechanism used in the HyperLedger Fabric project, augments the PBFT algorithm [26] by adding speculative execution and verification phases, inspired by the execute-verify architecture presented in [39]....
[...]
...Tendermint [32] provides BFT tolerance and is similar to the PBFT algorithm; however it provides a tighter guarantee with regards to the results returned to the client when more than one third of the nodes are faulty, and allows for a dynamically changing set of set of validators, and leaders that can be rotated in a round-robin manner, among other optimizations [33]....
[...]
...PBFT works on the assumption that less than one third of the nodes are faulty (f ), which is why say that it requires at least5 3f + 1 nodes....
[...]
Proceedings Article•
19 Jun 2014TL;DR: Raft is a consensus algorithm for managing a replicated log that separates the key elements of consensus, such as leader election, log replication, and safety, and it enforces a stronger degree of coherency to reduce the number of states that must be considered.
Abstract: Raft is a consensus algorithm for managing a replicated log. It produces a result equivalent to (multi-)Paxos, and it is as efficient as Paxos, but its structure is different from Paxos; this makes Raft more understandable than Paxos and also provides a better foundation for building practical systems. In order to enhance understandability, Raft separates the key elements of consensus, such as leader election, log replication, and safety, and it enforces a stronger degree of coherency to reduce the number of states that must be considered. Results from a user study demonstrate that Raft is easier for students to learn than Paxos. Raft also includes a new mechanism for changing the cluster membership, which uses overlapping majorities to guarantee safety.
1,811 citations
"Blockchains and Smart Contracts for..." refers methods in this paper
...popular Raft algorithm [30], is used as a consensus mechanism in Juno [31]....
[...]