The Cost of Quantum Resistance: A Hash-Based Commit-Reveal Alternative for Minimizing Blockchain Infrastructure Overhead

• URL: http://arxiv.org/abs/2605.06853v1
• Date: Thu, 07 May 2026 18:53:14 GMT
• Title: The Cost of Quantum Resistance: A Hash-Based Commit-Reveal Alternative for Minimizing Blockchain Infrastructure Overhead
• Abstract summary: Post-quantum cryptography in blockchain systems such as Bitcoin is often framed as a purely cryptographic problem.<n>We propose a hash-based commit--reveal construction that replaces a single signature-bearing transaction with two lightweight transactions.<n>This approach achieves post-quantum security under standard hash assumptions while increasing the effective transaction footprint by only approximately 1.5$times$ to 2$times$ per authorization event.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The transition to post-quantum cryptography in blockchain systems such as Bitcoin and Ethereum is often framed as a purely cryptographic problem. In practice, it also presents significant economic and infrastructural challenges: in globally replicated networks, increases in transaction size and verification cost are multiplied across all participating nodes. Existing post-quantum signature schemes, including lattice-based constructions such as CRYSTALS-Dilithium and stateless hash-based schemes such as SPHINCS+, introduce substantial increases in signature size. At blockchain scale, these increases translate into higher storage, bandwidth, and validation requirements, potentially requiring multiple generations of hardware improvement to become operationally routine. Historical experience suggests that even moderate increases in data footprint can be contentious, as illustrated by the Bitcoin block size debates (2015--2017). We propose a hash-based commit--reveal construction that replaces a single signature-bearing transaction with two lightweight transactions, each containing a fixed-size (32-byte) hash output derived from well-established primitives such as SHA-256, BLAKE, or Keccak. This approach achieves post-quantum security under standard hash assumptions while increasing the effective transaction footprint by only approximately 1.5$\times$ to 2$\times$ per authorization event. These results indicate that practical post-quantum migration may benefit from rethinking transaction semantics rather than directly adopting larger signature schemes, and that viable designs for decentralized systems must account for system-wide cost amplification.

Related papers

• A fault-tolerant quantum blockchain deployed on commercial telecommunications network [22.868859830689342]
  We propose and experimentally demonstrate a fully operational hybrid quantum blockchain architecture built on photonic integrated circuits.<n>The system achieves a fault tolerance of nearly one-half, surpassing the classical limit, while reaching consensus on a timescale of seconds.<n>This work establishes a foundation for practical quantum blockchains, enabling secure, scalable, and decentralized information processing.
  arXiv  Detail & Related papers  (2026-07-14T01:25:15Z)
• Performance Analysis of Quantum-Secure Digital Signature Algorithms in Blockchain [0.0]
  This report presents a blockchain prototype that supports multiple quantum-secure signature algorithms.<n>It focuses on CRYSTALS-Dilithium, Falcon and Hawk as lattice-based schemes.<n>It also provides a detailed comparison of quantum-secure signatures in a blockchain context and extending the analysis to schemes such as HAETAE.
  arXiv  Detail & Related papers  (2026-01-25T10:52:47Z)
• Blockchain Verifiable Proof of Quantum Supremacy as a Trigger for Quantum-Secure Signatures [0.0]
  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.
  arXiv  Detail & Related papers  (2026-01-09T05:20:02Z)
• 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)
• Efficient Blockchain-based Steganography via Backcalculating Generative Adversarial Network [105.47203971578871]
  We propose a generic blockchain-based steganography framework (GBSF)<n>The sender generates the required fields such as amount and fees, where the additional covert data is embedded to enhance the channel capacity.<n>Based on GBSF, we design a reversible generative adversarial network (R-GAN)<n>We propose R-GAN with Counter-intuitive data preprocessing and Custom activation functions, namely CCR-GAN.
  arXiv  Detail & Related papers  (2025-06-19T04:43: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)
• SQIAsignHD: SQIsignHD Adaptor Signature [0.6708691048956046]
  We introduce $mathsfSQIAsignHD$, a new quantum-resistant adaptor signature scheme based on isogenies of supersingular elliptic curves.<n>We exploit the idea of the artificial orientation on the supersingular isogeny Diffie-Hellman key exchange protocol, SIDH, to define the underlying hard relation.
  arXiv  Detail & Related papers  (2024-04-13T15:25:28Z)
• Collaborative Learning Framework to Detect Attacks in Transactions and Smart Contracts [26.70294159598272]
  This paper presents a novel collaborative learning framework designed to detect attacks in blockchain transactions and smart contracts. Our framework exhibits the capability to classify various types of blockchain attacks, including intricate attacks at the machine code level. Our framework achieves a detection accuracy of approximately 94% through extensive simulations and 91% in real-time experiments with a throughput of over 2,150 transactions per second.
  arXiv  Detail & Related papers  (2023-08-30T07:17:20Z)
• 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)
• 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.