Abstract
One most potential solution to enhancing the performance of the Nakamoto consensus is to utilize the classic Byzantine fault-tolerant protocol running by a rolling committee. However, this hybrid consensus method still faces some challenges. One is that many hybrid consensus schemes use the Nakamoto single-chain, resulting in low throughput and poor scalability. The other is that the committee’s internal consensus process has to be interrupted when the committee rotates. To address these challenges, we propose Grape, an efficient hybrid consensus protocol using the Directed Acyclic Graph structure. We prove that Grape is secure when the adversary’s ratio of the mining power is less than 1/3. To demonstrate the feasibility of Grape, we implement a prototype and make the experimental evaluation. The result shows that Grape achieves high transaction throughput with instant confirmation.
This work is supported by the National Natural Science Foundation of China (No. 61872142, 62072305), the Key Research and Development Plan of Shandong Province (No. 2021CXGC010105), and the Open Project of Shanghai Key Laboratory of Trustworthy Computing under grant No. OP202205.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that based on the security of the underlying BFT consensus, a leader in the committee who tries to stay longer by not including any identity blocks will always be found by other members and be replaced after a view-change phase.
References
Abraham, I., Malkhi, D., Nayak, K., Ren, L., Spiegelman, A.: Solida: a blockchain protocol based on reconfigurable byzantine consensus. arXiv preprint arXiv:1612.02916 (2016)
Bagaria, V., Kannan, S., Tse, D., Fanti, G., Viswanath, P.: Prism: deconstructing the blockchain to approach physical limits. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 585–602 (2019)
Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. OSDI 99, 173–186 (1999)
Decker, C., Seidel, J., Wattenhofer, R.: Bitcoin meets strong consistency. In: Proceedings of the 17th International Conference on Distributed Computing and Networking, pp. 1–10 (2016)
Eyal, I., Gencer, A.E., Sirer, E.G., Van Renesse, R.: Bitcoin-NG: a scalable blockchain protocol. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2016), pp. 45–59 (2016)
Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. In: International Conference on Financial Cryptography and Data Security, pp. 436–454. Springer (2014)
Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281–310. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46803-6_10
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: USENIX, pp. 279–296 (2016)
Li, C., et al.: A decentralized blockchain with high throughput and fast confirmation. In: USENIX ATC 2020, pp. 515–528 (2020)
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Technical report, Manubot (2019)
Natoli, C., Gramoli, V.: The balance attack against proof-of-work blockchains: the R3 testbed as an example. arXiv preprint arXiv:1612.09426 (2016)
Andy, P.: Fast and lightweight networking framework in go (2019)
Pass, R., Shi, E.: Fruitchains: a fair blockchain. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 315–324 (2017)
Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: DISC (2017)
Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3–33. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78375-8_1
Popov, S.Y.: The tangle (2015)
Pike, R.: The go programming language. Talk given at Google’s Tech Talks (2009)
Mitsunari, S., Moritz, F.: BLS with compiled static library
Sompolinsky, Y., Lewenberg, Y., Zohar, A.: Spectre: a fast and scalable cryptocurrency protocol. IACR Cryptol. ePrint Arch. 2016, 1159 (2016)
Sompolinsky, Y., Zohar, A.: Secure high-rate transaction processing in bitcoin. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 507–527. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47854-7_32
Sompolinsky, Y., Zohar, A.: Phantom: A scalable blockdag protocol. IACR Cryptol. ePrint Arch. 2018, 104 (2018)
Wang, Q., Yu, J., Chen, S., Xiang, Y.: SoK: diving into DAG-based blockchain systems. arXiv preprint arXiv:2012.06128 (2020)
Xiang, F., Huaimin, W., Peichang, S., Xue, O., Xunhui, Z.: Jointgraph: a DAG-based efficient consensus algorithm for consortium blockchains. Softw. Pract. Exp. 51(10), 1987–1999 (2021)
Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347–356 (2019)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Song, Y., Fan, G., Long, Y., Liu, Z., Xu, X., Gu, D. (2023). Grape: Efficient Hybrid Consensus Protocol Using DAG. In: Garcia-Alfaro, J., Navarro-Arribas, G., Dragoni, N. (eds) Data Privacy Management, Cryptocurrencies and Blockchain Technology. DPM CBT 2022 2022. Lecture Notes in Computer Science, vol 13619. Springer, Cham. https://doi.org/10.1007/978-3-031-25734-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-25734-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25733-9
Online ISBN: 978-3-031-25734-6
eBook Packages: Computer ScienceComputer Science (R0)