Entropic security in quantum cryptography
From MaRDI portal
Abstract: We present two new definitions of security for quantum ciphers which are inspired by the definition of entropic security and entropic indistinguishability defined by Dodis and Smith. We prove the equivalence of these two new definitions. We also propose a generalization of a cipher described by Dodis and Smith and show that it can actually encrypt n qubits using less than n bits of key under reasonable conditions and yet be secure in an information theoretic setting. This cipher also totally closes the gap between the key requirement of quantum ciphers and classical ciphers.
Recommendations
- Quantum Entropic Security and Approximate Quantum Encryption
- ENCRYPTION OF QUANTUM INFORMATION
- Computational Security of Quantum Encryption
- Quantum cryptography
- Quantum cryptography
- Quantum cryptography
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Security aspects of quantum cryptography with d-dimensional systems
Cites work
- Addendum to “simple constructions of almost k-wise independent random variables”
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Entropic security in quantum cryptography
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- scientific article; zbMATH DE number 2086703 (Why is no real title available?)
- Probabilistic encryption
- Quantum Entropic Security and Approximate Quantum Encryption
- Randomizing quantum states: constructions and applications
Cited in
(19)- Entropic security in quantum cryptography
- Composable and finite computational security of quantum message transmission
- Quantum stream ciphers: impossibility of unconditionally strong algorithms
- Quantum encryption and generalized Shannon impossibility
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Security of EPR-based quantum cryptography against incoherent symmetric attacks
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Computational Security of Quantum Encryption
- SECURITY OF QUANTUM KEY DISTRIBUTION
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Criteria of key security
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Advances in Cryptology - EUROCRYPT 2004
- Security in Quantum Cryptography vs. Nonlocal Hidden Variables
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- scientific article; zbMATH DE number 5252455 (Why is no real title available?)
- Entropically secure encryption with faster key expansion
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Entropic security in quantum cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039614)
