Blockchain Papers

Zhenyu Guan, Hanzheng Lyu, Haibin Zheng, Dawei Li · 5 authors

No abstract is available for this record.

Clemens Wickboldt

A comprehensive empirical study is performed to measure the performance of a Blockchain-based Certi cation Storage System in Hyperledger Fabric. This work is based on a proof of concept in the aviation industry and fol- lows a Technical Risk & E cacy evaluation strategy to determine the utility derived from the use of the artefact. Relevant tuning parameters for per- formance and scalability as well as bottlenecks are identi ed. The impact of con guration parameters such as blocksize, transaction arrival rate and number of concurrent users on the systems performance is investigated. Ob- servations show that demands at throughput above system limits lead to transaction failures. Contributed are a repeatable process to performance sensitivity analysis and recommendations for con guring a Blockchain-based Certi cation Storage System for stable but high performance. The results can be used as a basis for optimizing the performance of similar systems.

Ke Gu, Linyu Wang, Weijia Jia

Currently, blockchain technology has been widely researched and is being applied to many other fields, such as financial transactions, E-government, logistics, and supply-chain system. It can be used to store and maintain transaction data through the de-centralized model. In this paper, we propose an autonomous resource request transaction framework based on blockchain in a social network, in which all kinds of resources in the social community can be traded through blockchain technology. When a user needs to acquire some resources from a community, the user may make a transaction with the members from the community through blockchain technology while the members autonomously negotiate each other to reach an agreement. The proposed framework provides an incentive mechanism to encourage community members to disseminate the resources through a smart contract.

Anh Le-Tuan, Darshan Hingu, Manfred Hauswirth, Danh Le-Phuoc

RDF stores provide a simple abstraction for publishing and querying data, that is becoming a norm in data sharing practice. They also empower the decentralised architecture of data publishing for the Web or IoT-driven systems. Such architecture shares a lot in common with blockchain infrastructure and technologies. Therefore, there are emerging interests in marrying RDF stores and blockchain to realise desirable but speculative benefits of blockchain-powered data sharing. This paper presents the first RDF store with blockchain that enables lightweight edge devices to control of the data sharing processes (personal, IoT data). Our novel approach on the deep integration of the storage design for RDF store enables the ability to enforce controlling measures on access methods and auditing policies over data elements via smart contracts before they fetched from the sources to the consumers. Our experiments show that the prototype system delivers an effective performance for a processing load of 1 billion triples on a small network of lightweight nodes which costs less than a commodity PC.

Wondeuk Yoon, Janggwan Im, Indal Choi, Daeyoung Kim

Today, the Internet of Things (IoT) technology is applied everywhere, providing tremendous amounts of IoT service. The GS1, a non-profit international standards organization, has established standards for IoT technology. Especially, the GS1 standardized an Object Name Service (ONS) leveraging DNS's distributed and federated infrastructure, enables users to manage and discover IoT services such as the retail, food, healthcare, smart city, and so on. However, the ONS is vulnerable to the data tampering, privilege escalation, and service fault caused by DNS attacks including the man in the middle, cache poisoning, replay, hijacking, and denial of service attacks. Nowadays, IoT services are used in security-sensitive areas, such as finance and healthcare. Therefore, the security of ONS should be strengthened before causing severe problems such as data breach, economic loss, and social loss. In this paper, we propose a blockchain-based ONS with a tokenized authority called the BlockONS. The BlockONS provides strength in the data tampering and privilege escalation allowing a fault tolerance. The BlockONS consists of a content off-chain scaling, a data tampering validation method, a fault-tolerance method, and a Blockchain Token-Based Access Control (BTBAC) method. We designed the BlockONS into two parts: A BlockONS Node part manages the validation method and BTBAC model. A BlockONS Agent part manages the off-chain scaling and fault tolerance. Finally, we implemented the BlockONS leveraging a Hyperledger Sawtooth blockchain. We proved the proposed validation method, fault tolerance method, and BTBAC method through use cases and security analyses on attack situations. We deployed the BlockONS in the Daejeon city and evaluated the performance to show the feasibility of the BlockONS.

