| Summary: | Blockchain, a type of a decentralized network system that allows mutually distrustful parties to transact securely without involving third parties, has recently been attracting increasing attention. Hence, there must be a consensus mechanism to ensure a distributed consensus among all participants. Such a consensus mechanism may also be used to guarantee fairness, correctness and security of such decentralized systems. Thus, in this paper we propose a novel consensus mechanism named GSCS that is an improved version of PoW. Compared with existing consensus mechanisms (such as PoW, PoS and so on), GSCS provides strong resistance to resource centralization, the quantum attack and other malicious attacks. In this work, we first present the serial mining puzzle to resist collusive mining and the quantum attack. It guarantees that participants can only obtain a negligible advantage by solving the relevant problem in parallel. Second, GSCS considers the influence of participant credibility. The credibility is reflected by the mining behavior of each participant and directly influence to the mining difficulty of participant. Thus, credible participants enjoy a higher probability of winning the mining competition than do participants who are not credible. Finally, performance of GSCS is analyzed in terms of the common prefix, chain quality, chain growth, and power cost. The results indicate that GSCS is security- and incentive-compatible with suitable security parameter settings. In brief, GSCS has the potential to ensure a more secure and robust environment for decentralized blockchain systems.
|
|---|
