Vol.65, No.1, 2020, pp.963-976, doi:10.32604/cmc.2020.09803
OPEN ACCESS
ARTICLE
A Novel GLS Consensus Algorithm for Alliance Chain in Edge Computing Environment
  • Huijuan Wang1, *, Jiang Yong1, Qingwei Liu2, Alan Yang3
1 Information Security Department of the First Research Institute of the Ministry of Public Security of China, Beijing, 100084, China.
2 College of NBC Defense, Beijing, 100084, China.
3 Amphenol Assemble Tech, Houston, TX 77070, USA.
* Corresponding Author: Huijuan Wang. Email: whj409@163.com.
Received 19 January 2020; Accepted 30 April 2020; Issue published 23 July 2020
Abstract
Edge computing devices are widely deployed. An important issue that arises is in that these devices suffer from security attacks. To deal with it, we turn to the blockchain technologies. The note in the alliance chain need rules to limit write permissions. Alliance chain can provide security management functions, using these functions to meet the management between the members, certification, authorization, monitoring and auditing. This article mainly analyzes some requirements realization which applies to the alliance chain, and introduces a new consensus algorithm, generalized Legendre sequence (GLS) consensus algorithm, for alliance chain. GLS algorithms inherit the recognition and verification efficiency of binary sequence ciphers in computer communication and can solve a large number of nodes verification of key distribution issues. In the alliance chain, GLS consensus algorithm can complete node address hiding, automatic task sorting, task automatic grouping, task node scope confirmation, task address binding and stamp timestamp. Moreover, the GLS consensus algorithm increases the difficulty of network malicious attack.
Keywords
Alliance chain, consensus algorithm, GLS, data local sharing, arithmetic cross-correlation.
Cite This Article
Wang, H., Yong, J., Liu, Q., Yang, A. (2020). A Novel GLS Consensus Algorithm for Alliance Chain in Edge Computing Environment. CMC-Computers, Materials & Continua, 65(1), 963–976.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.