Sunghyun Cho, C. Jeong

As the Internet has developed, media distribution services have spread. However, these distribution services have many problems. The blockchain technology can solve these problems. In this paper, this blockchain is defined as media blockchain and is classified into two categories. One is content security that means securing content using blockchain. The other is content right information that means tracing and managing right information using blockchain. We introduce and analyze the media blockchain.

Wentong Wang, Ning Hu, Xin Liu

No abstract is available for this record.

Auqib Hamid Lone, Roohie Naaz Mir

Blockchain is a decentralised, replicated, transparent and immutable data store. Blockchains are best described not as 'trustless', but on the basis of distributed trust: trusting everyone in aggregate. Consensus protocols are the heart and soul of the blockchains as they help in achieving this distributed trust. Blockchains are updated via the consensus protocols that guarantee their consistency and integrity over geographically distributed network nodes. Various algorithms can be applied to achieve a consensus based on the requirements like performance, security, scalability, consistency, and failure redundancy. Creating a global fair decentralised consensus protocol is of prime importance, in order to address above-mentioned requirements sufficiently. This paper focuses on analysing the already proposed consensus protocols adopted by popular blockchain platforms to determine their feasibility and efficiency. Parameters that are critical in evaluating blockchain consensus protocol are also discussed. This paper also analyses the hardness of achieving the fair decentralised trust with proof.

Xinying Wang, Abdullah Al-Mamun, Feng Yan, Dongfang Zhao

No abstract is available for this record.

Mohd Saalim Jamal, Kataoka Kotaro

In the Bitcoin network, the current block interval time of 10 minutes and the maximum block size of 1MB leads to a low transaction throughput compared to visa and other payment methods. Decreasing the block interval time or increasing the block size may increase the probability of inconsistency, leading to frequent blockchain fork in the Bitcoin network. This work attempts to decrease the block interval and increase the block size without hampering the network with excessive forking. It investigates the peer selection technique of the Bitcoin network for improving its performance. Instead of random peer selection as per the current Bitcoin protocol, it studies the effect of improved peer selection using link information on the performance of the Bitcoin network using a real-time testbed created with Bitcoind [4] client. An efficient peer-to-peer network formed by choosing the optimum peers helps to alleviate the frequency of forking even with a low block interval time and high block size. Geographical location based peer selection [1] and low-latency based peer selection [2] provides a better network formation, but their effect on mean propagation delay, transaction throughput, and stale block rate has not been studied. This work explored various techniques for selecting peers to form the peer-to-peer network. All Pair Shortest Path based and network partition using community detection are explored with a view of optimizing the network globally. A local view of optimizing the network formation considering the particular node is also investigated. This work then proposes to choose peers based on a linear combination of both latency and bandwidth since bandwidth also plays an important role when block size increases. The proposed algorithm generates a score for all the peers received either by DNS seed or by peer discovery mechanism and chooses the top scored peers. Simulation results based on the Bitcoin Simulator [3] show a reduction of about 60-70% in mean propagation delay, 30-35% in stale block rate and an increment of 20-25% in transaction throughput over the original Bitcoin protocol even with a small block interval time of 30 second and high block size of 2MB. The state-of-art BCBPT [2] algorithm is also implemented for the comparison. In addition to this, the practical operation of the proposed approach in the actual Bitcoin network is also discussed. The expected overhead incurred in applying the algorithm in the network is also stated along with the possibility of overhead reduction by the appropriate parameter adjustments.

Mark Zuckerberg

Mark Zuckerberg testified before congress today on October 23, 2019 regarding Facebook’s cryptocurrency Libra

Gowri Ramachandran, Sharon L.G. Contreras, Bhaskar Krishnamachari

