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

doi:10.1007/s11704-017-6338-8

Front. Comput. Sci.

2019, Vol. 13

Issue (6) : 1182-1197 https://doi.org/10.1007/s11704-017-6338-8

RESEARCH ARTICLE

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

Yan ZHU¹(

), Khaled RIAD^1,²(

), Ruiqi GUO¹, Guohua GAN¹, Rongquan FENG³

¹. School of Computer & Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China
². Mathematics Department, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
³. School of Mathematical Sciences, Peking University, Beijing 100871, China

Download: PDF(662 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

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

Corresponding Author(s): Yan ZHU

Just Accepted Date: 12 January 2017 Online First Date: 06 March 2018 Issue Date: 19 July 2019

Cite this article:

Yan ZHU,Khaled RIAD,Ruiqi GUO, et al. New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain[J]. Front. Comput. Sci., 2019, 13(6): 1182-1197.

URL:

https://academic.hep.com.cn/fcs/EN/10.1007/s11704-017-6338-8
https://academic.hep.com.cn/fcs/EN/Y2019/V13/I6/1182

1	S Bogart, K Rice. The blockchain report: welcome to the internet of value. Needham Insight, 2015
2	S Barber, X Boyen, E Shi, E Uzun. Bitter to better – how to make bitcoin a better currency. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2012, 399–414 https://doi.org/10.1007/978-3-642-32946-3_29
3	G O Karame, E Androulaki, S Capkun. Double-spending fast payments in bitcoin. In: Proceedings of ACM Conference on Computer and Communications Security. 2012, 906–917 https://doi.org/10.1145/2382196.2382292
4	I Eyal, E G Sirer. Majority is not enough: bitcoin mining is vulnerable. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2014, 436–454 https://doi.org/10.1007/978-3-662-45472-5_28
5	K Chaudhary, A Fehnker, J van de Pol , M Stoelinga. Modeling and verification of the bitcoin protocol. 2015, arXiv preprint arXiv:1511.04173
6	Y Zhu, R Guo, G Gan, W T Tsai. Interactive incontestable signature for transactions confirmation in bitcoin blockchain. In: Proceedings of the 40th IEEE Annual Computer Software and Applications Conference. 2016, 443–448 https://doi.org/10.1109/COMPSAC.2016.142
7	S Nakamoto. Bitcoin: a peer-to-peer electronic cash system. Consulted, 2008
8	M Pilkington. Blockchain technology: principles and applications. In: Olleros F X, Zhegu M, eds. Research Handbook on Digital Transformations. Cheltenham, UK: Edward Elgar, 2016 https://doi.org/10.4337/9781784717766.00019
9	Y Sompolinsky, A Zohar. Accelerating bitcoin’s transaction processing. fast money grows on trees, not chains. IACR Cryptology ePrint Archive. 2013
10	Y Lewenberg, Y Sompolinsky, A Zohar. Inclusive block chain protocols. In: Proceedings of International Conference on Financial Cryptography and Data Security. 2015, 528–547 https://doi.org/10.1007/978-3-662-47854-7_33
11	I Eyal, A E Gencer, E G Sirer, R van Renesse. Bitcoin-NG: a scalable blockchain protocol. In: Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation. 2016, 45–59
12	G Bracha. An O(log n) expected rounds randomized byzantine generals protocol. Journal of the ACM, 1987, 34(4): 910–920 https://doi.org/10.1145/31846.42229
13	J Cooper, N Linial. Fast perfection-information leader-election protocol with linear immunity, In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing. 1993, 662–671 https://doi.org/10.1145/167088.167258
14	R Ostrovsky, S Rajagopalan, U Vazirani. 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 https://doi.org/10.1145/195058.195141
15	A Russell, D Zuckerman. 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 https://doi.org/10.1109/SFCS.1998.743508
16	S Gilbert, D R Kowalski. Distributed agreement with optimal communication complexity. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. 2010, 965–977 https://doi.org/10.1137/1.9781611973075.78
17	V King, J Saia. From almost everywhere to everywhere: Byzantine agreement with Õ(n3/2) bits. In: Proceedings of International Symposium on Distributed Computing. 2009, 464–478 https://doi.org/10.1007/978-3-642-04355-0_47
18	S Toueg, K J Perry, T Srikanth. Fast distributed agreement. SIAM Journal on Computing, 1987, 16(3): 445–457 https://doi.org/10.1137/0216031
19	L Lamport, R Shostak, M Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382–401 https://doi.org/10.1145/357172.357176
20	G Bracha. An asynchronous [(n-1)/3]-resilient consensus protocol. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing. 1984, 154–162 https://doi.org/10.1145/800222.806743
21	D Dolev, R Reischuk, H R Strong. Early stopping in byzantine agreement. Journal of the ACM, 1990, 37(4): 720–741 https://doi.org/10.1145/96559.96565
22	C Cachin, K Kursawe, V Shoup. 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 https://doi.org/10.1145/343477.343531
23	N Braud-Santoni, R Guerraoui, F Huc. Fast byzantine agreement. In: Proceedings of ACM Symposium on Principles of Distributed Computing. 2013, 57–64 https://doi.org/10.1145/2484239.2484243
24	Y Zhu, G J Ahn, H Hu, D Ma, S Wang. 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 https://doi.org/10.1109/TIFS.2013.2287858
25	Y Zhu, D Huang, C J Hu, X Wang. From RBAC to ABAC: constructing flexible data access control for cloud storage services. IEEE Transactions on Services Computing, 2015, 8(4): 601–616 https://doi.org/10.1109/TSC.2014.2363474
26	D Su, K Lv. A new hard-core predicate of paillier’s trapdoor function. In: Proceedings of International Conference on Cryptology in India. 2009, 263–271 https://doi.org/10.1007/978-3-642-10628-6_18
27	D Su, K Lv. Paillier’s trapdoor function hides θ (n) bits. Science China Information Sciences, 2011, 54(9): 1827–1836 https://doi.org/10.1007/s11432-011-4269-9
28	D Boneh, B Lynn, H Shacham. Short signatures from the weil pairing. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2001, 514–532 https://doi.org/10.1007/3-540-45682-1_30
29	Y Zhu, H Hu, G J Ahn, M Yu. Cooperative provable data possession for integrity verification in multicloud storage. IEEE Transactions on Parallel and Distributed Systems, 2012, 23 (12): 2231–2244 https://doi.org/10.1109/TPDS.2012.66
30	Y Zhu, G J Ahn, H Hu, S S Yau, H G An, C J Hu. Dynamic audit services for outsourced storages in clouds. IEEE Transactions on Services Computing, 2013, 6(2): 227–238 https://doi.org/10.1109/TSC.2011.51

[1]

Download

[1]	Bin GUO, Yasan DING, Yueheng SUN, Shuai MA, Ke LI, Zhiwen YU. The mass, fake news, and cognition security[J]. Front. Comput. Sci., 2021, 15(3): 153806-.
[2]	Abhishek MAJUMDAR, Arpita BISWAS, Atanu MAJUMDER, Sandeep Kumar SOOD, Krishna Lal BAISHNAB. A novel DNA-inspired encryption strategy for concealing cloud storage[J]. Front. Comput. Sci., 2021, 15(3): 153807-.
[3]	Zeli WANG, Hai JIN, Weiqi DAI, Kim-Kwang Raymond CHOO, Deqing ZOU. Ethereum smart contract security research: survey and future research opportunities[J]. Front. Comput. Sci., 2021, 15(2): 152802-.
[4]	Je Sen TEH, Weijian TENG, Azman SAMSUDIN, Jiageng CHEN. A post-processing method for true random number generators based on hyperchaos with applications in audio-based generators[J]. Front. Comput. Sci., 2020, 14(6): 146405-.
[5]	Xiaochen LIU, Chunhe XIA, Tianbo WANG, Li ZHONG, Xiaojian LI. A behavior-aware SLA-based framework for guaranteeing the security conformance of cloud service[J]. Front. Comput. Sci., 2020, 14(6): 146808-.
[6]	Ling SHEN, Richang HONG, Yanbin HAO. Advance on large scale near-duplicate video retrieval[J]. Front. Comput. Sci., 2020, 14(5): 145702-.
[7]	Parnika PARANJAPE, Meera DHABU, Parag DESHPANDE. A novel classifier for multivariate instance using graph class signatures[J]. Front. Comput. Sci., 2020, 14(4): 144307-.
[8]	Yanwei ZHOU, Bo YANG. Practical continuous leakage-resilient CCA secure identity-based encryption[J]. Front. Comput. Sci., 2020, 14(4): 144804-.
[9]	E CHEN, Yan ZHU, Changlu LIN, Kewei LV. Zero-pole cancellation for identity-based aggregators: a constant-size designated verifier-set signature[J]. Front. Comput. Sci., 2020, 14(4): 144806-.
[10]	Yudi ZHANG, Debiao HE, Mingwu ZHANG, Kim-Kwang Raymond CHOO. A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm[J]. Front. Comput. Sci., 2020, 14(3): 143803-.
[11]	Xingyue CHEN, Tao SHANG, Feng ZHANG, Jianwei LIU, Zhenyu GUAN. Dynamic data auditing scheme for big data storage[J]. Front. Comput. Sci., 2020, 14(1): 219-229.
[12]	Tianyong WU, Xi DENG, Jun YAN, Jian ZHANG. Analyses for specific defects in Android applications: a survey[J]. Front. Comput. Sci., 2019, 13(6): 1210-1227.
[13]	Yu ZHANG, Yuxing HAN, Jiangtao WEN. SMER: a secure method of exchanging resources in heterogeneous internet of things[J]. Front. Comput. Sci., 2019, 13(6): 1198-1209.
[14]	Lian YU, Wei-Tek TSAI. State synchronization in process-oriented chaincode[J]. Front. Comput. Sci., 2019, 13(6): 1166-1181.
[15]	Libo FENG, Hui ZHANG, Wei-Tek TSAI, Simeng SUN. System architecture for high-performance permissioned blockchains[J]. Front. Comput. Sci., 2019, 13(6): 1151-1165.

Viewed

Full text

Abstract

Cited

Shared

Discussed