Advertisement

Brief Announcement Blockguard: Adaptive Blockchain Security

  • Shishir Rai
  • Kendric Hood
  • Mikhail NesterenkoEmail author
  • Gokarna Sharma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11914)

Abstract

We change the security of blockchain transactions by varying the size of consensus committees. To improve performance, such committees operate concurrently. We present two algorithms that allow adaptive security by forming concurrent variable size consensus committees on demand. One is based on a single joint blockchain, the other is based on separate sharded blockchains. For in-committee consensus, we implement synchronous Byzantine fault tolerance algorithm (BFT), asynchronous BFT and proof-of-work consensus. We evaluate the performance of our adaptive security algorithms.

References

  1. 1.
    Abraham, I., Devadas, S., Nayak, K., Ren, L.: Brief announcement: practical synchronous Byzantine consensus. In: DISC, pp. 41:1–41:4 (2017)Google Scholar
  2. 2.
    Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398–461 (2002)CrossRefGoogle Scholar
  3. 3.
    Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). http://bitcoin.org/bitcoin.pdf
  4. 4.
    Rai, S., Hood, K., Nesterenko, M., Sharma, G.: Blockguard: adaptive blockchain security. arXiv e-prints arXiv:1907.13232, July 2019

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Shishir Rai
    • 1
  • Kendric Hood
    • 1
  • Mikhail Nesterenko
    • 1
    Email author
  • Gokarna Sharma
    • 1
  1. 1.Department of Computer ScienceKent State UniversityKentUSA

Personalised recommendations