Post-Quantum Blockchain: Challenges and Opportunities

• URL: http://arxiv.org/abs/2508.17071v1
• Date: Sat, 23 Aug 2025 15:53:49 GMT
• Title: Post-Quantum Blockchain: Challenges and Opportunities
• Authors: Sufyan Al-Janabi,
• Abstract summary: Post-Quantum Computation (PQC) is a basic solution for resisting these quantum attacks.<n>This paper aims to review the threats imposed by quantum computers on classical blockchain technology.<n>It provides useful guidelines on PQB security to blockchain researchers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Blockchain is a Distributed Ledger Technology (DLT) that offers numerous benefits including decentralization, transparency, efficiency, and reduced costs. Hence, blockchain has been included in many fields. Blockchain relies on cryptographic protocols (especially public-key cryptography and hash functions) to achieve many essential sub-routines. However, the increased progress of quantum computation and algorithms has threatened the security of many traditional cryptosystems. Therefore, this represents a serious risk for the existing blockchain technology. For example, SHA-256 and the Elliptic Curve Digital Signature Algorithm (ECDSA) cryptosystems can be compromised by Shor s and Grover s quantum algorithms in the foreseeable future. Post-Quantum Cryptography (PQC) is a basic solution for resisting these quantum attacks. Applying PQC to blockchains results in creating Post-Quantum Blockchains (PQB). Thus, this paper aims to review the threats imposed by quantum computers on classical blockchain technology and provide useful guidelines on PQB security to blockchain researchers. The paper focuses on the challenges and opportunities of future work direction in this field.

Related papers

• Time Entangled Quantum Blockchain with Phase Encoding for Classical Data [0.46797467897340006]
  It is widely believed that there will be quantum hardware capable of compromising classical cryptography.<n>This is mainly due to the operational realizations of quantum algorithms such as Grover and Shor.<n>One approach to secure blockchain is to attempt to achieve information theoretical security by defining blockchain on quantum technologies.
  arXiv  Detail & Related papers  (2025-07-20T06:50:41Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• 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)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• 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)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• When Quantum Information Technologies Meet Blockchain in Web 3.0 [86.91054991998273]
  We introduce a quantum blockchain-driven Web 3.0 framework that provides information-theoretic security for decentralized data transferring and payment transactions. We discuss the potential applications and challenges of implementing quantum blockchain in Web 3.0.
  arXiv  Detail & Related papers  (2022-11-29T05:38:42Z)
• 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)
• Vulnerability of Blockchain Technologies to Quantum Attacks [0.0]
  Quantum computation represents a threat to many cryptographic protocols in operation today. It has been estimated that by 2035, there will exist a quantum computer capable of breaking the vital cryptographic scheme RSA2048.
  arXiv  Detail & Related papers  (2021-05-05T01:01:42Z)
• 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.