Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3341105.3374069acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

An n/2 byzantine node tolerate blockchain sharding approach

Published: 30 March 2020 Publication History

Abstract

Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hyper-geometric distribution to make a failure (an adversary does not have n/3 of nodes globally but can manipulate the consensus of a Shard) hard to happen. The system must maintain a large Shard size (the number of nodes inside a Shard) to sustain the low failure probability so that only a small number of Shards may exist. In this paper, we present a new approach of Blockchain Sharding that can withstand up to n/2 of nodes being bad. We categorise the nodes into different classes, and every Shard has a fixed number of nodes from different classes. We prove that this design is much more secure than the traditional models (only have one class) and the Shard size can be reduced significantly. In this way, many more Shards can exist, and the transaction throughput can be largely increased. The improved Blockchain Sharding approach is promising to serve as the foundation for decentralised autonomous organisations and decentralised database.

References

[1]
James C Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, Jeffrey John Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, et al. Spanner: Google's globally distributed database. ACM Transactions on Computer Systems (TOCS), 31(3):8, 2013.
[2]
Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, Seth Gilbert, and Prateek Saxena. A secure sharding protocol for open blockchains. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pages 17--30. ACM, 2016.
[3]
George Danezis and Sarah Meiklejohn. Centrally banked cryptocurrencies. arXiv preprint arXiv:1505.06895, 2015.
[4]
Eleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, Ewa Syta, and Bryan Ford. Omniledger: A secure, scale-out, decentralized ledger via sharding. In 2018 IEEE Symposium on Security and Privacy (SP), pages 583--598. IEEE, 2018.
[5]
Mahdi Zamani, Mahnush Movahedi, and Mariana Raykova. Rapidchain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 931--948. ACM, 2018.
[6]
Hisao Ishibuchi, Ken Nozaki, and Hideo Tanaka. Distributed representation of fuzzy rules and its application to pattern classification. Fuzzy sets and systems, 52(1):21--32, 1992.
[7]
Roy Friedman. Fuzzy group membership. In Future Directions in Distributed Computing, pages 114--118. Springer, 2003.
[8]
Rafael Pass and Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model. In 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
[9]
Ioannis Psaras. Decentralised edge-computing and iot through distributed trust. In Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services, pages 505--507. ACM, 2018.
[10]
Andreas Bogner, Mathieu Chanson, and Arne Meeuw. A decentralised sharing app running a smart contract on the ethereum blockchain. In Proceedings of the 6th International Conference on the Internet of Things, pages 177--178. ACM, 2016.
[11]
Jozef Mocnej, Winston KG Seah, Adrian Pekar, and Iveta Zolotova. Decentralised iot architecture for efficient resources utilisation. IFAC-PapersOnLine, 51(6):168--173, 2018.

Cited By

View all
  • (2023)Securing Data Exchange in the Convergence of Metaverse and IoT ApplicationsProceedings of the 18th International Conference on Availability, Reliability and Security10.1145/3600160.3605019(1-8)Online publication date: 29-Aug-2023
  • (2023)MWPoW+: A Strong Consensus Protocol for Intra-Shard Consensus in Blockchain ShardingACM Transactions on Internet Technology10.1145/358402023:2(1-27)Online publication date: 18-May-2023
  • (2023)Blockchain Segmentation: A Storage Optimization Technique for Large Data2023 8th International Conference on Communication and Electronics Systems (ICCES)10.1109/ICCES57224.2023.10192631(499-504)Online publication date: 1-Jun-2023
  • Show More Cited By

Index Terms

  1. An n/2 byzantine node tolerate blockchain sharding approach
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied Computing
    March 2020
    2348 pages
    ISBN:9781450368667
    DOI:10.1145/3341105
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 March 2020

    Check for updates

    Author Tags

    1. PBFT
    2. blockchain
    3. blockchain sharding
    4. decentralised ledger

    Qualifiers

    • Poster

    Conference

    SAC '20
    Sponsor:
    SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing
    March 30 - April 3, 2020
    Brno, Czech Republic

    Acceptance Rates

    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)12
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 09 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Securing Data Exchange in the Convergence of Metaverse and IoT ApplicationsProceedings of the 18th International Conference on Availability, Reliability and Security10.1145/3600160.3605019(1-8)Online publication date: 29-Aug-2023
    • (2023)MWPoW+: A Strong Consensus Protocol for Intra-Shard Consensus in Blockchain ShardingACM Transactions on Internet Technology10.1145/358402023:2(1-27)Online publication date: 18-May-2023
    • (2023)Blockchain Segmentation: A Storage Optimization Technique for Large Data2023 8th International Conference on Communication and Electronics Systems (ICCES)10.1109/ICCES57224.2023.10192631(499-504)Online publication date: 1-Jun-2023
    • (2023)Blockchain Scalability FundamentalsBlockchain Scalability10.1007/978-981-99-1059-5_1(1-49)Online publication date: 27-Feb-2023
    • (2022)Recent Advances of Blockchain and Its ApplicationsJournal of Social Computing10.23919/JSC.2022.00163:4(363-394)Online publication date: Dec-2022
    • (2022)A Mechanism to Maintain Node Integrity in Decentralised SystemsBig Data Privacy and Security in Smart Cities10.1007/978-3-031-04424-3_4(73-81)Online publication date: 9-Sep-2022
    • (2021)BlockTree: a nonlinear structured, scalable and distributed ledger scheme for processing digital transactionsCluster Computing10.1007/s10586-021-03366-524:4(3751-3765)Online publication date: 1-Dec-2021
    • (2020)Anchoring the Value of Cryptocurrency2020 IEEE International Workshop on Blockchain Oriented Software Engineering (IWBOSE)10.1109/IWBOSE50093.2020.9050264(30-36)Online publication date: Feb-2020
    • (2020)A Secure Storage Strategy for Blockchain Based on MCMC AlgorithmIEEE Access10.1109/ACCESS.2020.30208368(160815-160824)Online publication date: 2020
    • (2020)Segment Blockchain: A Size Reduced Storage Mechanism for BlockchainIEEE Access10.1109/ACCESS.2020.29664648(17434-17441)Online publication date: 2020
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media