Quantum Entropic Security and Approximate Quantum Encryption
From MaRDI portal
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.
Cited in
(12)- Entropic security in quantum cryptography
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- IND-secure quantum symmetric encryption based on point obfuscation
- Quantum encryption and generalized Shannon impossibility
- A method of enciphering quantum states
- Computational Security of Quantum Encryption
- On the optimality of quantum encryption schemes
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Entropically secure encryption with faster key expansion
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Quantum Entropic Security and Approximate Quantum Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281413)
