Secure Composition of Quantum Key Distribution and Symmetric Key Encryption
arXiv:2501.08435 · doi:10.1109/ISIT63088.2025.11195563
Abstract
Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics. Composability-based security proofs of QKD ensure that using the established key with a one-time-pad encryption scheme provides information theoretic secrecy for the message. In this paper, we consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition. Hybrid encryption was first proposed as a public key cryptographic algorithm with proven security for messages of unrestricted length. We use an extension of this framework to correlated randomness setting (Sharifian et al. in ISIT 2021) to propose a quantum-enabled Key Encapsulation Mechanism (qKEM) and quantum-enabled hybrid encryption (qHE), and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption system for unrestricted length messages with proved security against an adversary with access to efficient computations on a quantum computer (i.e. post-quantum secure encryption without using any computational assumptions.)
References in corpus (17)
- Quantum cryptography: Public key distribution and coin tossing
- The Security of Practical Quantum Key Distribution
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Tight Finite-Key Analysis for Quantum Cryptography
- An information-theoretic security proof for QKD protocols
- Security in Quantum Cryptography
- Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
- Symmetry implies independence
- Leftover Hashing Against Quantum Side Information
- Unconditional Security of Practical Quantum Key Distribution
- Trevisan's extractor in the presence of quantum side information
- Locking of accessible information and implications for the security of quantum cryptography
- Composability in quantum cryptography
- Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
- Finite-key security against coherent attacks in quantum key distribution
- Practical Evaluation of Security for Quantum Key Distribution
- Secure Composition of Quantum Key Distribution and Symmetric Key Encryption