Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead (2403.03655v3)

Published 6 Mar 2024 in cs.CR

Abstract: Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. As an introduced new transaction type, cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. Currently, there is a lack of a generic sharding consensus pattern that achieves both security and low overhead. In this paper, we present Kronos, a secure sharding blockchain consensus achieving optimized overhead. In particular, we propose a new secure sharding consensus pattern, based on a buffer managed jointly by shard members. Valid transactions are transferred to the payee via the buffer, while invalid ones are rejected through happy or unhappy paths. Kronos is proved to achieve security with atomicity under malicious clients with optimal intra-shard overhead $kB$ ($k$ for involved shard number and $B$ for a Byzantine fault tolerance (BFT) cost). Besides, we propose secure cross-shard certification methods based on batch certification and reliable cross-shard transfer. The former combines hybrid trees or vector commitments, while the latter integrates erasure coding. Handling $b$ transactions, Kronos is proved to achieve reliability with low cross-shard overhead $O(n b \lambda)$ ($n$ for shard size and $\lambda$ for the security parameter). Notably, Kronos imposes no restrictions on BFT and does not rely on time assumptions, offering optional constructions in various modules. We implement Kronos using two prominent BFT protocols: asynchronous Speeding Dumbo and partial synchronous Hotstuff. Extensive experiments demonstrate Kronos scales the consensus nodes to thousands, achieving a substantial throughput of 320 ktx/sec with 2.0 sec latency. Compared with the past solutions, Kronos outperforms, achieving up to a 12* improvement in throughput and a 50% reduction in latency.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (55)
  1. I. Abraham, P. Jovanovic, M. Maller et al., “Reaching consensus for asynchronous distributed key generation,” in PODC’21.   ACM, 2021, pp. 363–373.
  2. I. Abraham, D. Malkhi, K. Nayak, L. Ren, and M. Yin, “Sync hotstuff: Simple and practical synchronous state machine replication,” in SP’20.   IEEE, 2020, pp. 106–118.
  3. M. Al-Bassam, A. Sonnino, S. Bano et al., “Chainspace: A sharded smart contracts platform,” in NDSS’18.   ISOC, 2018.
  4. G. Almashaqbeh and R. Solomon, “Sok: Privacy-preserving computing in the blockchain era,” in EuroS&P’22.   IEEE, 2022, pp. 124–139.
  5. M. J. Amiri, D. Agrawal, and A. El Abbadi, “Sharper: Sharding permissioned blockchains over network clusters,” in SIGMOD’21.   ACM, 2021, pp. 76–88.
  6. Z. Avarikioti, A. Desjardins, L. Kokoris-Kogias, and R. Wattenhofer, “Divide & scale: Formalization and roadmap to robust sharding,” in Structural Information and Communication Complexity.   Springer Nature Switzerland, 2023, pp. 199–245.
  7. F. Benhamouda, S. Halevi, H. Krawczyk et al., “Threshold cryptography as a service (in the multiserver and yoso models),” in CCS’22.   ACM, 2022, pp. 323–336.
  8. D. Boneh, M. Drijvers, and G. Neven, “Compact multi-signatures for smaller blockchains,” in ASIACRYPT’18.   Springer, 2018, pp. 435–464.
  9. D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the weil pairing,” Journal of cryptology, vol. 17, pp. 297–319, 2004.
  10. M. Castro, B. Liskov et al., “Practical byzantine fault tolerance,” in OsDI’99.   USENIX Association, 1999, pp. 173–186.
  11. A. Clement, E. Wong, L. Alvisi, M. Dahlin, M. Marchetti et al., “Making byzantine fault tolerant systems tolerate byzantine faults,” in USENIX Security’09.   The USENIX Association, 2009.
  12. H. Dang, T. T. A. Dinh, D. Loghin et al., “Towards scaling blockchain systems via sharding,” in SIGMOD’19.   ACM, 2019, pp. 123–140.
  13. S. Das, V. Krishnan, and L. Ren, “Efficient cross-shard transaction execution in sharded blockchains,” arXiv preprint arXiv:2007.14521, 2020.
  14. S. Das, T. Yurek, Z. Xiang et al., “Practical asynchronous distributed key generation,” in SP’22.   IEEE, 2022, pp. 2518–2534.
  15. B. David, B. Magri, C. Matt et al., “Gearbox: Optimal-size shard committees by leveraging the safety-liveness dichotomy,” in CCS’22.   ACM, 2022, pp. 683–696.
  16. S. Duan, S. Peisert, and K. N. Levitt, “hbft: speculative byzantine fault tolerance with minimum cost,” IEEE Trans. Dependable Secur. Comput., vol. 12, no. 1, pp. 58–70, 2014.
  17. S. Duan, M. K. Reiter, and H. Zhang, “Beat: Asynchronous bft made practical,” in CCS’18.   ACM, 2018, pp. 2028–2041.
  18. S. Duan, X. Wang, and H. Zhang, “Fin: Practical signature-free asynchronous common subset in constant time,” in CCS’23.   ACM, 2023, pp. 815–829.
  19. M. J. Fischer, N. A. Lynch, and M. S. Paterson, “Impossibility of distributed consensus with one faulty process,” JACM, vol. 32, no. 2, pp. 374–382, 1985.
  20. M. Fitzi, P. Ga, A. Kiayias, and A. Russell, “Parallel chains: Improving throughput and latency of blockchain protocols via parallel composition,” 2018, https://eprint.iacr.org/2018/1119.pdf.
  21. Y. Gao, Y. Lu, Z. Lu et al., “Dumbo-ng: Fast asynchronous bft consensus with throughput-oblivious latency,” in CCS’22.   ACM, 2022, pp. 1187–1201.
  22. B. Guo, Y. Lu, Z. Lu, Q. Tang, J. Xu, and Z. Zhang, “Speeding dumbo: Pushing asynchronous BFT closer to practice,” in NDSS’22.   ISOC, 2022.
  23. B. Guo, Z. Lu, Q. Tang et al., “Dumbo: Faster asynchronous bft protocols,” in CCS’20.   ACM, 2020, pp. 803–818.
  24. J. Hellings and M. Sadoghi, “Byshard: sharding in a byzantine environment,” VLDB J., vol. 32, no. 6, pp. 1343–1367, 2023.
  25. Z. Hong, S. Guo, and P. Li, “Scaling blockchain via layered sharding,” IEEE J. Sel. Areas Commun., vol. 40, no. 12, pp. 3575–3588, 2022.
  26. Z. Hong, S. Guo, P. Li, and W. Chen, “Pyramid: A layered sharding blockchain system,” in INFOCOM’21.   IEEE, 2021, pp. 1–10.
  27. H. Huang, X. Peng, J. Zhan et al., “Brokerchain: A cross-shard blockchain protocol for account/balance-based state sharding,” in INFOCOM’22.   IEEE, 2022, pp. 1968–1977.
  28. T. Huynh-The, T. R. Gadekallu, W. Wang et al., “Blockchain for the metaverse: A review,” Futur. Gener. Comp. Syst., 2023.
  29. S. Jiang, J. Cao, C. L. Tung, Y. Wang, and S. Wang, “Sharon: Secure and efficient cross-shard transaction processing via shard rotation,” 2024.
  30. R. Kapitza, J. Behl, C. Cachin, T. Distler, S. Kuhnle, S. V. Mohammadi, W. Schröder-Preikschat, and K. Stengel, “Cheapbft: Resource-efficient byzantine fault tolerance,” in CCS’12.   ACM, 2012, pp. 295–308.
  31. A. K. Kasgar, J. Agrawal, and S. Shahu, “New modified 256-bit md 5 algorithm with sha compression function,” Int. J. Comput. Appl. Technol., vol. 42, no. 12, 2012.
  32. E. Kokoris-Kogias, P. Jovanovic, L. Gasser et al., “Omniledger: A secure, scale-out, decentralized ledger via sharding,” in SP’18.   IEEE, 2018, pp. 583–598.
  33. Y. Lin, Z. Gao, H. Du et al., “A unified blockchain-semantic framework for wireless edge intelligence enabled web 3.0,” IEEE Wirel. Commun., vol. 31, no. 2, pp. 126–133, 2024.
  34. Y. Liu, J. Liu, M. A. V. Salles et al., “Building blocks of sharding blockchain systems: Concepts, approaches, and open problems,” Comput. Sci. Rev., vol. 46, p. 100513, 2022.
  35. Y. Liu, J. Liu, Q. Wu et al., “SSHC: A secure and scalable hybrid consensus protocol for sharding blockchains with a formal security framework,” IEEE Trans. Dependable Secur. Comput., vol. 19, no. 3, pp. 2070–2088, 2020.
  36. Y. Liu, X. Xing, H. Cheng et al., “A flexible sharding blockchain protocol based on cross-shard byzantine fault tolerance,” IEEE Trans. Inf. Forensics Secur., vol. 18, pp. 2276–2291, 2023.
  37. Y. Lu, Z. Lu, and Q. Tang, “Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft,” in CCS’22.   ACM, 2022, pp. 2159–2173.
  38. Y. Lu, Z. Lu, Q. Tang, and G. Wang, “Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited,” in PODC’20.   ACM, 2020, pp. 129–138.
  39. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569–584, 2001.
  40. L. Luu, V. Narayanan, C. Zheng et al., “A secure sharding protocol for open blockchains,” in CCS’16.   ACM, 2016, pp. 17–30.
  41. Y. Ma, J. Woods, S. Angel, A. Polychroniadou, and T. Rabin, “Flamingo: Multi-round single-server secure aggregation with applications to private federated learning,” in SP’23.   IEEE, 2023, pp. 477–496.
  42. D. Maram, H. Malvai, F. Zhang, N. Jean-Louis, A. Frolov, T. Kell, T. Lobban, C. Moy, A. Juels, and A. Miller, “Candid: Can-do decentralized identity with legacy compatibility, sybil-resistance, and accountability,” in SP’21.   IEEE, 2021, pp. 1348–1366.
  43. A. Miller, Y. Xia, K. Croman et al., “The honey badger of bft protocols,” in CCS’16.   ACM, 2016, pp. 31–42.
  44. S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” Decentralized business review, p. 21260, 2008.
  45. R. Neiheiser, M. Matos, and L. E. T. Rodrigues, “Kauri: Scalable BFT consensus with pipelined tree-based dissemination and aggregation,” in SOSP’21.   ACM, 2021, pp. 35–48.
  46. S. Srinivasan, A. Chepurnoy, C. Papamanthou, A. Tomescu, and Y. Zhang, “Hyperproofs: Aggregating and maintaining proofs in vector commitments,” in USENIX Security’22.   USENIX Association, 2022, pp. 3001–3018.
  47. R. Vassantlal, E. Alchieri, B. Ferreira, and A. Bessani, “Cobra: Dynamic proactive secret sharing for confidential bft services,” in SP’22.   IEEE, 2022, pp. 1335–1353.
  48. J. Wang and H. Wang, “Monoxide: Scale out blockchains with asynchronous consensus zones,” in NSDI’19, vol. 2019, 2019, pp. 95–112.
  49. Y. Xu, J. Zheng, B. Düdder, T. Slaats, and Y. Zhou, “A two-layer blockchain sharding protocol leveraging safety and liveness for enhanced performance,” in NDSS’24.   ISOC, 2024.
  50. M. Yin, D. Malkhi, M. K. Reiter et al., “Hotstuff: Bft consensus with linearity and responsiveness,” in PODC’19.   ACM, 2019, pp. 347–356.
  51. T. Yurek, Z. Xiang, Y. Xia, and A. Miller, “Long live the honey badger: Robust asynchronous DPSS and its applications,” in USENIX Security’23.   USENIX Association, 2023, pp. 5413–5430.
  52. M. Zamani, M. Movahedi, and M. Raykova, “Rapidchain: Scaling blockchain via full sharding,” in CCS’18.   ACM, 2018, pp. 931–948.
  53. J. Zhang, W. Chen, S. Luo, T. Gong et al., “Front-running attack in sharded blockchains and fair cross-shard consensus,” in NDSS’24.   ISOC, 2024.
  54. M. Zhang, J. Li, Z. Chen et al., “An efficient and robust committee structure for sharding blockchain,” IEEE Trans. Cloud Comput., vol. 11, no. 3, pp. 2562–2574, 2023.
  55. P. Zheng, Q. Xu, Z. Zheng et al., “Meepo: Multiple execution environments per organization in sharded consortium blockchain,” IEEE J. Sel. Areas Commun., vol. 40, no. 12, pp. 3562–3574, 2022.

Summary

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

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