Abstract
We study authentication codes (A-codes) when the enemy has access to the content of the intercepted cryptogram. This is similar to plaintext attack in secrecy systems. Enemy's success is defined 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 of making an A-code resistant against plaintext and chosen-context plaintext attack.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Simmons, A game theory model of digital message authentication, Congressus Numerantiurn, Vol. 34 (1982) pp. 413–424.
G. J. Simmons, Authentication theorylcoding theory, Lecture Notes in Comput. Sci., Proceedings of Crypto 84, Springer-Verlag, 196 (1985) pp. 411–431.
C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28 (1949), pp. 656–715.
B. Smeets, P. Vanrose, and Zhe-Xian Wan, On the construction of Authentication codes with secrecy and codes withstanding spoofing attack of order L ≥ 2, Lecture Notes in Comput. Scl., Proceedings of Eurocrypt '90, Springer-Verlag, 473 (1990), pp. 307–312.
D. R. Stinson, Some constructions and bounds for authentication codes, Journal of Cryptology, Vol. 1 (1988) pp. 37–51.
D. R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology, Vol. 2 (1990) pp. 2349.
D. R. Stinson, Combinatorial charactenzatlon of authentication codes, Lecture Notes in Comput. Sci., Proceedings of Crypto 91, Springer-Verlag, 576 (1992) pp. 62–72.
J. H. Dinitz and 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 and Y. Edel, Theory of perpendicular arrays, submitted to Journal of Combinatorial Designs.
U. Roscnbaum, A lower bound on authcnticdion after having observed a sequence of messages, Journal of Cryptology,Vol. 6, No. 3 (1993) pp. 135–156.
T. Johansson, B. Smeets, and G. Kabatianskii, On the relation belween A-codes and codes correcting independent errors, Preproceedings of Eurocrypt '93, Norway MI-MI 0 (1993).
A. Sgarro, Information-theoretic bounds for authentication frauds, Journal of Computer Security, Vol. 2 (1993) pp. 53–63.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Safavi-Naini, R., Tombak, L. Authentication Codes in Plaintext and Chosen-Content Attacks. Designs, Codes and Cryptography 7, 83–99 (1996). https://doi.org/10.1023/A:1018048713377
Issue Date:
DOI: https://doi.org/10.1023/A:1018048713377