Abstract
We consider the scenario where Alice wants to send a secret (classical) n-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to obtain perfect secrecy with key length smaller then n. We study the question of whether there might still be fundamental differences between the case where quantum as opposed to classical communication is used. In this direction, we show that there exist ciphers with perfect security producing quantum ciphertext where, even if an adversary knows the plaintext and applies an optimal measurement on the ciphertext, his Shannon uncertainty about the key used is almost maximal. This is in contrast to the classical case where the adversary always learns n bits of information on the key in a known plaintext attack. We also show that there is a limit to how different the classical and quantum cases can be: the most probable key, given matching plain- and ciphertexts, has the same probability in both the quantum and the classical cases. We suggest an application of our results in the case where only a short secret key is available and the message is much longer. Namely, one can use a pseudorandom generator to produce from the short key a stream of keys for a quantum cipher, using each of them to encrypt an n-bit block of the message. Our results suggest that an adversary with bounded resources in a known plaintext attack may potentially be in a much harder situation against quantum stream-ciphers than against any classical stream-cipher with the same parameters.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private Quantum Channels. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 547–553 (2000)
DiVincenzo, D., Horodecki, M., Leung, D., Smolin, J., Terhal, B.: Locking Classical Correlation in Quantum States. Phys. Rev. Letters 92, 67902 (2004)
Larsen, U.: Superspace Geometry: the exact uncertainty relationship between complementary aspects. J.Phys. A: Math. Gen. 23, 1041–1061 (1990)
Maurer, U., Massey, J.: Local Randomness in Pseudorandom Sequences. Journal of Cryptology 4, 135–149 (1991)
Maassen, H., Uffink, J.B.M.: Generalized Entropic Uncertainty Relations. Phys. Rev. Letters 60, 1103–1106 (1988)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Sánchez-Ruiz, J.: Improved bounds in the entropic uncertainty and certainty relations for complementary observables. Physics Letters A 201, 125–131 (1995)
Wootters, W.K., Fields, B.D.: Optimal state-determination by mutually unbiased measurements. Annals of Physics 191, 363–381
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damgård, I., Pedersen, T., Salvail, L. (2004). On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission. In: Cachin, C., Camenisch, J.L. (eds) Advances in Cryptology - EUROCRYPT 2004. EUROCRYPT 2004. Lecture Notes in Computer Science, vol 3027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24676-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24676-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21935-4
Online ISBN: 978-3-540-24676-3
eBook Packages: Springer Book Archive