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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. In: IEEE symposium on foundations of computer science, pp. 544–553 (1990)
Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private quantum channels. In: IEEE symposium on foundations of computer science, pp. 547–553 (2000)
Ambainis, A., Smith, A.: Small pseudo-random families of matrices: derandomizing approximate quantum encryption. In: Proceeding of RANDOM 2004, pp. 249–260. Springer (2004)
Canetti, R.: Towards realizing random oracles: hash functions that hide all partial information. In: Lecture Notes in Computer Science, vol. 1294, pp. 455–469. Springer, London, UK (1997)
Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: 30th Annual ACM Symposium on Theory of Computing, pp. 131–140. ACM (1998)
Desrosiers, S.P.: Quantum entropic security. Ph.D. thesis, McGill University (2009)
Desrosiers, S.P., Dupuis, F.: Quantum entropic security and approximate quantum encryption. IEEE Trans Inf Theory (To appear)
Dickinson, P.A., Nayak, A.: Approximate randomization of quantum states with fewer bits of key, 2006. quant-ph/0611033
Dodis, Y., Smith, A.: Entropic security and the encryption of high entropy messages. Cryptology ePrint Archive, Report 2004/219, 2004. http://eprint.iacr.org/
Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC ’89: Proceedings of the twenty-first annual ACM symposium on theory of computing, pp. 25–32. ACM, New York, NY, USA (1989)
Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
Hayden P., Leung D., Shor P.W., Winter A.: Randomizing quantum states: constructions and applications. Commun. Math. Phys. 250, 371–391 (2004)
Helstrom C.W.: Quantum detection and estimation theory. J. Stat. Phys. 1(2), 231–252 (1969)
Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York, NY, USA (2000)
Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. In: EUROCRYPT ’02: Proceedings of the international conference on the theory and applications of cryptographic techniques, pp. 133–148. Springer-Verlag, London, UK (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Desrosiers, S.P. Entropic security in quantum cryptography. Quantum Inf Process 8, 331–345 (2009). https://doi.org/10.1007/s11128-009-0111-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-009-0111-3
Keywords
- Quantum cryptography
- Approximate encryption
- Entropic security
- Information theory
- Private quantum channel