<p>IoT applications are starting to rely heavily on edge computing due to the advent of low-power and high data-rate wireless communication technologies such as 5G and the processing capability of GPU-driven edge platforms. However, the computation and the data communication model for the edge computing applications are quite diverse, which limits their interoperability. An interoperable edge computing architecture with a versatile communication model would lead to the development of innovative and incentive-driven edge computing applications by combining various data sources from a wide array of devices. In this paper, we present an edge computing architecture by extending the publish-subscribe protocol with support for incentives. Our novel publish-pay-subscribe protocol enables the data producers (publishers) to sell their data with data consumers and service providers (subscribers). The proposed architecture not only allows the device owners to gain incentive but also enable the service providers to sell the processed data with one or more data consumers. Our proof-of-concept implementation using AEDES publish-subscribe broker and Ethereum cryptocurrency shows the feasibility of publish-pay-subscribe broker and its support for data-driven and incentive-based edge computing applications.</p>

Junyuan Leng

The architecture of integrating blockchain with Industry 4.0 IoT network has emerged in recent years. Industry 4.0 refers to the new concept of intelligent manufacturing paradigm, including Internet of Things (IoT), Cloud computing and Cyber-Physical System (CPS). Blockchain is a decentralized, distributed ledger system used to record transactions across multiple participants. Blockchain offers a way of recording data that is designed to be secure, reliable and auditable, which makes it a preferred solution for securing IoT network. However, traditional blockchain suffers from storage scalability issue because each blockchain node stores the entire blockchain. The storage scalability problem can be even worse when blockchain is used in IoT network due to the high volume of data generated by massive number of IoT sensors. In this thesis, we propose a distributed storage architecture for blockchain based on erasure coding. The property of erasure coding makes it possible to greatly reduce storage overhead for each node without affecting the overall data integrity. Furthermore, to minimize the latency of rebuilding data in this distributed storage architecture, we formulate a latency-cost trade-off optimization problem and propose an efficient and scalable algorithm. Simulation results show that our architecture can achieve up to 80% latency reduction compared with other widely used distributed storage architectures. In addition, our architecture can save up to 90% storage space for each node, which removes the largest obstacle for integrating blockchain into IoT network.

Scarlett Gourley, Hitesh Tewari

No abstract is available for this record.

Pengfei Wang, Wenjuan Cui, Jianhui Li

No abstract is available for this record.

Mohsen Attaran, Angappa Gunasekaran

No abstract is available for this record.

Katerina Doka, Tasos Bakogiannis, Ioannis Mytilinis, Georgios Goumas

No abstract is available for this record.

Mona Taghavi, Jamal Bentahar, Hadi Otrok, Kaveh Bakhtiyari

This paper introduces a novel blockchain-based decentralized federation model that embodies quality verification for cloud providers who lease computing resources from each other. The blockchain structure removes the barriers of a traditional centralized federation and offers a fully distributed and transparent administration by enforcing the involved agents to maintain consensus on the data. For a blockchain-based federation, it is vital to avoid blind-trust on the claimed SLA guarantees and monitor the quality of service which is highly desirable considering the multi-tenancy characteristic of cloud services. Due to the fact that the blockchain network is unable to access the outside world, it cannot handle, by its own, providers misbehavior in terms of SLA violations. Thus, we introduce oracle as a verifier agent to monitor the quality of the service and report to the smart contract agents deployed on the blockchain. Oracle is a trusted third-party agent who can communicate with the outside world of the blockchain network. The interaction between cloud service providers (either providing a service or requesting it from another provider) and the oracle through smart contracts comprises a system of autonomous and utility maximizer agents. Cloud requesters seek to receive high quality services with constant monitoring at cheap prices or even with no charge, while cloud providers aim to have a balanced work-load with less preserved capacity, and the oracle tends to charge higher for their monitoring services. Therefore, to model this conflicting situation, we formulate a dynamic Stackelberg differential game to optimize the cost of using the oracle and maximize the profit of the agents with the role of provider agent as a leader, and the requester and verifier agents as followers. Our designed Stackelberg differential game can seize the dynamicity of users' demand and resource provisioning in a competitive cloud market. We implemented our proposed decentralized model using the Solidity language in the remix IDE on the Ethereum network. We further evaluated the optimal controls and agents' profit with real-world data simulated for three concrete cloud providers. The results revealed that the requester agent initiates most of the quality verification requests at the beginning to the middle time of the contract. Thus, the provider agent could reserve less computing resources considering the fact that it could share the workload among other customers' computing resources during the peak-time. Moreover, imposing a higher penalty on the provider agent increased the capacity and decreased the number of requests for quality verification at the equilibrium. The evaluation also disclosed that the impact of timing in the dynamic pricing strategy of the verifier agent is very minimal, and the provisioning capacity of the provider is strongly correlated with the monitoring price.

