PAI Coin's Proof-of-Work (PoW) consensus mechanism utilizes the double SHA-256 hashing protocol-- the same mechanism used by Bitcoin Core. This compatibility with classic Bitcoin-style mining provides low barrier to entry for PAI Coin mining, consequently rendering the PAI Coin network vulnerable to so-called 51% attacks, among others. To mitigate such risks, this paper proposes a hybrid Proof-of-Work, Proof-of-Stake (PoS) consensus mechanism and provides a detailed technical analysis of how such a mechanism would counter some of the PAI Coin network's inherent vulnerabilities, if successfully implemented. A detailed technical outline of blockchain-based PoW & PoS consensus, including their advantages and disadvantages, when used both independently and in the context of the hybrid model, is provided. An economic analysis of attacking a hybrid-powered PAI Coin network is presented, and a final recommendation for future development of PAI Coin consensus is made.
In Bitcoin, to independently verify whether new transactions are correct or not, a type of a node called "Full Node" has to hold the whole of historical transactions. The transactions are stored in ledger called "Blockchain. " Blockchain is an append-only data structure. Thus, to operate Full Nodes, the required storage capacity would grow too large for resource-constrained devices. Due to the limitation, the existing lightweight node scheme is that a node relies on other Full Nodes. In this thesis, to reduce storage capacity with keeping the independence of each node, we propose a storage load balancing scheme "KARAKASA" using Distributed Hash Table (DHT). In KARAKASA, nodes distributedly keep the whole blockchain among DHT networked nodes. We evaluated KARAKASA from the view of storage capacity and independence. As a result, a node in a cluster does not need to trust other nodes. We concluded that nodes in a DHT cluster can behave like Full Nodes without holding the whole blockchain.
Md. Ashraf Uddin, Andrew Stranieri, Iqbal Gondal, Venki Balasubramanian
Blockchains have been widely used in Internet of Things(IoT) applications including smart cities, smart home and smart governance to provide high levels of security and privacy. In this article, we advance a Blockchain based decentralized architecture for the storage of IoT data produced from smart home/cities. The architecture includes a secure communication protocol using a sign-encryption technique between power constrained IoT devices and a Gateway. The sign encryption also preserves privacy. We propose that a Software Agent executing on the Gateway selects a Miner node using performance parameters of Miners. Simulations demonstrate that the recommended Miner selection outperforms Proof of Works selection used in Bitcoin and Random Miner Selection.
Blockchains were designed to solve the problem of double-spending in cryptocurrencies, and the success of the Bitcoin design has generated vastly more interest than previous proposals for digital currencies. Blockchains are being used in other areas as well, but the design choices that made blockchains effective for cryptocurrencies often do not fit well with other applications. In this paper we review the properties of distributed ledger technology (DLT) for use in typical data management applications and show how two recently developed distributed ledger ideas can be used to retain valuable aspects of blockchain while simplifying design and adding new but often necessary capabilities to permissioned distributed ledger applications. In particular, we are interested in the ability to delete or modify blocks, and the ability to provide a timestamping mechanism to provide a highly accurate time for applications that are time order dependent.
Alberto Sonnino, Shehar Bano, Mustafa Al-Bassam, George Danezis
We present a family of replay attacks against sharded distributed ledgers, that target cross-shard consensus protocols, such as the recently proposed Chainspace and Omniledger. They allow an attacker, with network access only, to double-spend or lock resources with minimal efforts. The attacker can act independently without colluding with any nodes, and succeed even if all nodes are honest; most of the attacks can also exhibit themselves as faults under periods of asynchrony. These attacks are effective against both shard-led and client-led cross-shard consensus approaches. Finally, we present Byzcuit - a new cross-shard consensus protocol that is immune to those attacks. We implement a prototype of Byzcuit and evaluate it on a real cloud-based testbed, showing that our defenses impact performance minimally, and overall performance surpasses previous works.
Alberto Sonnino, Shehar Bano, Mustafa Al-Bassam, George Danezis
We present a family of replay attacks against sharded distributed ledgers,\nthat target cross-shard consensus protocols, such as the recently proposed\nChainspace and Omniledger. They allow an attacker, with network access only, to\ndouble-spend or lock resources with minimal efforts. The attacker can act\nindependently without colluding with any nodes, and succeed even if all nodes\nare honest; most of the attacks can also exhibit themselves as faults under\nperiods of asynchrony. These attacks are effective against both shard-led and\nclient-led cross-shard consensus approaches. Finally, we present Byzcuit - a\nnew cross-shard consensus protocol that is immune to those attacks. We\nimplement a prototype of Byzcuit and evaluate it on a real cloud-based testbed,\nshowing that our defenses impact performance minimally, and overall performance\nsurpasses previous works.\n
Blockchain, which is a technology for distributedly managing ledger information over multiple nodes without a centralized system, has elicited increasing attention. Performing experiments on actual blockchains is difficult because a large number of nodes in wide areas are necessary. In this study, we developed a blockchain network simulator SimBlock for such experiments. Unlike the existing simulators, SimBlock can easily change behavior of nodes, so that it enables to investigate the influence of nodes' behavior on blockchains. We compared some simulation results with the measured values in actual blockchains to demonstrate the validity of this simulator. Furthermore, to show practical usage, we conducted two experiments which clarify the influence of neighbor node selection algorithms and relay networks on the block propagation time. The simulator could depict the effects of the two techniques on block propagation time. The simulator will be publicly available in a few months.
In today's blockchain system, designing a secure and high throughput blockchain on par with a centralized payment system is a difficult task. Sharding is one of the most worthwhile emerging technologies for improving the system throughput while maintain high-security level. However, previous sharding-related designs have two main limitations. First, the security and throughput of their random-based sharding system are not high enough as they did not leverage the heterogeneity among validators. Second, to design an incentive mechanism that promotes cooperation could incur a huge overhead on their system. In this article, we propose RepChain, a reputation-based secure and fast blockchain system via sharding, which also provides high incentive to stimulate node cooperation. RepChain utilizes reputation to explicitly characterize the heterogeneity among the validators and lay the foundation for the incentive mechanism. We propose a new double-chain architecture-a transaction chain and a reputation chain. For the transaction chain, an efficient Raft-based synchronous consensus has been presented. For the reputation chain, the synchronous Byzantine fault tolerance consensus that combines collective signing has been utilized to prevent the attack on both reputation score and the related transaction blocks. It supports a high throughput transaction chain with moderate generation speed. Moreover, we propose a reputation-based sharding and leader selection scheme. To analyze the security of RepChain, we propose a recursive formula to calculate the epoch security within only $\mathcal {O}(km^{2})$ time. Furthermore, we implement and evaluate RepChain on the Amazon Web Service platform. The results show our solution can enhance both throughout and security level of the existing sharding-based blockchain system.
<p style='text-indent:20px;'>In Bitcoin system, a transaction is given a priority value according to its attributes such as the remittance amount and fee, and transactions with high priorities are likely to be confirmed faster than those with low priorities. In this paper, we analyze the transaction-confirmation time for Bitcoin system. We model the transaction-confirmation process as a queueing system with batch service, M/<inline-formula><tex-math id="M1">\begin{document}$ \mbox{G}^B $\end{document}</tex-math></inline-formula>/1. We consider the joint distribution of numbers of transactions in system and the elapsed service time, deriving the mean transaction-confirmation time. Using the result, we derive the recursive formulae of mean transaction-confirmation times of an M/<inline-formula><tex-math id="M2">\begin{document}$ \mbox{G}^B $\end{document}</tex-math></inline-formula>/1 queue with priority service discipline. In numerical examples, we show the effect of the maximum block size on the mean transaction-confirmation time, investigating the accuracy region of our queueing model. We also discuss how the increase in micropayments, which are likely to be given low priorities, affects the transaction-confirmation time.
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.
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.
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.
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.
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.
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.
Cryptocurrencies are based on cryptography-based asset disposals broadcasted peer-to-peer to be validated decentrally according to consensus mechanisms in compliance with consented protocols. Protocol development is associated with risks, and there are conflicts of interests. Collusion involving protocol developers may increase such risks. This paper explores liability for collusion in cryptocurrency protocol development. It is found that liability gives some, but not sufficient, protection against harmful collusion.
Raheel Ahmed Memon, Jianping Li, Muhammad Irshad Nazeer, Ahmad Neyaz Khan · 5 authors
Integration of blockchain and Internet of Things (IoT) to build a secure, trusted and robust communication technology is currently of great interest for research communities and industries. But challenge is to identify the appropriate position of blockchain in current settings of IoT with minimal consequences. In this article we propose a blockchain-based DualFog-IoT architecture with three configuration filter of incoming requests at access level, namely: Real Time, Non-Real Time, and Delay Tolerant Blockchain applications. The DualFog-IoT segregate the Fog layer into two: Fog Cloud Cluster and Fog Mining Cluster. Fog Cloud Cluster and the main cloud datacenter work in a tandem similar to existing IoT architecture for real-time and non-real-time application requests, while the additional Fog Mining Cluster is dedicated to deal with only Delay Tolerant Blockchain application requests. The proposed DualFog-IoT is compared with existing centralized datacenter based IoT architecture. Along with the inherited features of blockchain, the proposed model decreases system drop rate, and further offload the cloud datacenter with minimal upgradation in existing IoT ecosystem. The reduced computing load from cloud datacenter doesn't only help in saving the capital and operational expenses, but it is also a huge contribution for saving energy resources and minimizing carbon emission in environment. Furthermore, the proposed DualFog-IoT is also being analyzed for optimization of computing resources at cloud level, the results presented shows the feasibility of proposed architecture under various ratios of incoming RT and NRT requests. However, the integration of blockchain has its footprints in terms of latent response for delay tolerant blockchain applications, but real-time and non-real-time requests are gracefully satisfying the service level agreement.
Bitcoin is a top-ranked cryptocurrency that has experienced huge growth and survived numerous attacks. The protocols making up Bitcoin must therefore accommodate the growth of the network and ensure security. However, Bitcoin’s transaction dissemination protocol has mostly evaded optimization. This protocol is based on flooding and though it is secure and fault-tolerant, it is also highly inefficient. Specifically, our measurements indicate that 43% of the traffic generated by transaction dissemination in the Bitcoin network is redundant. In this paper we introduce a new transaction dissemination protocol called Erlay. Erlay is a hybrid protocol that combines limited flooding with intermittent reconciliation. We evaluated Erlay in simulation and by implementing and deploying it at scale. Compared to Bitcoin’s current protocols, Erlay reduces the bandwidth used to announce transactions by 84% without significantly affecting privacy or propagation speed. In addition, Erlay retains the existing Bitcoin security guarantees and is more scalable relative to the number of nodes in the network and their connectivity. Erlay is currently being investigated by the Bitcoin community for future use with the Bitcoin protocol.
Online content delivery has witnessed dramatic growth recently with traffic consuming over half of today’s Internet bandwidth. This escalating demand has motivated content publishers to move outside the traditional solutions of infrastructure-based content delivery networks (CDNs). Instead, many are employing peer-to-peer data transfers to reduce the service cost and avoid bandwidth over-provision to handle peak demands. Unfortunately, the open access work model of this paradigm, which allows anyone to join, introduces several design challenges related to security, efficiency, and peer availability. In this dissertation, we introduce CacheCash, a cryptocurrency-based decentralized content distribution network designed to address these challenges. CacheCash bypasses the centralized approach of CDN companies for one in which end users organically set up new caches in exchange for cryptocurrency tokens. Thus, it enables publishers to hire caches on an as-needed basis, without constraining these parties with long-term business commitments. To address the challenges encountered as the system evolved, we propose a number of protocols and techniques that represent basic building blocks of CacheCash’s design. First, motivated by the observation that conventional security assessment tools do not suit cryptocurrency-based systems, we propose ABC, a threat modeling framework capable of identifying attacker collusion and the new threat vectors that cryptocurrencies introduce. Second, we propose CAPnet, a defense mechanism against cache accounting attacks (i.e., a client pretends to be served allowing a colluding cache to collect rewards without doing any work). CAPnet features a bandwidth expenditure puzzle that clients must solve over the content before caches are given credit, which bounds the effectiveness of this collusion case. Third, to make it feasible to reward caches per data chunk served, we introduce MicroCash, a decentralized probabilistic micropayment scheme that reduces the overhead of processing these small payments. MicroCash implements several novel ideas that make micropayments more suitable for delay-sensitive applications, such as online content delivery. CacheCash combines the previous techniques to produce a novel service-payment exchange protocol that secures the content distribution process. This protocol utilizes gradual content disclosure and partial payment collection to encourage the honest collaborative work between participants. We present a detailed game theoretic analysis showing how to exploit rational financial incentives to address several security threats. This is in addition to various performance optimization mechanisms that promote system efficiency and scalability. Lastly, we evaluate system performance and show that modest machines can serve/retrieve content at a high bitrate with minimal overhead.
Open access
Caching and Content Delivery
Peer-to-Peer Network Technologies
Advanced Steganography and Watermarking Techniques
The old mantra of decentralizing the Internet is coming again with fanfare, this time around the blockchain technology hype. We have already seen a technology supposed to change the nature of the Internet: peer-to-peer. The reality is that peer-to-peer naming systems failed, peer-to-peer social networks failed, and yes, peer-to-peer storage failed as well. In this paper, we will review the research on distributed systems in the last few years to identify the limits of open peer-to-peer networks. We will address issues like system complexity, security and frailty, instability and performance. We will show how many of the aforementioned problems also apply to the recent breed of permissionless blockchain networks. The applicability of such systems to mature industrial applications is undermined by the same properties that make them so interesting for a libertarian audience: namely, their openness, their pseudo-anonymity and their unregulated cryptocurrencies. As such, we argue that permissionless blockchain networks are unsuitable to be the substrate for a decentralized Internet. Yet, there is still hope for more decentralization, albeit in a form somewhat limited with respect to the libertarian view of decentralized Internet: in cooperation rather than in competition with the superpowerful datacenters that dominate the world today. This is derived from the recent surge in interest in byzantine fault tolerance and permissioned blockchains, which opens the door to a world where use of trusted third parties is not the only way to arbitrate an ensemble of entities. The ability of establish trust through permissioned blockchains enables to move the control from the datacenters to the edge, truly realizing the promises of edge-centric computing.