Entropic security in quantum cryptography

@article{Desrosiers2009EntropicSI,
  title={Entropic security in quantum cryptography},
  author={Simon Pierre Desrosiers},
  journal={Quantum Information Processing},
  year={2009},
  volume={8},
  pages={331-345}
}
  • S. Desrosiers
  • Published 6 March 2007
  • Computer Science, Mathematics
  • Quantum Information Processing
We present two new definitions of security for quantum ciphers which are inspired by the definitions 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 classical bits of key under reasonable conditions and yet be secure in an information theoretic setting. This cipher also… 
Quantum Entropic Security and Approximate Quantum Encryption
TLDR
This work generalizes existing schemes for approximate quantum encryption to the entropic security model and provides proofs of security for two different ciphers in this model and a proof for a lower bound on the key length required by any such cipher.
A Quantum-Classical Scheme towards Quantum Functional Encryption
TLDR
A novel one-bit secret-key quantum encryption scheme which allows different key holders to learn different length subsequences of the plaintext from the ciphertext, and is secure under the notions of quantum semantic security, quantum entropic indistinguishability, and recent security definitions from the field of functional encryption.
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.
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
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 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 cryptography beyond quantum key distribution
TLDR
This review article, aimed primarily at cryptographers unfamiliar with the quantum world, survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
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.
Approximate quantum encryption with faster key expansion
TLDR
This paper presents a fast key expansion method to create a 2 n -bit pseudorandom string which is then used as a QOTP key, and makes use of 2 n bits of public randomness which are included as a classical part of the cipherstate.
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
TLDR
A deterministic scheme for the secure encryption of uniformly and independently distributed messages based solely on the existence of trapdoor one-way permutations is presented and a generalization of the construction is shown that allows secure deterministic encryption of independent high-entropy messages.
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Quantum Entropic Security and Approximate Quantum Encryption
TLDR
This work generalizes existing schemes for approximate quantum encryption to the entropic security model and provides proofs of security for two different ciphers in this model and a proof for a lower bound on the key length required by any such cipher.
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
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.
Private quantum channels
TLDR
It is shown that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient and may be viewed as the quantum analogue of the classical one-time pad encryption scheme.
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.
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.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Approximate Randomization of Quantum States With Fewer Bits of Key
TLDR
An improved, efficient construction of an approximately randomizing map that uses O(d/epsilon^2) Pauli operators to map any d-dimensional state to a state that is within trace distance epsilon of the completely mixed state.
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
TLDR
The random oracle model is a very convenient setting for designing cryptographic protocols, but there is not a general mechanism for transforming protocols that are secure in the random oracles model into protocols that is secure in real life.
Foundations of Cryptography: Volume 2, Basic Applications
TLDR
This second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols.
...
...