Blockchain Verifiable Proof of Quantum Supremacy as a Trigger for Quantum-Secure Signatures

• URL: http://arxiv.org/abs/2601.05534v2
• Date: Tue, 13 Jan 2026 17:29:56 GMT
• Title: Blockchain Verifiable Proof of Quantum Supremacy as a Trigger for Quantum-Secure Signatures
• Authors: Nicholas J. C. Papadopoulos,
• Abstract summary: A decentralized, distributed ledger technology ensures transparency, security, and immutability through cryptographic techniques.<n>However, advancements in quantum computing threaten the security of classical cryptographic schemes.<n>This milestone would render existing security standards vulnerable, exposing blockchain assets to fraud and theft.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Blockchain is a decentralized, distributed ledger technology that ensures transparency, security, and immutability through cryptographic techniques. However, advancements in quantum computing threaten the security of classical cryptographic schemes, jeopardizing blockchain integrity once cryptographic quantum supremacy is achieved. This milestone, defined here as the realization of quantum computers to solve practical cryptographic problems, would render existing security standards vulnerable, exposing blockchain assets (currency, data, etc.) to fraud and theft. To address this risk, we propose and implement a smart contract deployable on the Ethereum blockchain, having the ability to run applications on its blockchain, that generates classically intractable puzzles by probabilistically generating large, hard-to-factor numbers without requiring secret information. This contract then serves two purposes: to establish a mechanism (1) for a trustless, unbiased proof of cryptographic quantum supremacy by verifying solutions to these puzzles, and (2) to protect user funds on Ethereum by triggering quantum-secure fallback protocols upon detecting cryptographic quantum supremacy, since it is desirable to wait as long as possible to fall back to a quantum-secure scheme because of its inherent additional cost and complexity. These mechanisms demonstrate the ability to identify cryptographic vulnerabilities and ensure a smooth transition to quantum-secure standards, safeguarding blockchain assets in a post-quantum era.

Related papers

• Quantum Disruption: An SOK of How Post-Quantum Attackers Reshape Blockchain Security and Performance [6.516258691106587]
  We examine the implications of adopting post-quantum cryptography in blockchain systems across four key dimensions.<n>We identify the cryptographic primitives within blockchain architectures that are most vulnerable to quantum attacks.<n>We evaluate how replacing classical primitives with post-quantum alternatives affects system performance, protocol dynamics, and the incentive and trust structures that sustain blockchain ecosystems.
  arXiv  Detail & Related papers  (2025-12-15T13:48:14Z)
• Literature Review of the Effect of Quantum Computing on Cryptocurrencies using Blockchain Technology [0.0]
  This paper presents a literature review evaluating how quantum algorithms, specifically Shors and Grovers, could disrupt the foundational security mechanisms of cryptocurrencies.<n>This review identifies specific vulnerabilities in transaction and consensus processes in Bitcoin, Litecoin, Monero, and Zcash.<n>In anticipation, it investigates countermeasures including Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD), and protocol-level modifications such as memory-intensive proof-of-work algorithms and multi-signature schemes.
  arXiv  Detail & Related papers  (2025-08-24T10:53:41Z)
• 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)
• Blockchain Security Risk Assessment in Quantum Era, Migration Strategies and Proactive Defense [2.5836862608084936]
  The emergence of quantum computing presents a formidable challenge to the security of blockchain systems.<n>Traditional cryptographic algorithms become vulnerable to the immense computational power of quantum computers.<n>This paper conducts a thorough risk assessment of transitioning to quantum-resistant blockchains.
  arXiv  Detail & Related papers  (2025-01-21T00:27:41Z)
• 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)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• 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 Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• 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.