Quantum Entropic Security and Approximate Quantum Encryption

@article{Desrosiers2010QuantumES,
  title={Quantum Entropic Security and Approximate Quantum Encryption},
  author={Simon Pierre Desrosiers and Fr{\'e}d{\'e}ric Dupuis},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={3455-3464}
}
  • S. Desrosiers, F. Dupuis
  • Published 5 July 2007
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
An encryption scheme is said to be entropically secure if an adversary whose min-entropy on the message is upper bounded cannot guess any function of the message. Similarly, an encryption scheme is entropically indistinguishable if the encrypted version of a message whose min-entropy is high enough is statistically indistinguishable from a fixed distribution. We present full generalizations of these two concepts to the encryption of quantum states in which the quantum conditional min-entropy… 
View on IEEE
arxiv.org
23 Citations
Highly Influential Citations
4
Background Citations
7
Methods Citations
4

23 Citations

Quantum entropic security
TLDR
This work proves for the first time that one can prove security for encryption schemes while allowing entanglement with the adversary and yet not requiring perfect security, in a fully generalized model of entropic security.
On statistically-secure quantum homomorphic encryption
TLDR
This work provides a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead and proposes a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits.
Entropic security in quantum cryptography
  • S. Desrosiers
  • Computer Science, Mathematics
    Quantum Inf. Process.
  • 2009
TLDR
A generalization of a cipher described by Dodis and Smith is proposed and it is shown that it can actually encrypt n qubits using less than n classical bits of key under reasonable conditions and yet be secure in an information theoretic setting.
Computational Security of Quantum Encryption
TLDR
This work develops natural definitions for private-key and public-key encryption schemes for quantum data and defines notions of semantic security and indistinguishability, and constructs secure quantum encryption schemes from basic primitives.
Quantum Encryption and Generalized Quantum Shannon Impossibility.
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…
Quantum encryption and generalized Shannon impossibility
TLDR
This paper provides its quantum analogue with imperfect secrecy and imperfect correctness and gives a systematic study of information-theoretically secure quantum encryption with two secrecy definitions, showing that the weaker one implies the stronger but with a security loss in d.
Quantum homomorphic encryption from quantum codes
TLDR
A quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates is presented.
Approximate quantum encryption with even shorter keys
TLDR
It is shown that key length n+ 2 3 log 1 ε suffices to encrypt n qubits in such a way that the cipherstate has trace distance ≤ ε from the fully mixed state.
Leftover Hashing against quantum side information
TLDR
A (strictly) more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is proved and applies to arbitrary δ-almost two-universal families of hash functions.
IND-secure quantum symmetric encryption based on point obfuscation
TLDR
It is rigorously proved that IND-secure quantum symmetric encryption can be realized by quantum point obfuscators and can implement IND-CPA (indistinguishability under chosen plaintext attack) or leakage-resilient quantum asymmetric encryption, respectively.
...
...

References

SHOWING 1-10 OF 29 REFERENCES
Entropic security in quantum cryptography
  • S. Desrosiers
  • Computer Science, Mathematics
    Quantum Inf. Process.
  • 2009
TLDR
A generalization of a cipher described by Dodis and Smith is proposed and it is shown that it can actually encrypt n qubits using less than n classical bits of key under reasonable conditions and yet be secure in an information theoretic setting.
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
TLDR
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages that leaks a non-zero (though small) amount of information but require a shorter shared random key.
Entropic Security and the Encryption of High Entropy Messages
TLDR
It is shown that entropic security is equivalent to indistinguishability on pairs of input distributions of sufficiently high entropy, which is in turn related torandomness extraction from non-uniform distributions, and the connection to randomness extraction, to prove several new results on entropically-secure encryption.
How to fool an unbounded adversary with a short key
TLDR
A family of encryption schemes is presented that guarantee that for any message space in {0, 1}n with minimum entropy n-lscr and for any Boolean function h:{0,1}n rarr {0-1}, no adversary can predict h(m) from the ciphertext of m with more than 1/nomega(1) advantage; this is achieved with keys of length lscr+omega (logn).
Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker
TLDR
A new randomness-extraction technique is proved, which is known to work in the classical setting, to be secure against a quantum attacker as well, and this result allows to extend the classical applications of this extractor to the quantum setting.
Probabilistic encryption & how to play mental poker keeping secret all partial information
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the…
Cryptographic Distinguishability Measures for Quantum-Mechanical States
TLDR
This paper surveys four measures of distinguishability for quantum-mechanical states from the point of view of the cryptographer with a particular eye on applications in quantum cryptography, and obtains several inequalities that relate the quantum distinguishability measures to each other.
Randomizing Quantum States: Constructions and Applications
TLDR
It is shown that there exists a set of roughly d’log d unitary operators whose average effect on every input pure state is almost perfectly randomizing, as compared to the d2 operators required to randomize perfectly.
Security of quantum key distribution
  • R. Renner
  • Computer Science
    Ausgezeichnete Informatikdissertationen
  • 2005
TLDR
This work proposes an approach which allows us to study general physical systems for which the above mentioned independence condition does not necessarily hold, and introduces new uncertainty measures, called smooth min- and max-entropy, which are generalizations of information-theoretical notions.
Probabilistic Encryption
...
...