Entropic security in quantum cryptography

Authors:
Simon Pierre Desrosiers
Affiliations:
Université McGill, Montréal, Canada
Venue:
Quantum Information Processing
Year:
2009

Citing 7
Cited 3

A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly one-way probabilistic hash functions (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
How to Fool an Unbounded Adversary with a Short Key

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Private quantum channels

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantum entropic security and approximate quantum encryption

IEEE Transactions on Information Theory
A unified approach to deterministic encryption: new constructions and a connection to computational entropy

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.06

Visualization

Abstract

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 totally closes the gap between the key requirement of quantum ciphers and classical ciphers.