Hybrid Quantum Cryptography from Communication Complexity
arXiv:2311.09164 · doi:10.22331/q-2025-09-24-1862
Abstract
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 bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.
30 pages, 7 figures
References in corpus (27)
- Quantum cryptography: Public key distribution and coin tossing
- Decoy State Quantum Key Distribution
- General Benchmarks for Quantum Repeaters
- Fundamental Limits of Repeaterless Quantum Communications
- Hacking commercial quantum cryptography systems by tailored bright illumination
- Distillation of secret key and entanglement from quantum states
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum memories: emerging applications and recent advances
- High-dimensional quantum communication: benefits, progress, and future challenges
- High-rate quantum key distribution exceeding 110 Mb/s
- Semi-device-independent security of one-way quantum key distribution
- Quantum key distribution with realistic states: photon-number statistics in the photon-number splitting attack
- Unconditional security from noisy quantum storage
- Quantum Conference Key Agreement: A Review
- Cryptography from Noisy Storage
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- Experimental implementation of bit commitment in the noisy-storage model
- An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
- A Quantum Enigma Machine: Experimentally Demonstrating Quantum Data Locking
- Quantum-locked key distribution at nearly the classical capacity rate
- Continuous-Variable Protocol for Oblivious Transfer in the Noisy-Storage Model
- Experimental demonstration of quantum advantage for one-way communication complexity
- Necessary detection efficiencies for secure quantum key distribution and bound randomness
- Using post-measurement information in state discrimination
- How post-selection affects device-independent claims under the fair sampling assumption
- Practically feasible robust quantum money with classical verification
- Continuous-variable quantum enigma machines for long-distance key distribution