Quantum encryption and generalized Shannon impossibility

DOI10.1007/S10623-018-00597-3MaRDI QIDQ2324779zbMATH OpenOpenAlexWikidataFDO

Authors Ching-Yi Lai, Kai-Min Chung

Publication date 12 September 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

information-theoretic securitykey lengthquantum one-time padShannon impossibility

Mathematics Subject Classification ID

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

Abstract: The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect correctness. We also give a systematic study of information-theoretically secure quantum encryption with two secrecy definitions. We show that the weaker one implies the stronger but with a security loss in $d$, where $d$ is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of $o(d^{-1})$.

Recommendations

• Shannon impossibility, revisited
• On the optimality of quantum encryption schemes
• On the Power of Quantum Encryption Keys
• Encryption with weakly random keys using a quantum ciphertext
• ENCRYPTION OF QUANTUM INFORMATION

Cites work

• Approximate Randomization of Quantum States With Fewer Bits of Key
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Communication Theory of Secrecy Systems*
• Cryptographic distinguishability measures for quantum-mechanical states
• Entropic security in quantum cryptography
• Hiding quantum data
• How to fool an unbounded adversary with a short key
• Invertible quantum operations and perfect encryption of quantum states
• On the optimality of quantum encryption schemes
• Probabilistic encryption
• Quantum Entropic Security and Approximate Quantum Encryption
• Randomizing quantum states: constructions and applications
• Resource requirements of private quantum channels and consequences for oblivious remote state preparation
• Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography
• Shannon impossibility, revisited
• The transition probability in the state space of a \(^*\)-algebra
• The Operational Meaning of Min- and Max-Entropy
• Theory of Cryptography

Cited in

(14)

• Hidden shift quantum cryptanalysis and implications
• Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Encryption with weakly random keys using a quantum ciphertext
• scientific article; zbMATH DE number 5320313 (Why is no real title available?)
• On the Power of Quantum Encryption Keys
• Nonmalleable encryption of quantum information
• scientific article; zbMATH DE number 2086396 (Why is no real title available?)
• Shannon impossibility, revisited
• IMPOSSIBILITY OF PERFECT QUANTUM SEALING OF CLASSICAL INFORMATION
• ENCRYPTION OF QUANTUM INFORMATION
• Entropically secure encryption with faster key expansion
• One-wayness in quantum cryptography
• Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes

This page was built for publication: Quantum encryption and generalized Shannon impossibility

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