Abstract
We study authentication codes (A-codes) where it is assumed that the enemy has access to the content of the intercepted cryptogram. This is similar to plaintext attack in secrecy systems. Enemy's success is denned in two ways. The first is as in Simmons' model. We will also consider chosen-content attacks in which the success is by constructing a fraudulent cryptogram with a given content. We will obtain information theoretic bounds, define perfect protection and obtain lower bounds on the number of encoding rules for codes with perfect protection against chosen-content impersonation and chosen-content plaintext substitution. We characterize these A-codes when the number of encoding rules is minimum. We give methods for making an A-code resistant against plaintext and chosen-context plaintext attack.
Support for this project was partly provided by Australian Research Council grant A49030136.
Support for this project was provided by Australian Research Council grant A49030136.
Chapter PDF
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
G. Simmons, A game theory model of digital message authentication, Congressus Numerantium 34 (1982), 413–424.
G.J. Simmons, Authentication theory/coding theory, Lecture Notes in Comput. Sci. 196, Proceedings of Crypto 84, Springer-Verlag, 1985, pp. 411–431.
C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, 28 (1949), 656–715.
B. Smeets, P. Vanrose, Zhe-Xian Wan, On the construction of Authentication codes with secrecy and codes withstanding spoofing attack of order L ≥ 2, Lecture Notes in Comput. Sci. 473, Proceedings of Eurocrypt '90, Springer-Verlag, (1990), 307–312.
D.R. Stinson, Some constructions and bounds for authentication codes, Journal of Cryptology 1, (1988), 37–51.
D.R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology 2, (1990), 23–49.
D.R. Stinson, Combinatorial characterization of authentication codes, Lecture Notes in Comput. Sci. 576, Proceedings of Crypto 91, Springer-Verlag, 1992, 62–72.
J.H. Dinitz, D. Stinson, Contemporary Design Theory. A Collection of Surveys, A Wiley Interscience Publications, JOHN WILEY & SONS, INC, 1992.
D. Pei Information-Theoretic bounds for authentication codes and PBIB, Proceedings Asiacrypt, (1991), Rump Session.
J. Bierbrauer, Y. Edel Theory of Perpendicular Arrays, submitted to Journal of Combinatorial Designs.
U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, Journal of Cryptology, No 3, Vol 6, (1993), 135–156.
T. Johansson, B. Smeets, G. Kabatianskii, On the relation between A-codes and codes correcting independent errors, Preproceedings of Eurocrypt '93, Norway, (1993), M1–M10.
Y. Desmedt, M. Yung, Unconditional subliminal-freeness in unconditional authentication systems, In preparation, Abstract appeared in Proceedings 1991 IEEE International Symposium on Information Theory, p. 176.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Tombak, L. (1995). Authentication codes in plaintext and chosen-content attacks. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053441
Download citation
DOI: https://doi.org/10.1007/BFb0053441
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive