On the optimality of quantum encryption schemes
From MaRDI portal
Abstract: It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is not the case when we are encrypting quantum bits. For the perfect encryption of n quantum bits, 2n bits of entropy are necessary and sufficient (quantum one-time pad), but for approximate encryption one asymptotically needs only n bits of entropy. In this paper, we provide the optimal trade-off between the approximation measure epsilon and the amount of classical entropy used in the encryption of single quantum bits. Then, we consider n-qubit encryption schemes which are a composition of independent single-qubit ones and provide the optimal schemes both in the 2- and the operator-norm. Moreover, we provide a counterexample to show that the encryption scheme of Ambainis-Smith based on small-bias sets does not work in the operator-norm.
Recommendations
- Optimal symmetric ternary quantum encryption schemes
- On the Power of Quantum Encryption Keys
- Quantum Entropic Security and Approximate Quantum Encryption
- Quantum Key Distribution Protocol Optimization
- On the optimal mean photon number for quantum cryptography
- Secrecy, computational loads and rates in practical quantum cryptography
- On security notions for encryption in a quantum world
- scientific article; zbMATH DE number 1030986
- Optimality of private quantum channels
- Verifiable quantum encryption and its practical applications
Cites work
- Additivity for unital qubit channels
- An analysis of completely-positive trace-preserving maps on \({\mathcal M}_{2}\)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Communication Theory of Secrecy Systems*
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Optimality of private quantum channels
- Randomizing quantum states: constructions and applications
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
Cited in
(16)- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- Quantum encryption and generalized Shannon impossibility
- Sample-size-reduction of quantum states for the noisy linear problem
- Optimal eavesdropping on quantum key distribution without quantum memory
- Optimality of private quantum channels
- Invertible quantum operations and perfect encryption of quantum states
- On the Power of Quantum Encryption Keys
- scientific article; zbMATH DE number 6823399 (Why is no real title available?)
- scientific article; zbMATH DE number 2086396 (Why is no real title available?)
- Improvement of one quantum encryption scheme
- Optimal symmetric ternary quantum encryption schemes
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Entropically secure encryption with faster key expansion
- Secure sequential transmission of quantum information
This page was built for publication: On the optimality of quantum encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442020)