Xin Lu, Lingyun Shi, Zhenyu Chen, Xunfeng Fan · 7 authors

The new network paradigm of Software Defined Networking (SDN) has been widely adopted. Due to its inherent advantages, SDN has been widely used in various network fields such as data centers, WAN, enterprise, Optical Networks and energy Internet. Among them, SDN-based energy Internet systems are receiving more and more attention. But at the same time, some problems and challenges are gradually becoming more prominent. The SDN-based energy Internet is a distributed architecture for renewable energy, so the traditional centralized electric energy trading model will no longer apply. The blockchain has been rapidly developed and applied in various domains by virtue of its decentralization, coordinated autonomy, and non-tamperability. We propose an SDN-based energy Internet distributed energy trading scheme supported by blockchain technology. The proposed scheme achieves a reasonable match of the transaction objects under the premise of protecting privacy. Finally, we conducted a comprehensive, systematic security and applicability analysis of the proposed solution, further confirming that the system meets our design goals.

Natalie Buciek, Philipp Sandner

No abstract is available for this record.

Paulius Danielius, Tomas Savenas, Saulius Masteika

No abstract is available for this record.

Teasung Kim, Jaewon Noh, Sunghyun Cho

A centralized IoT network has a problem of data centralization because data is stored in a center. A blockchain is emerging as a solution to solve the problem in the IoT network by storing blocks to each device. However, lightweight IoT devices cannot store all of the blockchain due to their low storage capacity. We propose storage compression consensus (SCC) algorithm which compresses a blockchain in each device to ensure the storage capacity. When a lightweight device does not have enough storage space, the device processes the SCC to compress the blockchain. We implemented simulations to compare between the SCC and the existing consensus algorithm. As a result, the proposed SCC reduced the storage capacity of stored blockchain by 63% compared to the existing algorithm.

Benedikt Kirpes, Micha Roon, Christopher Burgahn

The mobility sector experiences a fundamental shift to more connected, autonomous, shared and electric means of transportation. For an electric mobility system to function, an efficient and reliable electric vehicle charging network is required. The Open Charging Network, which is built and curated by the Share&Charge Foundation is a digital, open and decentralized infrastructure for operating and connecting assets of the e-mobility ecosystem like charge points and electric vehicles. In such a network validity and consistency of data are crucial. Since the underlying information system is designed based on distributed ledger technologies and distributed hash tables, also the validation of data for the respective key-value store should be implemented and executed in a distributed manner. In this paper, we contribute to the body of research by analyzing the current situation in distributed systems and presenting the design and development of a mechanism for a distributed data validation. We provide an outlook into the future implementation within the Open Charging Network, where the solution will be demonstrated in a suitable context. Further it will be evaluated regarding the primary requirement of data validity and secondary requirements such as availability, reliability and scalability.

Remigijus Paulavičius, Saulius Grigaitis, Aleksandr Igumenov, Ernestas Filatovas

In this paper, we present the progress of blockchain technology from the advent of the original publication titled “Bitcoin: A Peer-to-Peer Electronic Cash System,” written by the mysterious Satoshi Nakamoto, until the current days. Historical background and a comprehensive overview of the blockchain technology are given. We provide an up-to-date comparison of the most popular blockchain platforms with particular emphasis given to consensus protocols. Additionally, we introduce a BlockLib, an extensively growing online library on blockchain platforms collected from the various sources and designed to enable contributions from the blockchain community. Main directions of the current blockchain research, facing challenges as well as the main fields of applications, are summarized. We also layout the possible future lines in the blockchain technology development.