4.7 Article

Consensus algorithm based on verifiable quantum random numbers

期刊

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS
卷 37, 期 10, 页码 6857-6876

出版社

WILEY-HINDAWI
DOI: 10.1002/int.22865

关键词

blockchain; consensus algorithms; verifiable quantum random numbers; verifiable random numbers

资金

  1. National Natural Science Foundation of China [61872245, 61972429]
  2. Guangdong Major Project of Basic and Applied Basic Research [2019B030302008]
  3. Shenzhen Science and Technology Program [JCYJ20180305123639326, JCYJ20190809152003992, JCYJ20210324100813034]

向作者/读者索取更多资源

This paper proposes a consensus algorithm based on quantum random numbers, which improves the randomness and fairness of the consensus process by introducing verifiable quantum random numbers, and requires minimal computation for users.
Blockchain systems based on the proof-of-work (PoW) consensus introduce entropy to the system in a natural way due to the randomness of mining. However, for non-PoW consensus (e.g., proof-of-stake and delegated proof-of-stake consensus) blockchain systems, a different approach to introducing entropy, such as the distributed random number generation (dRNG) algorithm, must be established. The dRNG algorithm is one of the key challenges in developing the consensus mechanism, as well as one of the relevant parameters for determining the merit of the consensus mechanism. In this paper, we first derive a publicly verifiable quantum random numbers generation protocol based on the certifiable randomness scheme from any untrusted quantum device, which offers features, such as fairness, no trusted third party, and publicly verifiable. Then, based on verifiable quantum random numbers, we propose a new consensus algorithm. The algorithm selects block proposer and block verification committees for each round using verifiable quantum random numbers, resulting in better randomness, fairness, and efficiency of the entire consensus process. In addition, the new consensus algorithm is not only resistant to adaptive adversary models as well as to collusion attacks, but also requires negligible computation for each user to avoid unnecessary consumption of power resources. Finally, we analyze the verifiable randomness, fairness, liveness, and communication complexity of the consensus algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据