On the Practical Feasibility of Harvest-Now, Decrypt-Later Attacks

• URL: http://arxiv.org/abs/2603.01091v1
• Date: Sun, 01 Mar 2026 13:04:05 GMT
• Title: On the Practical Feasibility of Harvest-Now, Decrypt-Later Attacks
• Authors: Javier Blanco-Romero, Florina Almenares Mendoza, Carlos García Rubio, Celeste Campo, Daniel Díaz Sánchez,
• Abstract summary: Harvest-now, decrypt-later (HN-DL) attacks threaten today's communications by archiving text until a quantum computer can break the underlying key exchange.<n>This paper reframes HN-DL as an economic problem, quantifying adversary costs across Transport Layer Security (TLS) 1.2, TLS 1.3, QUIC, and Secure Shell (SSH)<n>We evaluate protocol configuration strategies that act along two independent cost axes storage overhead and quantum workload.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Harvest-now, decrypt-later (HN-DL) attacks threaten today's encrypted communications by archiving ciphertext until a quantum computer can break the underlying key exchange. This paper reframes HN-DL as an economic problem, quantifying adversary costs across Transport Layer Security (TLS) 1.2, TLS 1.3, QUIC, and Secure Shell (SSH) with an open-source testbed that reproduces the full attack sequence. Our model shows that retaining intercepted traffic is economically trivial, shifting the defensive question from whether an adversary can archive to how much decryption will cost. We evaluate protocol configuration strategies that act along two independent cost axes: storage overhead and quantum workload. Beyond the ongoing migration to post-quantum cryptography, these strategies provide defense in depth with current infrastructure. Encrypted Client Hello forces indiscriminate bulk collection, inflating the archive the adversary must retain, while aggressive rekeying and larger key exchange parameters multiply the quantum computations required to recover plaintext. Because storage inflation penalizes both sides while quantum cost inflation targets the adversary alone, rekeying and key size selection offer the strongest defensive levers.

Related papers

• Two-Dimensional XOR-Based Secret Sharing for Layered Multipath Communication [6.708717040312532]
  This paper introduces the first two-dimensional XOR-based secret sharing scheme for layered multipath communication networks.<n>We present a construction that guarantees successful message recovery and perfect privacy when an adversary observes and disrupts any single path at each transmission layer.
  arXiv  Detail & Related papers  (2025-09-29T17:40:31Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Quantum-enabled framework for the Advanced Encryption Standard in the post-quantum era [0.0]
  This paper presents an improved version of the Advanced Encryption Standard (AES) that uses quantum technology to strengthen protection.<n>The system generates encryption keys using quantum randomness instead of predictable computer algorithms, making keys virtually impossible to guess.<n> Organizations can implement this solution in stages--starting with hybrid mode for sensitive data while keeping older systems operational.
  arXiv  Detail & Related papers  (2025-02-04T16:11:37Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• A Quantum of QUIC: Dissecting Cryptography with Post-Quantum Insights [2.522402937703098]
  QUIC is a new network protocol standardized in 2021. It was designed to replace the TCP/TLS stack and is based on UDP. This paper presents a detailed evaluation of the impact of cryptography on QUIC performance.
  arXiv  Detail & Related papers  (2024-05-15T11:27:28Z)
• Demonstration of quantum-digital payments [36.136619420474766]
  We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
  arXiv  Detail & Related papers  (2023-05-23T20:20:14Z)
• Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
  We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
  arXiv  Detail & Related papers  (2023-04-04T13:57:17Z)
• 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)
• Powerful Primitives in the Bounded Quantum Storage Model [0.0]
  The bounded quantum storage model aims to achieve security against computationally adversaries that are restricted only with respect to their quantum memories.<n>We provide information-theoretic secure constructions in this model for the following powerful primitives.
  arXiv  Detail & Related papers  (2023-02-11T15:38:52Z)
• 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)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

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.