Abstract
As a decentralized database, the public blockchain has broad application prospects in many fields such as finance, healthcare, and supply chain, so it is getting more and more attention. The current mainstream public blockchain protocol based on Proof of Work (PoW) cannot be applied to various extendable application scenarios with performance requirements due to performance bottlenecks. Proof of Stake (PoS) circumvents the performance bottleneck of PoW by utilizing equity instead of computing power. However, ordinary PoS protocols still have security problems for they are vulnerable to nothing-at-stake attacks, and rely on third parties to support dynamic availability. In this paper, we propose a novel scalable and secure PoS consensus scheme to support the application of public blockchain in various extendable scenarios. We classify nodes in different states and perform node state transitions through different protocols. Combining stake mechanism with consensus schemes and using dynamic stake proportion table to support dynamic stake scenario, we propose a block compression method to reduce the communication consumption of consensus. We propose a chain selection rule based on Verifiable Random Function (VRF) nonce and longest chain rule, which supports dynamic availability without third parties. In addition, we prove the security of our scheme and analyze its performance at general security threats. Finally, experimental results show that our scheme have better system performance and better scalability under the same condition.
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
References
Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2009). https://bitcoin.org/bitcoin.pdf
Quantum Mechanic. Proof of Stake (2011). https://bitcointalk.org/index.php?topic=27787.0
Gilad, Y., Hemo, R., Micali, S., et al.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 51–68. ACM (2017). https://doi.org/10.1145/3132747.3132757
Brown-Cohen, J., Narayanan, A., Psomas, A., et al.: Formal barriers to longest-chain proof-of-stake protocols. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 459–473 (2019). https://doi.org/10.1145/3328526.3329567
Bentov, I., Pass, R., Shi, E.: Snow white: provably secure proofs of stake. IACR Cryptology ePrint Archive 2016:919 (2016)
Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357–388. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63688-7_12
David, B., Gaži, P., Kiayias, A., Russell, A.: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66–98. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78375-8_3
Badertscher, C., Gaži, P., Kiayias, A., et al.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 913–930 (2018). https://doi.org/10.1145/3243734.3243848
Fan, L., Zhou, H.S.: A scalable proof-of-stake blockchain in the open setting (or, how to mimic Nakamoto’s design via proof-of-stake). Cryptology ePrint Archive, Report 2017/656 (2017). Version 20180425:201821
Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), pp. 120–130. IEEE (1999). https://doi.org/10.1109/SFFCS.1999.814584
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982). https://doi.org/10.1145/3335772.3335936
Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431–448. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48405-1_28
Kiayias, A., Panagiotakos, G.: Speed-security tradeoffs in blockchain protocols. IACR Cryptology ePrint Archive 2015:1019 (2015)
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
Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 643–673. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-56614-6_22
Gervais, A., Karame, G.O., Wüst, K., et al.: On the security and performance of proof of work blockchains. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 3–16. ACM (2016). https://doi.org/10.1145/2976749.2978341
Bagaria, V., Dembo, A., Kannan, S., et al.: Proof-of-stake longest chain protocols: security vs predictability. arXiv preprint arXiv:1910.02218 (2019)
Bano, S., Baudet, M., Ching, A., et al.: State machine replication in the Libra Blockchain (2020). https://developers.libra.org/docs/state-machine-replication-paper. (Consulted on December 19, 2020)
Liu, L., Feng, J., Pei, Q., et al.: Blockchain-enabled secure data sharing scheme in mobile edge computing: an asynchronous advantage actor-critic learning approach. IEEE Internet Things J. 8(4), 2342–2353 (2021). https://doi.org/10.1109/JIOT.2020.3048345
Feng, J., Yu, F.R., Pei, Q., et al.: Cooperative computation offloading and resource allocation for blockchain-enabled mobile-edge computing: a deep reinforcement learning approach. IEEE Internet Things J. 7(7), 6214–6228 (2020). https://doi.org/10.1109/JIOT.2019.2961707
Acknowledgments
This work is supported by the National Key Research and Development Program of China (2020YFB1807500), in part by Guangdong Basic and Applied Basic Research Foundation (2020A1515110496, 2020A1515110079).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhu, F., Yin, J., Liu, L., Feng, J., Wang, Z. (2021). A Scalable and Secure Consensus Scheme Based on Proof of Stake in Blockchain. In: Dai, HN., Liu, X., Luo, D.X., Xiao, J., Chen, X. (eds) Blockchain and Trustworthy Systems. BlockSys 2021. Communications in Computer and Information Science, vol 1490. Springer, Singapore. https://doi.org/10.1007/978-981-16-7993-3_22
Download citation
DOI: https://doi.org/10.1007/978-981-16-7993-3_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-7992-6
Online ISBN: 978-981-16-7993-3
eBook Packages: Computer ScienceComputer Science (R0)