Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Cyber Security Cryptography and Machine Learning

CSCML 2020: Cyber Security Cryptography and Machine Learning pp 175–192Cite as

Toward Self-stabilizing Blockchain, Reconstructing Totally Erased Blockchain (Preliminary Version)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12161))

Abstract

Blockchains, that are essentially distributed public ledgers, are extremely popular nowadays and are being used for many applications. One of the more common uses is for crypto-currencies, where they serve as a structure to store all the transactions publicly, securely, and hopefully irreversibly. Blockchains can be permissionless, where everyone can join and potentially contribute the blockchain, and permissioned, where only a few members (usually, much less than a permissionless blockchain) can push new transactions to the chain. While both approaches have their advantages and disadvantages, we will focus on a weakness of permissioned blockchains. The known boundary on the number of faulty participants − up to f for \(3f+1\) participants − may be surpassed, causing the BFT algorithm to fail. A situation where a malicious adversary compromises/corrupts enough nodes to harm the blockchain may lead to the complete corruption of the ledger and even to the destruction of ledger copies the nodes hold. We will suggest a solution for the reconstruction of the blockchain in the event of such an attack. Our solution will include a mandatory publication of additional information by the private users when submitting transactions and will require them to store their transaction history. We will present a technique, using verifiable secret sharing (VSS), that will make our solution trust-less, immediate and per-user independent. Our technique will prevent the private user from lying, by making such an act enable the possible exposure of the user’s secret key.

We thank the Lynne and William Frankel Center for Computer Science, the Rita Altura Trust Chair in Computer Science. This research was also supported by a grant from the Ministry of Science & Technology, Israel & the Japan Science and Technology Agency (JST), Japan, and DFG German-Israeli collaborative projects.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    By valid we mean they were generated by A and will indeed enable a player c to recover s if A did not act honestly.

  2. 2.

    See [11] for full details about random or pseudorandom integer generation and for formal definitions of DSA\(_{s}\) and DSA_Verify.

  3. 3.

    For a full proof of the scheme security see [18].

  4. 4.

    \(D_{1}=(s_{1}(1),C_{11},C_{12})\).

  5. 5.

    DSA defines \(2^{N-1}\le q\le 2^{N}\) where \(N\in \{160,224,256\}\) is the bit length of q.

References

  1. Amsden, Z., et al.: The libra blockchain (2019). https://developers.libra.org/docs/assets/papers/the-libra-blockchain.pdf

  2. Binun, A., et al.: Self-stabilizing Byzantine-tolerant distributed replicated state machine. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 36–53. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49259-9_4

    Chapter  Google Scholar 

  3. Błaśkiewicz, P., Kubiak, P., Kutyłowski, M.: Two-head dragon protocol: preventing cloning of signature keys. In: Chen, L., Yung, M. (eds.) INTRUST 2010. LNCS, vol. 6802, pp. 173–188. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25283-9_12

    Chapter  Google Scholar 

  4. Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. (TOCS) 20(4), 398–461 (2002)

    Article  Google Scholar 

  5. Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OSDI 1999, pp. 173–186 (1999)

    Google Scholar 

  6. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp. 383–395. IEEE (1985)

    Google Scholar 

  7. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  8. Dolev, S., Eldefrawy, K., Garay, J.A., Kumaramangalam, M.V., Ostrovsky, R., Yung, M.: Brief announcement: secure self-stabilizing computation. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC 2017, Washington, DC, USA, 25–27 July 2017, pp. 415–417. ACM (2017)

    Google Scholar 

  9. Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing Byzantine tolerant replicated state machine based on failure detectors. In: Dinur, I., Dolev, S., Lodha, S. (eds.) CSCML 2018. LNCS, vol. 10879, pp. 84–100. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94147-9_7

    Chapter  Google Scholar 

  10. Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp. 427–438. IEEE (1987)

    Google Scholar 

  11. Gallagher, P.: Digital signature standard (DSS). Federal Information Processing Standards Publications, volume FIPS 186–3 (2013)

    Google Scholar 

  12. Hermoni, O., Gilboa, N., Dolev, S.: Digital arbitration, 21 October 2014, US Patent 8,868,903

    Google Scholar 

  13. Krzywiecki, Ł., Kubiak, P., Kutyłowski, M.: Stamp and extend – instant but undeniable timestamping based on lazy trees. In: Mitchell, C.J., Tomlinson, A. (eds.) INTRUST 2012. LNCS, vol. 7711, pp. 5–24. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35371-0_2

    Chapter  Google Scholar 

  14. Lamport, L.: Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Program. Lang. Syst. (TOPLAS) 6(2), 254–280 (1984)

    Article  Google Scholar 

  15. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 382–401 (1982)

    Article  Google Scholar 

  16. Nakamoto, S., et al.: Bitcoin: A peer-to-peer electronic cash system (2008)

    Google Scholar 

  17. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228–234 (1980)

    Article  MathSciNet  Google Scholar 

  18. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, Beersheba, Israel

    Shlomi Dolev & Matan Liber

Authors
  1. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matan Liber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matan Liber .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel

    Shlomi Dolev

  2. School of Computer Science, Georgia Institute of Technology, Atlanta, GA, USA

    Vladimir Kolesnikov

  3. Tata Consultancy Services, Chennai, Tamil Nadu, India

    Sachin Lodha

  4. Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel

    Gera Weiss

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dolev, S., Liber, M. (2020). Toward Self-stabilizing Blockchain, Reconstructing Totally Erased Blockchain (Preliminary Version). In: Dolev, S., Kolesnikov, V., Lodha, S., Weiss, G. (eds) Cyber Security Cryptography and Machine Learning. CSCML 2020. Lecture Notes in Computer Science(), vol 12161. Springer, Cham. https://doi.org/10.1007/978-3-030-49785-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-49785-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-49784-2

  • Online ISBN: 978-3-030-49785-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation