International Journal of Intelligent Systems

Consensus algorithm based on verifiable quantum random numbers

Ping Wang, Weiqian Chen, Songlian Lin, Liyan Liu, Zhiwei Sun, Fangguo Zhang

Published Mar 7, 2022• 12 citations

Abstract

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.

DOI: 10.1002/int.22865

Related papers

Post-Quantum VRF and its Applications in Future-Proof Blockchain System

Zengpeng Li, Teik Guan Tan, Paweł Szałachowski +2 more

A verifiable random function (VRF in short) is a powerful pseudo-random function that provides a non-interactively public verifiable proof for the correctness of its output. Recently, VRFs have found essential applications in blockchain design, such as random beacons and proof-of-stake consensus protocols. To our knowledge, the first generation of blockchain systems used inherently inefficient proof-of-work consensuses, and the research community tried to achieve the same properties by proposing proof-of-stake schemes where resource-intensive proof-of-work is emulated by cryptographic constructions. Unfortunately, those most discussed proof-of-stake consensuses (e.g., Algorand and Ouroborous family) are not future-proof because the building blocks are secure only under the classical hard assumptions; in particular, their designs ignore the advent of quantum computing and its implications. In this paper, we propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives (e.g., non-interactive zero-knowledge system) with an intrinsic property of quantum-secure. Our novel solution is realized via two efficient zero-knowledge systems ZKBoo and ZKB++, respectively, to validate the compiler correctness. Our proof-of-concept implementation indicates that even today, the overheads introduced by our solution are acceptable in real-world deployments. We also demonstrate potential applications of a quantum-secure VRF, such as quantum-secure decentralized random beacon and lottery-based proof of stake consensus blockchain protocol.

arXiv:2109.02012Sep 5, 20212 citations

A trustless decentralized protocol for distributed consensus of public quantum random numbers

Lac Nguyen, Jeevanandha Ramanathan, Wang, Michelle Mei +2 more

Quantum random number (QRNG) beacons distinguish themselves from classical counterparts by providing intrinsic unpredictability originating from the fundamental laws of quantum mechanics. Most demonstrations have focused on certifiable randomness generators to guarantee the public that their genuineness is independent from imperfect implementations. These efforts however do not benefit applications where multiple distrusted users need a common set of random numbers, as they must rely on the honesty of beacon owners. In this paper, we formally introduce a design and proof-of-principle experiment of the first consensus protocol producing QRNs in a decentralized environment (dQRNG). Such protocol allows N number of participants contribute in the generation process and publicly verify numbers they collect. Security of the protocol is guaranteed given(N-1) dishonest participants. Our method is thus suited for distribute systems that requires a bias-resistant, highly secure, and public-verifiable random beacon.

arXiv:2108.12038Jan 1, 20212 citations

Quantum blockchain based on asymmetric quantum encryption and a stake vote consensus algorithm

Wu-Sheng Wang, Y. Yu, Lingjie Du

As 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 ([Formula: see text]) 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.

Scientific ReportsMay 21, 202247 citations

A Secure Scheme Based on a Hybrid of Classical-Quantum Communications Protocols for Managing Classical Blockchains

Ang Liu, Xiu‐Bo Chen, Shengwei Xu +5 more

Blockchain technology affords data integrity protection and building trust mechanisms in transactions for distributed networks, and, therefore, is seen as a promising revolutionary information technology. At the same time, the ongoing breakthrough in quantum computation technology contributes toward large-scale quantum computers, which might attack classic cryptography, seriously threatening the classic cryptography security currently employed in the blockchain. As a better alternative, a quantum blockchain has high expectations of being immune to quantum computing attacks perpetrated by quantum adversaries. Although several works have been presented, the problems of impracticality and inefficiency in quantum blockchain systems remain prominent and need to be addressed. First, this paper develops a quantum-secure blockchain (QSB) scheme by introducing a consensus mechanism-quantum proof of authority (QPoA) and an identity-based quantum signature (IQS)-wherein QPoA is used for new block generation and IQS is used for transaction signing and verification. Second, QPoA is developed by adopting a quantum voting protocol to achieve secure and efficient decentralization for the blockchain system, and a quantum random number generator (QRNG) is deployed for randomized leader node election to protect the blockchain system from centralized attacks like distributed denial of service (DDoS). Compared to previous work, our scheme is more practical and efficient without sacrificing security, greatly contributing to better addressing the challenges in the quantum era. Extensive security analysis demonstrates that our scheme provides better protection against quantum computing attacks than classic blockchains. Overall, our scheme presents a feasible solution for blockchain systems against quantum computing attacks through a quantum strategy, contributing toward quantum-secured blockchain in the quantum era.

EntropyMay 17, 202317 citations

Distributed Proof-of-Work Consensus with Quantum Key Distribution

Jincheng Zhang

This paper proposes a novel blockchain consensus mechanism termed "Distributed Proof-of-Work with Quantum Key Distribution" (DPW-QKD). The core idea is to leverage quantum key distribution (QKD) to replace computationally intensive hash functions in traditional Proof-of-Work (PoW) systems, thereby significantly reducing energy consumption. The system operates by nodes generating cryptographic keys through QKD, which are then utilized in a distributed QKD protocol to verify transaction validity. This approach eliminates the need for miners to solve complex cryptographic puzzles, creating a more energy-efficient and potentially more secure consensus model. The paper outlines the architecture, key components, and operational principles of the DPW-QKD system, highlighting its advantages and potential challenges. Mathematical formulations are presented to illustrate the key processes and security considerations within the system. The research aims to explore a viable pathway towards a sustainable and robust blockchain technology, driven by the inherent security of quantum mechanics.

Aug 28, 20260 citations

Distributed Proof-of-Work with Quantum Key Distribution for Secure Computation

Jincheng Zhang

This paper proposes a novel approach to distributed consensus, termed "Distributed Proof-of-Work with Quantum Key Distribution (DPoW-QKD)," which addresses the limitations of traditional Proof-of-Work (PoW) systems. PoW's inherent energy consumption and susceptibility to attacks are well-documented. The core innovation lies in leveraging Quantum Key Distribution (QKD) to establish a secure channel for generating and validating PoW blocks. This eliminates the need for computationally intensive hashing algorithms, drastically reducing energy expenditure while simultaneously providing a robust defense against malicious actors. The system utilizes QKD to generate a shared secret key between participating nodes, which is then employed to securely generate and verify the PoW solution. The proposed mechanism significantly enhances security and efficiency, offering a pathway towards more sustainable and resilient distributed systems. Mathematical models and formal descriptions are provided to illustrate the key components and operational principles of DPoW-QKD. The performance of the system is analyzed considering factors like key distribution rate, block validation time, and overall network latency. This research presents a foundational framework for exploring QKD-enhanced distributed consensus protocols.

Sep 2, 20260 citations