Q-PnV: A Quantum Consensus Mechanism for Security Consortium Blockchains

• URL: http://arxiv.org/abs/2412.06325v1
• Date: Mon, 09 Dec 2024 09:24:04 GMT
• Title: Q-PnV: A Quantum Consensus Mechanism for Security Consortium Blockchains
• Authors: Jianming Lin, Hui Li, Hongjian Xing, Runhuai Huang, Weixiang Huang, Shaowen Deng, Yanping Zhang, Weimin Zeng, Ping Lu, Xiyu Wang, Tao Sun, Xiongyan Tang,
• Abstract summary: We propose a novel quantum consensus mechanism, named Q-PnV. This consensus mechanism is based on the classical Proof of Vote (PoV), integrating quantum voting, quantum digital signature and quantum random number generators (QRNGs) Compared to the classical method, the quantum blockchain based on Q-PnV can resist quantum attacks and shows significant improvements in security and fairness, making it better suit-ed for the future quantum era.
• Score: 10.20686832651113
• License:
• Abstract: Due to the rapid development of quantum computing, many classical blockchain technologies are now considered insecure. The emergence of quantum blockchain holds promise for addressing this issue. Various quantum consensus algorithms have been proposed so far, but there has not yet been a quantum consensus algorithm tailored specifically for consortium blockchain scenarios. In this paper, we propose a novel quantum consensus mechanism, named Q-PnV. This consensus mechanism is based on the classical Proof of Vote (PoV), integrating quantum voting, quantum digital signature and quantum random number generators (QRNGs). By combining Q-PnV with a quantum blockchain using weighted hypergraph states, we propose a comprehensive quantum blockchain solution for consortium blockchain scenarios. Compared to the classical method, the quantum blockchain based on Q-PnV can resist quantum attacks and shows significant improvements in security and fairness, making it better suit-ed for the future quantum era.

Related papers

• A Survey and Comparison of Post-quantum and Quantum Blockchains [4.965489431705061]
  The rapid progress of quantum computing poses a significant threat to the security of existing blockchain technologies. The emergence of Shor's and Grover's algorithms raises concerns regarding the compromise of the cryptographic systems underlying blockchains. It is essential to develop methods that reinforce blockchain technology against quantum attacks.
  arXiv  Detail & Related papers  (2024-09-02T16:20:22Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks [0.0]
  This article studies current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs. It provides comparisons on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.
  arXiv  Detail & Related papers  (2024-02-01T17:29:07Z)
• From Portfolio Optimization to Quantum Blockchain and Security: A Systematic Review of Quantum Computing in Finance [0.0]
  We provide an overview of the recent work in the quantum finance realm from various perspectives. The applications in consideration are Portfolio Optimization, Fraud Detection, and Monte Carlo methods for derivative pricing and risk calculation. We give a comprehensive overview of the applications of quantum computing in the field of blockchain technology.
  arXiv  Detail & Related papers  (2023-06-12T19:53:23Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
  Quantum generative learning models (QGLMs) may surpass their classical counterparts. We review the current progress of QGLMs from the perspective of machine learning. We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
  arXiv  Detail & Related papers  (2022-06-07T07:32:57Z)
• Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt Procedure [0.0]
  We propose a model of a fully quantum blockchain based on a generalized Gram-Schmidt procedure. It is shown to be secure even against quantum computing attacks. We outline a framework for a quantum token built on the same architecture as our blockchain.
  arXiv  Detail & Related papers  (2021-10-05T04:33:55Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.