New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain

  • Yan Zhu
  • Khaled Riad
  • Ruiqi Guo
  • Guohua Gan
  • Rongquan Feng
Research Article

Abstract

The blockchain is a radical innovation that has a considerable effect on payments, stock exchanges, cybersecurity, and computational law. However, its limitations in terms of the uncertainty involved in transaction confirmation are significant. In this paper, we describe the design of a decentralized voting protocol for the election of a block generator in a consortium blockchain and propose a new system framework that allows fast and exact confirmation of all transactions. In addition, to replace a transaction’s owner signature, a new interactive incontestable signature between the dealer and owner is used to confirm a transaction. By means of this signature, the dealer can assure the owner that a transaction will be permanently included in the blockchain in a non-repudiation manner. Moreover, the signatures of all transactions in a block share only one witness that provides membership proof between the block and these transactions. Finally, a security and performance analysis shows that the proposed schemes are provably secure and highly efficient.

Keywords

security blockchain signature consortium interactive proof 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

The authors are indebted to anonymous reviewers for their valuable suggestions. This work was supported by the National Basic Research Program of China (2013CB329601) and the National Natural Science Foundation of China (Grant Nos. 61370187 and 61472032), NSFCGenertec Joint Fund For Basic Research (U1636104), and Joint Research Fund for Overseas Chinese Scholars and Scholars in Hong Kong and Macao (61628201).

Supplementary material

11704_2017_6338_MOESM1_ESM.ppt (539 kb)
Supplementary material, approximately 539 KB.

References

  1. 1.
    Bogart S, Rice K. The blockchain report: welcome to the Internet of value. Report, 2015Google Scholar
  2. 2.
    Barber S, Boyen X, Shi E, Uzun E. Bitter to better–how to make bitcoin a better currency. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2012, 399–414CrossRefGoogle Scholar
  3. 3.
    Karame G O, Androulaki E, Capkun S. Double-spending fast payments in bitcoin. In: Proceedings of ACM conference on Computer and communications security. 2012, 906–917Google Scholar
  4. 4.
    Eyal I, Sirer E G. Majority is not enough: bitcoin mining is vulnerable. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2014, 436–454Google Scholar
  5. 5.
    Chaudhary K, Fehnker A, van de Pol J, Stoelinga M. Modeling and verification of the bitcoin protocol. 2015, arXiv preprint arXiv:1511.04173Google Scholar
  6. 6.
    Zhu Y, Guo R, Gan G, Tsai WT. Interactive incontestable signature for transactions confirmation in bitcoin blockchain. In: Proceedings of the 40th IEEE Annual Computer Software and Applications Conference. 2016: 443–448Google Scholar
  7. 7.
    Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. Consulted, 2008Google Scholar
  8. 8.
    Pilkington M. Blockchain technology: principles and applications. In: Olleros F X, Zhegu M, eds. Research Handbook on Digital Transformations. Cheltenham, UK: Edward Elgar, 2016Google Scholar
  9. 9.
    Sompolinsky Y, Zohar A. Accelerating bitcoin’s transaction processing. fast money grows on trees, not chains. IACR Cryptology ePrint Archive. 2013Google Scholar
  10. 10.
    Lewenberg Y, Sompolinsky Y, Zohar A. Inclusive block chain protocols. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2015, 528–547CrossRefGoogle Scholar
  11. 11.
    Eyal I, Gencer A E, Sirer E G, van Renesse R. Bitcoin-NG: a scalable blockchain protocol. In: Proceedings of 13th USENIX Symposium on Networked Systems Design and Implementation. 2016, 45–59Google Scholar
  12. 12.
    Bracha G. An O(log n) expected rounds randomized byzantine generals protocol. Journal of the ACM, 1987, 34(4): 910–920MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Cooper J, Linial N. Fast perfection-information leader-election protocol with linear immunity, In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing. 1993, 662–671Google Scholar
  14. 14.
    Ostrovsky R, Rajagopalan S, Vazirani U. Simple and efficient leader election in the full information model. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing. 1994, 234–242Google Scholar
  15. 15.
    Russell A, Zuckerman D. Perfect information leader election in log* n+ O(1) rounds. In: Proceedings of 39th IEEE Annual Symposium on Foundations of Computer Science. 1998, 576–583Google Scholar
  16. 16.
    Gilbert S, Kowalski D R. Distributed agreement with optimal communication complexity. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. 2010, 965–977CrossRefGoogle Scholar
  17. 17.
    King V, Saia J. From almost everywhere to everywhere: Byzantine agreement with ˜Õ(n 3/2) bits. In: Proceedings of International Symposium on Distributed Computing. 2009, 464–478Google Scholar
  18. 18.
    Toueg S, Perry K J, Srikanth T. Fast distributed agreement. SIAM Journal on Computing, 1987, 16(3): 445–457MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Lamport L, Shostak R, Pease M. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382–401CrossRefMATHGoogle Scholar
  20. 20.
    Bracha G. An asynchronous [(n-1)/3]-resilient consensus protocol. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing. 1984, 154–162CrossRefGoogle Scholar
  21. 21.
    Dolev D, Reischuk R, Strong H R. Early stopping in byzantine agree-ment. Journal of the ACM, 1990, 37(4): 720–741CrossRefMATHGoogle Scholar
  22. 22.
    Cachin C, Kursawe K, Shoup V. Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography, In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing. 2000, 123–132Google Scholar
  23. 23.
    Braud-Santoni N, Guerraoui R, Huc F. Fast byzantine agreement. In: Proceedings of ACM Symposium on Principles of Distributed Computing. 2013, 57–64Google Scholar
  24. 24.
    Zhu Y, Ahn G J, Hu H, Ma D, Wang S. Role-based cryptosystem: a new cryptographic rbac system based on role-key hierarchy. IEEE Transactions on Information Forensics and Security, 2013, 8(12): 2138–2153CrossRefGoogle Scholar
  25. 25.
    Zhu Y, Huang D, Hu C J, Wang X. From RBAC to ABAC: constructing flexible data access control for cloud storage services. IEEE Transactions on Services Computing, 2015, 8(4): 601–616CrossRefGoogle Scholar
  26. 26.
    Su D, Lv K. A new hard-core predicate of paillier’s trapdoor function. In: Proceedings of International Conference on Cryptology in India. 2009, 263–271Google Scholar
  27. 27.
    Su D, Lv K. Paillier’s trapdoor function hides θ (n) bits. Science China Information Sciences, 2011, 54(9): 1827–1836MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. In: Proceedings of Advances in Cryptology–ASIACRYPT 2001. 2001, 514–532CrossRefGoogle Scholar
  29. 29.
    Zhu Y, Hu H, Ahn G J, Yu M. Cooperative provable data possession for integrity verification in multicloud storage. IEEE transactions on parallel and distributed systems, 2012, 23 (12): 2231–2244CrossRefGoogle Scholar
  30. 30.
    Zhu Y, Ahn G J, Hu H, Yau S S, An H G, Hu C J. Dynamic audit services for outsourced storages in clouds. IEEE Transactions on Services Computing, 2013, 6(2): 227–238CrossRefGoogle Scholar

Copyright information

© Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Yan Zhu
    • 1
  • Khaled Riad
    • 1
    • 2
  • Ruiqi Guo
    • 1
  • Guohua Gan
    • 1
  • Rongquan Feng
    • 3
  1. 1.School of Computer & Communication EngineeringUniversity of Science and Technology BeijingBeijingChina
  2. 2.Mathematics Department, Faculty of ScienceZagazig UniversityZagazigEgypt
  3. 3.School of Mathematical SciencesPeking UniversityBeijingChina

Personalised recommendations