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.
- [1] . 2002. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Operating Systems Review 36, SI (2002), 1–14.Google Scholar
Digital Library
- [2] . 2019. On sharding permissioned blockchains. In Proceedings of the 2019 IEEE International Conference on Blockchain (Blockchain). IEEE, Los Alamitos, CA, 282–285.Google Scholar
Cross Ref
- [3] . 2002. Hashcash: A Denial of Service Counter-Measure. Retrieved February 21, 2023 from http://hashcash.org/papers/hashcash.pdf.Google Scholar
- [4] . 1999. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI’99). 173–186.Google Scholar
- [5] . 2002. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems 20, 4 (2002), 398–461.Google Scholar
Digital Library
- [6] . 2015. Centrally banked cryptocurrencies. arXiv preprint arXiv:1505.06895 (2015).Google Scholar
- [7] . 2003. On memory-bound functions for fighting spam. In Proceedings of the Annual International Cryptology Conference. 426–444.Google Scholar
Cross Ref
- [8] . 2003. Efficient player-optimal protocols for strong and differential consensus. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC’03). ACM, New York, NY, 211–220.
DOI: Google ScholarDigital Library
- [9] . 1993. Fully polynomial Byzantine agreement in t + 1 rounds. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing. 31–41.Google Scholar
Digital Library
- [10] . 2011. Invertible Bloom lookup tables. In Proceedings of the 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton’11). IEEE, Los Alamitos, CA, 792–799.Google Scholar
Cross Ref
- [11] . 2006. On expected constant-round protocols for Byzantine agreement. In Proceedings of the Annual International Cryptology Conference. 445–462.Google Scholar
Digital Library
- [12] . 2018. Omniledger: A secure, scale-out, decentralized ledger via sharding. In Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP’18). IEEE, Los Alamitos, CA, 583–598.Google Scholar
Cross Ref
- [13] . 2000. OceanStore: An architecture for global-scale persistent storage. ACM SIGPLAN Notices 35, 11 (
Nov. 2000), 190–201.DOI: Google ScholarDigital Library
- [14] . 1998. The part-time parliament. ACM Transactions on Computer Systems 16, 2 (
May 1998), 133–169.DOI: Google ScholarDigital Library
- [15] . 2004. Secure untrusted data repository (SUNDR). In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI’04). 1–9.Google Scholar
- [16] . 2018. Combining asynchronous and synchronous Byzantine agreement: The best of both worlds. Cryptology ePrint Archive, Report 2018/235. https://eprint.iacr.org/2018/235.Google Scholar
- [17] . 2016. A secure sharding protocol for open blockchains. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, New York, NY, 17–30.Google Scholar
Digital Library
- [18] . 1983. A second look at Bloom filters. Communications of the ACM 26, 8 (1983), 570–571.Google Scholar
Digital Library
- [19] . 1994. Distributed consensus revisited. Information Processing Letters 49, 4 (1994), 195–201.Google Scholar
Digital Library
- [20] . 2017. Graphene: A new protocol for block propagation using set reconciliation. In Data Privacy Management, Cryptocurrencies and Blockchain Technology. Springer, 420–428.Google Scholar
- [21] . 2017. Practical synchronous Byzantine consensus. arXiv preprint arXiv:1704.02397 (2017).Google Scholar
- [22] . 2001. BASE: Using abstraction to improve fault tolerance. ACM SIGOPS Operating Systems Review 35, 5 (2001), 15–28.Google Scholar
Digital Library
- [23] . 2021. Blockchain without waste: Proof-of-stake. Review of Financial Studies 34, 3 (2021), 1156–1190.Google Scholar
- [24] . 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22, 4 (1990), 299–319.Google Scholar
Digital Library
- [25] . 2019. Replay attacks and defenses against cross-shard consensus in sharded distributed ledgers. arXiv preprint arXiv:1901.11218 (2019).Google Scholar
- [26] . 2019. Guaranteed-TX: The Exploration of a Guaranteed Cross-Shard Transaction Execution Protocol for Ethereum 2.0.Master’s Thesis. University of Twente.Google Scholar
- [27] . MWPoW: Multiple Winners Proof of Work Protocol, a decentralisation strengthened fast-confirm blockchain protocol. Security and Communication Networks 2019 (2019), Article 3674274.Google Scholar
Digital Library
- [28] . 2020. An n/2 Byzantine node tolerate blockchain sharding approach. In Proceedings of the 35th Annual ACM Symposium on Applied Computing (SAC’20). ACM, New York, NY, 349–352.
DOI: Google ScholarDigital Library
- [29] . 2020. A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol. Concurrency and Computation: Practice and Experience 32, 19 (2020), e5773.Google Scholar
- [30] . 2022. Poster: Unanimous-majority—Pushing blockchain sharding throughput to its limit. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (CCS’22). ACM, New York, NY, 3495–3497.
DOI: Google ScholarDigital Library
- [31] . 2018. RapidChain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, New York, NY, 931–948.Google Scholar
Digital Library
Index Terms
MWPoW+: A Strong Consensus Protocol for Intra-Shard Consensus in Blockchain Sharding
Recommendations
Blockchain Consensus Mechanisms and Their Applications in IoT: A Literature Survey
Algorithms and Architectures for Parallel ProcessingAbstractWith the advance of blockchain technology, blockchain has been used in many fields. As a point-to-point network with characteristics of traceability, decentralization, de-trust and so on, blockchain technology is suitable for deploying Internet of ...
DCCP: a dependable committee consensus protocol for permissionless blockchain
AbstractThe consensus protocol is the core of blockchain systems. The existing hybrid committee-based consensus protocol is one of the important ways to improve the permissionless blockchain system. But the presence of malicious nodes, it can interfere ...
Overview of Blockchain Consensus Mechanism
BDE 2020: Proceedings of the 2020 2nd International Conference on Big Data EngineeringThe advent of the Bitcoin system has brought another boom in the Internet era. In a very short time, many Blockchain systems come into being successively, whose decentration, consensus mechanisms, intelligent contract, and other characteristics make ...






Comments