Quantum entropic security and approximate quantum encryption

Abstract

We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is made. This limit is quantified using the quantum conditional min-entropy as introduced by Renato Renner. A proof of the equivalence between the two security definitions is presented. We also provide proofs of security for two different cyphers in this model and a proof for a lower bound on the key length required by any such cypher. These cyphers generalise existing schemes for approximate quantum encryption to the entropic security model.

Corrected mistakes in the proofs of Theorems 3 and 6; results unchanged. To appear in IEEE Transactions on Information Theory.

References in corpus (3)

• The operational meaning of min- and max-entropy
• Randomizing quantum states: Constructions and applications
• Approximate Randomization of Quantum States With Fewer Bits of Key

Cited by in corpus (10)

• Leftover Hashing Against Quantum Side Information
• Quantum Cryptography Beyond Quantum Key Distribution
• The decoupling approach to quantum information theory
• Quantum homomorphic encryption from quantum codes
• From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
• Computational Security of Quantum Encryption
• Quantum Encryption and Generalized Quantum Shannon Impossibility
• Efficient methods for one-shot quantum communication
• Entropically secure encryption with faster key expansion
• Interactive Leakage Chain Rule for Quantum Min-entropy