On the Power of Quantum Encryption Keys

DOI10.1007/978-3-540-88403-3_12MaRDI QIDQ3535360zbMATH OpenOpenAlexFDO

Authors Akinori Kawachi, Christopher Portmann

Publication date 11 November 2008

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0808.2869

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Abstract: The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message conditioned on a classical secret key $k$. We investigate encryption schemes in which this transformation is conditioned on a quantum encryption key state $h{o}_k$ instead of a classical string, and extend this symmetric-key scheme to an asymmetric-key model in which copies of the same encryption key $h{o}_k$ may be held by several different people, but maintaining information-theoretical security. We find bounds on the message size and the number of copies of the encryption key which can be safely created in these two models in terms of the entropy of the decryption key, and show that the optimal bound can be asymptotically reached by a scheme using classical encryption keys. This means that the use of quantum states as encryption keys does not allow more of these to be created and shared, nor encrypt larger messages, than if these keys are purely classical.

Recommendations

• On the optimality of quantum encryption schemes
• Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
• Quantum encryption and generalized Shannon impossibility
• Uncloneable encryption
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Approximate Randomization of Quantum States With Fewer Bits of Key
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Computational Indistinguishability Between Quantum States and Its Cryptographic Application
• Computational indistinguishability between quantum states and its cryptographic application
• Continuity of quantum conditional information
• How Many Copies are Needed for State Discrimination?
• Invertible quantum operations and perfect encryption of quantum states
• Quantum measurements for hidden subgroup problems with optimal sample complexity
• Randomizing quantum states: constructions and applications

Cited in

(17)

• Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
• Encryption with weakly random keys using a quantum ciphertext
• Randomizing quantum states: constructions and applications
• Approximate Randomization of Quantum States With Fewer Bits of Key
• Entropically secure encryption with faster key expansion
• On the optimality of quantum encryption schemes
• On the feasibility of unclonable encryption, and more
• On the computational power of the light: a plan for breaking data encryption standard
• Block encryption of quantum messages
• Computational indistinguishability between quantum states and its cryptographic application
• Quantum encryption and generalized Shannon impossibility
• Invertible quantum operations and perfect encryption of quantum states
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
• Advances in Cryptology - EUROCRYPT 2004
• Bit-oriented quantum public-key encryption based on quantum perfect encryption
• ENCRYPTION OF QUANTUM INFORMATION

This page was built for publication: On the Power of Quantum Encryption Keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535360)