We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time of available quantum memories.Taking advantage of the QCT assumptions, we build a key distribution protocol called HM-QCT from the Hidden Matching problem for which there exists an exponential gap in one-way communication complexity between classical and quantum strategies.We establish that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem with classical information. Legitimate users, on the other hand, can use quantum communication, which gives them the possibility of sending multiple copies of the same quantum state while retaining an information advantage. This leads to an everlasting secure key distribution scheme over n bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to O ( n log ( n ) ) input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.
We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time of available quantum memories.Taking advantage of the QCT assumptions, we build a key distribution protocol called HM-QCT from the Hidden Matching problem for which there exists an exponential gap in one-way communication complexity between classical and quantum strategies.We establish that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem with classical information. Legitimate users, on the other hand, can use quantum communication, which gives them the possibility of sending multiple copies of the same quantum state while retaining an information advantage. This leads to an everlasting secure key distribution scheme over n bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to O ( n log ( n ) ) input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.
The HM-QCT protocol, presented by Mazzoncini et al. in 2025, uses a unique feature of quantum information to achieve quantum key distribution (QKD) with secret-key rates beyond standard constructions. The protocol has been designed in the hybrid quantum-computational time-lock (QCT) security model which imposes two independent (but related) restrictions on the attacker: (1) a computationally secure encryption scheme which a successful attacker must break within a narrow timeframe and (2) an assumption that the attacker can only store quantum information with low fidelity. We first review the protocol and its two-assumption model by presenting, in explicit form, the two natural "harvest now, decrypt later" strategies against it, one using quantum memory and one using classical memory. We show how each is excluded by exactly one of the two assumptions, so that harvesting resistance rests on their conjunction and on the presumed existence of a technological gap: the adversary's quantum memory must decohere much faster than the time it takes to break the short-term encryption. Finally, we introduce HM-PRF , a variant that replaces the short-term encryption with a pseudorandom function (PRF) , evaluated locally. By eliminating the transmission of enciphered classical information, the adversary does not need to race an impending expiry event. We compare the security of our construction against the original and argue that our PRF-based assumption yields a more realistic adversary. It simply requires the existence of one-way functions rather than a predicted lasting limitation of quantum computation and memory technology.
We introduce the Quantum Computational Timelock (QCT) model, combining time-lock encryption with a quantitative noisy-quantum-storage assumption. Time-lock encryption gives Bob immediate access to the encoding seed and gives Eve the same final information as access to that seed only after a protected interval. Eve may then process her retained information without computational restriction. We state this delayed-access encryption assumption explicitly and construct MUB-QCT from a complete set of mutually unbiased bases in dimension d and an affine pair-wise independent permutation family.
For single-copy encoding, every seed-independent immediate measurement has trace-distance advantage at most 1/(2d+1) and mutual information at most 1/(d+1). Effective residual storage at diamond distance at most δ from replacement adds at most δ to the individual-attack distinguishing bound. Under i.i.d. individual attacks and entropy-preserving acceptance, we obtain an asymptotic key-rate bound and formulate final-key secrecy in composable trace distance.
For m independently randomized signals sharing one bit and seed, the optimal leakage under non-adaptive product measurements is min{1,m/(d+1)}, allowing a linear-in-d detection enhancement in that attack model. We also construct a seed-independent joint measurement that recovers the bit after disclosure with error at most ε from O(logd+log(1/ε)) signals, retaining only classical information after measurement. This gives a quantitative separation between product and joint measurements. Bob uses two logical detection outcomes independently of d.
Security of quantum key distribution (QKD) protocols rely solely on quantum physics laws, namely, on the impossibility to distinguish between non-orthogonal quantum states with absolute certainty. Due to this, a potential eavesdropper cannot extract full information from the states stored in their quantum memory after an attack despite knowing all the information disclosed during classical post-processing stages of QKD. Here, we introduce the idea of encrypting classical communication related to error-correction in order to decrease the amount of information available to the eavesdropper and hence improve the performance of quantum key distribution protocols. We analyze the applicability of the method in the context of additional assumptions concerning the eavesdropper's quantum memory coherence time and discuss the similarity of our proposition and the quantum data locking (QDL) technique.
How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we study the classical cryptographic problem that two parties would like to perform secure computations with long outputs. As a basic primitive and example, we first consider the following problem which we call secure function sampling with long outputs: suppose f:{0,1}n→{0,1}m is a public, efficient classical function, where m is big; Alice would like to sample x from its domain and sends f(x) to Bob; what Bob knows should be no more than f(x) even if it behaves maliciously. Classical cryptography, like FHE and succinct arguments [Gen09,Kil92,HW15], allows us to achieve this task within communication complexity O(n+m); could we achieve this task with communication complexity independent of m? In this work, we first design a quantum cryptographic protocol that achieves secure function sampling with approximate security, within O(n) communication (omitting the dependency on the security parameter and error tolerance). We also prove the classical impossibility using techniques in [HW15], which means that our protocol indeed achieves a type of quantum advantage. Building on the secure function sampling protocol, we further construct protocols for general secure two-party computations [Yao86,GB01] with approximate security, with communication complexity only depending on the input length and the targeted security. In terms of the assumptions, we construct protocols for these problems assuming only the existence of collapsing hash functions [Unr16]; what's more, we also construct a classical-channel protocol for these problems additionally assuming the existence of noisy trapdoor claw-free functions [BCMVV,BKVV].
Quantum resistance is vital for emerging cryptographic systems as quantum technologies continue to advance towards large-scale, fault-tolerant quantum computers. Resistance may be offered by quantum key distribution (QKD), which ideally provides information-theoretic security (ITS) using quantum states of photons, but is limited in practice due to device-dependent loopholes and the reliance on classical channel authentication. An alternative approach uses classical means and is conjectured to be resistant to quantum attacks—so-called post-quantum cryptography (PQC)—but its security relies on the unproven assumption of the hardness of mathematical problems. To address the security and performance challenges present in each, here we introduce a key merging framework to combine QKD and PQC key material based on linear-code secret sharing schemes. In particular, we design joint QKD-PQC key distribution schemes based on Reed-Solomon codes, which achieve high performance while ensuring a high security level. Compared to naive XOR-type schemes, our schemes can achieve a security enhancement ofΘ(n)wherenis the number of parallel key distribution links when the key distribution performance is similar. Furthermore, we develop schemes where the attacker needs to break both QKD and PQC links to learn the key bit information. Our hybrid approach paves the way for joint quantum-classical communication networks, which leverage the advantages of both QKD and PQC and can be tailored to the requirements of various practical networks.
Current cryptographic systems and information security methods are largely based on the computational intractability and impracticability of reversing complex cryptographic algorithms and protocols. The foundation of secure communication and data protection strategies that we rely on a daily basis is provided by this computational difficulty. However, quantum computers with sufficient processing power could breach these basic security assumptions, making it possible to recover the cryptographic keys used to safeguard sensitive data and compromise widely used key exchange techniques. A viable strategy to counter the threat of quantum attacks and maintain standard security guarantees is hybrid systems. The software-based hybrid cryptographic framework that guarantees forward secrecy and contemporary cryptographic authentication while also integrating quantum-resilient key establishment schemes, namely, quantum key distribution simulation and a post-quantum key encapsulation mechanism, in a manner that also combines their security properties to generate a hybrid key that remains secure as long as at least one underlying component remains uncompromised is experimentally implemented in this paper. We demonstrate how this approach can safeguard both real-time secure communication and long-term data protection against current threats as well as future quantum adversaries.