Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dynamically Sharded Ledgers on a Distributed Hash Table (2405.14991v1)

Published 23 May 2024 in cs.DC

Abstract: Distributed ledger technology such as blockchain is considered essential for supporting large numbers of micro-transactions in the Machine Economy, which is envisioned to involve billions of connected heterogeneous and decentralized cyber-physical systems. This stresses the need for performance and scalability of distributed ledger technologies. Sharding divides the blockchain network into multiple committees and is a common approach to improve scalability. However, with current sharding approaches, costly cross-shard verification is needed to prevent double-spending. This paper proposes a novel and more scalable distributed ledger method named ScaleGraph that implements dynamic sharding by using routing and logical proximity concepts from distributed hash tables. ScaleGraph addresses cyber security in terms of integrity, availability, and trust, to support frequent micro-transactions between autonomous devices. Benefits of ScaleGraph include a total storage space complexity of O(t), where t is the global number of transactions (assuming a constant replication degree). This space is sharded over n nodes so that each node needs O(t/n) storage, which provides a high level of concurrency and data localization as compared to other delegated consensus proposals. ScaleGraph allows for a dynamic grouping of validators which are selected based on a distance metric. We analyze the consensus requirements in such a dynamic setting and show that a synchronous consensus protocol allows shards to be smaller than an asynchronous one, and likely yields better performance. Moreover, we provide an experimental analysis of security aspects regarding the required size of the consensus groups with ScaleGraph. Our analysis shows that dynamic sharding based on proximity concepts brings attractive scalability properties in general, especially when the fraction of corrupt nodes is small.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Efficient synchronous byzantine consensus. arXiv preprint arXiv:1704.02397, 2017.
  2. Sync hotstuff: Simple and practical synchronous state machine replication. In 2020 IEEE Symposium on Security and Privacy (SP), pages 106–118, 2020.
  3. Distributed scalability tuning for evolutionary sharding optimization with random-equivalent security in permissionless blockchain. Internet of Things, 24:100955, 2023.
  4. On the suitability of blockchain platforms for iot applications: Architectures, security, privacy, and performance. Computer Networks, 191:108005, 2021.
  5. Combining GHOST and casper. March 2020.
  6. Practical byzantine fault tolerance. In Third Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, February 1999. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS.
  7. Xiao Chen. Scaling byzantine fault-tolerant consensus with optimized shading scheme. IEEE Transactions on Industrial Informatics, 2023.
  8. John R Douceur. The sybil attack. In International workshop on peer-to-peer systems, pages 251–260. Springer, 2002.
  9. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288–323, 1988.
  10. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374–382, 1985.
  11. E. Fynn and F. Pedone. Challenges and pitfalls of partitioning blockchains. In 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W), pages 128–133, June 2018.
  12. A survey of layer-two blockchain protocols. J. Netw. Comput. Appl., 209(C), jan 2023.
  13. Sok: Layer-two blockchain protocols. In Financial Cryptography and Data Security: 24th International Conference, FC 2020, Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers 24, pages 201–226. Springer, 2020.
  14. Synchronous, with a chance of partition tolerance. In Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I 39, pages 499–529. Springer, 2019.
  15. New mathematical model to analyze security of sharding-based blockchain protocols. IEEE Access, 7:185447–185457, 2019.
  16. A methodology for a probabilistic security analysis of sharding-based blockchain protocols. In Blockchain and Applications: International Congress, pages 101–109. Springer, 2020.
  17. A novel methodology-based joint hypergeometric distribution to analyze the security of sharded blockchains. IEEE Access, 8:179389–179399, 2020.
  18. Scaling blockchains: A comprehensive survey. IEEE access, 8:125244–125262, 2020.
  19. A tractable probabilistic approach to analyze sybil attacks in sharding-based blockchain protocols. IEEE Transactions on Emerging Topics in Computing, 11(1):126–136, 2022.
  20. The rise of the machines: Conceptualizing the machine economy. In PACIS, page 54, 2021.
  21. On expected constant-round protocols for byzantine agreement. In Annual International Cryptology Conference, pages 445–462. Springer, 2006.
  22. A review of distributed ledger technologies in the machine economy: challenges and opportunities in industry and research. Procedia CIRP, 107:1168–1173, 2022.
  23. A survey of scalability solutions on blockchain. In 2018 International Conference on Information and Communication Technology Convergence (ICTC), pages 1204–1207, Oct 2018.
  24. Omniledger: A secure, scale-out, decentralized ledger via sharding. In 2018 IEEE Symposium on Security and Privacy (SP), pages 583–598, May 2018.
  25. Polyshard: Coded sharding achieves linearly scaling efficiency and security simultaneously. CoRR, abs/1809.10361, 2018.
  26. A survey on blockchain sharding. ISA transactions, 141:30–43, 2023.
  27. Cross-shard transaction processing in sharding blockchains. pages 324–339, 10 2020.
  28. A secure sharding protocol for open blockchains. In Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pages 17–30, 2016.
  29. Kademlia: A peer-to-peer information system based on the xor metric. In Revised Papers from the First International Workshop on Peer-to-Peer Systems, IPTPS ’01, pages 53–65, London, UK, UK, 2002. Springer-Verlag.
  30. The honey badger of bft protocols. In Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pages 31–42, 2016.
  31. Addressing the performance of blockchain by discussing sharding techniques. In 2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), pages 1–9, 2023.
  32. Thunderella: Blockchains with optimistic instant confirmation. In Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part II 37, pages 3–33. Springer, 2018.
  33. Stfm: a blockchain sharding algorithm based on trust field model for heterogeneous internet of things. The Journal of Supercomputing, pages 1–27, 2023.
  34. Feasibility analysis for sybil attacks in shard-based permissionless blockchains. Distributed Ledger Technologies: Research and Practice, 2023.
  35. A scale-out blockchain for value transfer with spontaneous sharding. In 2018 Crypto Valley Conference on Blockchain Technology (CVCBT), pages 1–10, June 2018.
  36. Survey on blockchain-based iot payment and marketplaces. IEEE Access, 10:103411–103437, 2022.
  37. Performance and scalability evaluation of a permissioned blockchain based on the hyperledger fabric, sawtooth and iroha. Computer Science and Information Systems, 19(2):659–678, 2022.
  38. A survey of blockchain consensus protocols. ACM Comput. Surv., 55(13s), jul 2023.
  39. A comparative study on consensus mechanism with security threats and future scopes: Blockchain. Computer Communications, 201:102–115, 2023.
  40. Security analysis of sharding in the blockchain system. In 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pages 1030–1035. IEEE, 2021.
  41. Rapidchain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pages 931–948, 2018.
  42. Rapidchain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS ’18, pages 931–948, New York, NY, USA, 2018. ACM.
  43. Phantasm: Adaptive scalable mining toward stable blockdag. IEEE Transactions on Services Computing, 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets