New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain
- 2 Downloads
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.
Keywordssecurity blockchain signature consortium interactive proof
Unable to display preview. Download preview PDF.
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).
- 1.Bogart S, Rice K. The blockchain report: welcome to the Internet of value. Report, 2015Google Scholar
- 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.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.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.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.Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. Consulted, 2008Google Scholar
- 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.Sompolinsky Y, Zohar A. Accelerating bitcoin’s transaction processing. fast money grows on trees, not chains. IACR Cryptology ePrint Archive. 2013Google Scholar
- 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
- 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.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.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
- 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
- 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.Braud-Santoni N, Guerraoui R, Huc F. Fast byzantine agreement. In: Proceedings of ACM Symposium on Principles of Distributed Computing. 2013, 57–64Google Scholar
- 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