Affiliation:
1. University of Copenhagen, Copenhagen, Denmark
2. Cardiff University, Cardiff, UK
Abstract
Blockchain sharding splits a blockchain into several shards where consensus is reached at the shard level rather than over the entire blockchain. It improves transaction throughput and reduces the computational resources required of individual nodes. But a derivation of trustworthy consensus within a shard becomes an issue as the longest chain based mechanisms used in conventional blockchains can no longer be used. Instead, a vote-based consensus mechanism must be employed. However, existing vote-based Byzantine fault tolerance consensus protocols do not offer sufficient security guarantees for sharded blockchains. First, when used to support consensus where only one block is allowed at a time (binary consensus), these protocols are susceptible to progress-hindering attacks (i.e., unable to reach a consensus). Second, when used to support a stronger type of consensus where multiple concurrent blocks are allowed (strong consensus), their tolerance of adversary nodes is low. This article proposes a new consensus protocol to address all these issues. We call the new protocol
MWPoW
+, as its basic framework is based on the existing Multiple Winners Proof of Work (MWPoW) protocol but includes new mechanisms to address the issues mentioned previously. MWPoW+ is a vote-based protocol for strong consensus, asynchronous in consensus derivation but synchronous in communication. We prove that it can tolerate up to
f
<
n
/2 adversary nodes in a n-node system as if using a binary consensus protocol and does not suffer from progress-hindering attacks.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference31 articles.
1. Farsite
2. Mohammad Javad Amiri, Divyakant Agrawal, and Amr El Abbadi. 2019. On sharding permissioned blockchains. In Proceedings of the 2019 IEEE International Conference on Blockchain (Blockchain). IEEE, Los Alamitos, CA, 282–285.
3. Adam Back. 2002. Hashcash: A Denial of Service Counter-Measure. Retrieved February 21 2023 from http://hashcash.org/papers/hashcash.pdf.
4. Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI’99). 173–186.
5. Practical byzantine fault tolerance and proactive recovery
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. PGS-BFT: A Pipeline-Based Graph Structure Byzantine Fault Tolerance Consensus Algorithm;2023 3rd International Conference on Computer Science and Blockchain (CCSB);2023-11-17
2. SLChain: A secure and low‐storage pressure sharding blockchain;Concurrency and Computation: Practice and Experience;2023-09-30