2000 character limit reached
TRAIL: Cross-Shard Validation for Cryptocurrency Byzantine Shard Protection
Published 12 May 2024 in cs.DC | (2405.07146v1)
Abstract: We present TRAIL: an algorithm that uses a novel consensus procedure to tolerate failed or malicious shards within a blockchain-based cryptocurrency. Our algorithm takes a new approach of selecting validator shards for each transaction from those that previously held the assets being transferred. This approach ensures the algorithm's robustness and efficiency. TRAIL is presented using PBFT for internal shard transaction processing and a modified version of PBFT for external cross-shard validation. We describe TRAIL, prove it correct, analyze its message complexity, and evaluate its performance. We propose various TRAIL optimizations: we describe how it can be adapted to other Byzantine-tolerant consensus algorithms, how a complete system may be built on the basis of it, and how TRAIL can be applied to existing and future sharded blockchains.
- S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,”,” 2008.
- G. Wood, “Ethereum: A secure decentralized generalized transaction ledger,” Ethereum project yellow paper, vol. 151, pp. 1–32, 2014.
- L. LAMPORT, R. SHOSTAK, and M. PEASE, “The byzantine generals problem,” ACM Transactions on Programming Languages and Systems, vol. 4, no. 3, pp. 382–401, 1982.
- M. Wendl, M. H. Doan, and R. Sassen, “The environmental impact of cryptocurrencies using proof of work and proof of stake consensus algorithms: A systematic review,” Journal of Environmental Management, vol. 326, p. 116530, 2023.
- M. Castro and B. Liskov, “Practical byzantine fault tolerance and proactive recovery,” ACM Trans. Comput. Syst., vol. 20, no. 4, pp. 398–461, Nov. 2002. [Online]. Available: http://doi.acm.org/10.1145/571637.571640
- T. D. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” Journal of the ACM (JACM), vol. 43, no. 2, pp. 225–267, 1996.
- T. D. Chandra, V. Hadzilacos, and S. Toueg, “The weakest failure detector for solving consensus,” Journal of the ACM (JACM), vol. 43, no. 4, pp. 685–722, 1996.
- Q. Bramas, D. Foreback, M. Nesterenko, and S. Tixeuil, “Packet efficient implementation of the omega failure detector,” Theory of Computing Systems, vol. 63, pp. 237–260, 2019.
- A. Doudou and A. Schiper, “Muteness detectors for consensus with byzantine processes,” in Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, 1998, p. 315.
- K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith, “Byzantine fault detectors for solving consensus,” The Computer Journal, vol. 46, no. 1, pp. 16–35, 2003.
- R. Baldoni, J.-M. Hélary, M. Raynal, and L. Tangui, “Consensus in byzantine asynchronous systems,” Journal of Discrete Algorithms, vol. 1, no. 2, pp. 185–210, 2003.
- J. Oglio, K. Hood, M. Nesterenko, and S. Tixeuil, “Quantas: quantitative user-friendly adaptable networked things abstract simulator,” in Proceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, 2022, pp. 40–46.
- B. Shoshany, “A C++17 Thread Pool for High-Performance Scientific Computing,” arXiv e-prints, May 2021.
- “Trail implementation in quantas,” https://github.com/QuantasSupport/Quantas/tree/54ca5de9d556338d1281f85317fb555afd2171fb/quantas/TrailPeer, Aug. 2023.
- “Trail perfromance evaluation data,” http://www.cs.kent.edu/~mikhail/Research/trail.output.tar.gz, Aug. 2023.
- G. Danezis and S. Meiklejohn, “Centrally banked cryptocurrencies,” in 23rd Annual Network and Distributed System Security Symposium (NDSS), 2016.
- E. Kokoris-Kogias, P. Jovanovic, L. Gasser, N. Gailly, E. Syta, and B. Ford, “Omniledger: A secure, scale-out, decentralized ledger via sharding.” IEEE, 5 2018. [Online]. Available: http://dx.doi.org/10.1109/SP.2018.000-5
- M. Zamani, M. Movahedi, and M. Raykova, “Rapidchain.” ACM, 10 2018. [Online]. Available: http://dx.doi.org/10.1145/3243734.3243853
- A. Manuskin, M. Mirkin, and I. Eyal, “Ostraka: Secure blockchain scaling by node sharding,” in 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW). IEEE, 2020, pp. 397–406.
- A. Sonnino, “Chainspace: A sharded smart contract platform,” in Network and Distributed System Security Symposium 2018 (NDSS 2018), 2018.
- L. Luu, V. Narayanan, C. Zheng, K. Baweja, S. Gilbert, and P. Saxena, “A secure sharding protocol for open blockchains,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, 2016, pp. 17–30.
- Y. Li, J. Wang, and H. Zhang, “A survey of state-of-the-art sharding blockchains: Models, components, and attack surfaces,” Journal of Network and Computer Applications, p. 103686, 2023.
- B. Awerbuch and C. Scheideler, “Towards a scalable and robust dht,” in Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006, pp. 318–327.
- S. Sen and M. J. Freedman, “Commensal cuckoo: Secure group partitioning for large-scale services,” ACM SIGOPS Operating Systems Review, vol. 46, no. 1, pp. 33–39, 2012.
- X. Wang, S. Duan, J. Clavin, and H. Zhang, “Bft in blockchains: From protocols to use cases,” ACM Computing Surveys (CSUR), vol. 54, no. 10s, pp. 1–37, 2022.
- C. Stathakopoulou, D. Tudor, M. Pavlovic, and M. Vukolić, “Mir-bft: Scalable and robust bft for decentralized networks,” Journal of Systems Research, vol. 2, no. 1, 2022.
- S. Alqahtani and M. Demirbas, “Bigbft: A multileader byzantine fault tolerance protocol for high throughput,” in 2021 IEEE International Performance, Computing, and Communications Conference (IPCCC). IEEE, 2021, pp. 1–10.
- S. Gupta, J. Hellings, and M. Sadoghi, “Rcc: resilient concurrent consensus for high-throughput secure transaction processing,” in 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 2021, pp. 1392–1403.
- M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie, “Fault-scalable byzantine fault-tolerant services,” ACM SIGOPS Operating Systems Review, vol. 39, no. 5, pp. 59–74, 2005.
- J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira, “Hq replication: A hybrid quorum protocol for byzantine fault tolerance,” in Proceedings of the 7th symposium on Operating systems design and implementation, 2006, pp. 177–190.
- R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong, “Zyzzyva: speculative byzantine fault tolerance,” in Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, 2007, pp. 45–58.
- G. G. Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. Reiter, D.-A. Seredinschi, O. Tamir, and A. Tomescu, “Sbft: A scalable and decentralized trust infrastructure,” in 2019 49th Annual IEEE/IFIP international conference on dependable systems and networks (DSN). IEEE, 2019, pp. 568–580.
- M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham, “Hotstuff: Bft consensus with linearity and responsiveness,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019, pp. 347–356.
- K. Hood, J. Oglio, M. Nesterenko, and G. Sharma, “Partitionable asynchronous cryptocurrency blockchain,” in 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC). IEEE, 2021, pp. 1–9.
- R. Bricker, M. Nesterenko, and G. Sharma, “Blockchain in dynamic networks,” in International Symposium on Stabilizing, Safety, and Security of Distributed Systems, 2022, pp. 114–129.
Paper Prompts
Sign up for free to create and run prompts on this paper.