Author:
Wang Wusheng,Yu Yang,Du Lingjie
Abstract
AbstractAs emerging next-generation information technologies, blockchains have unique advantages in information transparency and transaction security. They have attracted great attentions in social and financial fields. However, the rapid development of quantum computation and the impending realization of quantum supremacy have had significant impacts on the advantages of traditional blockchain based on traditional cryptography. Here, we propose a blockchain algorithm based on asymmetric quantum encryption and a stake vote consensus algorithm. The algorithm combines a consensus algorithm based on the delegated proof of stake with node behaviour and Borda count (DPoSB) and quantum digital signature technology based on quantum state computational distinguishability with a fully flipped permutation ($${\text{QSC}}{\text{D}}_{\text{ff}}$$
QSCD
ff
) problem. DPoSB is used to generate blocks by voting, while the quantum signature applies quantum one-way functions to guarantee the security of transactions. The analysis shows that this combination offers better protection than other existing quantum-resistant blockchains. The combination can effectively resist the threat of quantum computation on blockchain technology and provide a new platform to ensure the security of blockchain.
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Nakamoto, S. A peer-to-peer electronic cash system. Decentralized Bus. Rev. 21260 (2008).
2. King, S., Nadal, S. Ppcoin: Peer-to-peer crypto-currency with proof-of-stake. self-published paper. 19 (2012).
3. Larimer, D. Delegated proof-of-stake (dpos). Bitshare Whitepaper. 81, 85 (2014).
4. Tan, C., Xiong, L. DPoSB: Delegated Proof of Stake with node's behavior and Borda Count. ITOEC. 1429–1434 (2020).
5. Lamport, L. The Byzantine generals problem. JACM. 30, 668–676 (1983).
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献