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

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

References

[1] Bogart S, Rice K. The blockchain report: welcome to the internet of value. Needham Insight, 2015

[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–414

[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–917

[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–454

[5] Chaudhary K, Fehnker A, van de Pol J, Stoelinga M. Modeling and verification of the bitcoin protocol. 2015, arXiv preprint arXiv:1511.04173

[6] Zhu Y, Guo R, Gan G, Tsai W T. Interactive incontestable signature for transactions confirmation in bitcoin blockchain. In: Proceedings of the 40th IEEE Annual Computer Software and Applications Conference. 2016, 443–448

[7] Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. Consulted, 2008

[8] Pilkington M. Blockchain technology: principles and applications. In: Olleros F X, Zhegu M, eds. Research Handbook on Digital Transformations. Cheltenham, UK: Edward Elgar, 2016

[9] Sompolinsky Y, Zohar A. Accelerating bitcoin’s transaction processing. fast money grows on trees, not chains. IACR Cryptology ePrint Archive. 2013

[10] Lewenberg Y, Sompolinsky Y, Zohar A. Inclusive block chain protocols. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2015, 528–547

[11] Eyal I, Gencer A E, Sirer E G, van Renesse R. Bitcoin-NG: a scalable blockchain protocol. In: Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation. 2016, 45–59

[12] Bracha G. An O(log n) expected rounds randomized byzantine generals protocol. Journal of the ACM, 1987, 34(4): 910–920

[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–671

[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–242

[15] Russell A, Zuckerman D. Perfect information leader election in log^∗n+ O(1) rounds. In: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science. 1998, 576–583

[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–977

[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–478

[18] Toueg S, Perry K J, Srikanth T. Fast distributed agreement. SIAM Journal on Computing, 1987, 16(3): 445–457

[19] Lamport L, Shostak R, Pease M. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382–401

[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–162

[21] Dolev D, Reischuk R, Strong H R. Early stopping in byzantine agreement. Journal of the ACM, 1990, 37(4): 720–741

[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–132

[23] Braud-Santoni N, Guerraoui R, Huc F. Fast byzantine agreement. In: Proceedings of ACM Symposium on Principles of Distributed Computing. 2013, 57–64

[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–2153

[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–616

[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–271

[27] Su D, Lv K. Paillier’s trapdoor function hides θ (n) bits. Science China Information Sciences, 2011, 54(9): 1827–1836

[28] Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2001, 514–532

[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–2244

[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–238

RIGHTS & PERMISSIONS

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