Skip to main content
SpringerLink
Log in

Design a Proof of Stake Based Directed Acyclic Graph Chain

  • Conference paper
  • First Online:
Frontiers in Cyber Security (FCS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1286))

Included in the following conference series:

Abstract

The concept of blockchain comes from the Bitcoin system where transactions are organized in blocks. However, blocks are not necessary. Researchers have found ways to use a directed acyclic graph (DAG) to build a chain without blocks. Currently, these chains still rely on some kinds of proof of work, which is not environmentally friendly. We here design a DAG chain with a proof of stake for independent nodes in the Internet. We split nodes into two categories. One is client nodes that produce only normal net transactions (NNTs). The other is chain nodes where active chain nodes are selected periodically based on their stakes and aspirations to participate in the chain management. Active chain nodes produce chain transactions (CTs) that may include hashes of NNTs. CTs form the DAG chain, which helps an ordering process of the NNTs. With the ordering ability of transactions from client nodes, the chain naturally supports global state transition. With a brief analysis, we found that the theoretical performance limitation of the chain depends only on the bandwidth and computation power of chain nodes.

Supported by the National Key R&D Program of China (2017YFB0802500), Natural Science Foundation of China (61972429), Natural Science Foundation of Guangdong Province of China (2018A0303130133).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. AlMallohi, I.A.I., Alotaibi, A.S.M., Alghafees, R., Azam, F., Khan, Z.S.: Multivariable based checkpoints to mitigate the long range attack in proof-of-stake based blockchains. In: Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications, HP3C 2019, pp. 118–122. Association for Computing Machinery, New York (2019). https://doi.org/10.1145/3318265.3318289

  2. Andrew, P.: A treatise on altcoins (2016). https://download.wpsoftware.net/bitcoin/alts.pdf. Accessed 1 Feb 2020

  3. Anton, C.: Byteball: a decentralized system for storage and transfer of value (2016). https://obyte.org/Byteball.pdf. Accessed 1 Feb 2020

  4. Badertscher, C., Gai, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: Proceedings of the ACM Conference on Computer and Communications Security, Toronto, ON, Canada, pp. 913–930 (2018). https://doi.org/10.1145/3243734.3243848

  5. Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 142–157. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53357-4_10

    Chapter  Google Scholar 

  6. Daian, P., Pass, R., Shi, E.: Snow White: robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 23–41. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32101-7_2

    Chapter  Google Scholar 

  7. 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

    Chapter  Google Scholar 

  8. Gaži, P., Kiayias, A., Russell, A.: Stake-bleeding attacks on proof-of-stake blockchains. In: 2018 Crypto Valley Conference on Blockchain Technology (CVCBT), pp. 85–92, June 2018. https://doi.org/10.1109/CVCBT.2018.00015

  9. Jing, C., Silvio, M.: Algorand (2017). https://arxiv.org/abs/1607.01341. Accessed 1 Feb 2020

  10. 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

    Chapter  Google Scholar 

  11. Lewenberg, Y., Sompolinsky, Y., Zohar, A.: Inclusive block chain protocols. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 528–547. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47854-7_33

    Chapter  Google Scholar 

  12. Li, C., Li, P., Zhou, D., Xu, W., Long, F., Yao, A.: Scaling Nakamoto consensus to thousands of transactions per second. arXiv, 1805.03870 (2018). https://arxiv.org/abs/1805.03870

  13. Li, W., Andreina, S., Bohli, J.-M., Karame, G.: Securing proof-of-stake blockchain protocols. In: Garcia-Alfaro, J., Navarro-Arribas, G., Hartenstein, H., Herrera-Joancomartí, J. (eds.) ESORICS/DPM/CBT -2017. LNCS, vol. 10436, pp. 297–315. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67816-0_17

    Chapter  Google Scholar 

  14. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf. Accessed 4 Aug 2017

  15. Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 380–409. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70697-9_14

    Chapter  Google Scholar 

  16. Rocket, T.: Snowflake to avalanche: a novel metastable consensus protocol family for cryptocurrencies (2018). https://ipfs.io/ipfs/QmUy4jh5mGNZvLkjies1RWM4YuvJh5o2FYopNPVYwrRVGV

  17. Serguei, P.: The tangle (2015). https://www.semanticscholar.org/. Accessed 1 Feb 2020

  18. Sompolinsky, Y., Lewenberg, Y., Zohar, A.: SPECTRE: serialization of proof-of-work events: confirming transactions via recursive elections. Cryptology ePrint Archive, Report 2016/1159 (2016). https://eprint.iacr.org/2016/1159

  19. Sompolinsky, Y., Wyborski, S., Zohar, A.: PHANTOM and GHOSTDAG: a scalable generalization of Nakamoto consensus. Cryptology ePrint Archive, Report 2018/104 (2018). https://eprint.iacr.org/2018/104

  20. Sunny, K., Scott, N.: PPCoin: peer-to-peer crypto-currency with proof-of-stake (2012). https://www.peercoin.net/. Accessed 1 Feb 2020

  21. Cardano Team: Cardano settlement layer documentation (2015). https://cardanodocs.com/introduction/. Accessed 1 Feb 2020

  22. Vitalik, B.: Long-range attacks: the serious problem with adaptive proof of work (2014). https://blog.ethereum.org/. Accessed 1 Feb 2020

  23. Wood, D.G.: Ethereum: a secure decentralised generalised transaction ledger homestead (2014). http://gavwood.com/paper.pdf. Accessed 4 Aug 2017

Download references

Author information

Authors and Affiliations

  1. Guangdong Province Key Laboratory of Information Security Technology, School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, 510275, Guangdong, People’s Republic of China

    Haibo Tian, Huizhi Lin & Fangguo Zhang

Authors
  1. Haibo Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huizhi Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fangguo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haibo Tian .

Editor information

Editors and Affiliations

  1. Tianjin University, Tianjin, China

    Guangquan Xu

  2. Delft University of Technology, Delft, The Netherlands

    Kaitai Liang

  3. University of Aizu, Aizuwakamatsu, Japan

    Chunhua Su

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tian, H., Lin, H., Zhang, F. (2020). Design a Proof of Stake Based Directed Acyclic Graph Chain. In: Xu, G., Liang, K., Su, C. (eds) Frontiers in Cyber Security. FCS 2020. Communications in Computer and Information Science, vol 1286. Springer, Singapore. https://doi.org/10.1007/978-981-15-9739-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-9739-8_13

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-9738-1

  • Online ISBN: 978-981-15-9739-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation