Authentication codes under impersonation attack
Performance of authentication codes under impersonation attack is considered. We assume two classes of strategies for the enemy and give expressions for the probability of success in each case and study the relationship of the two classes. We prove a new lower bound on the probability of deception which points out the importance of the average-distance between the encoding rules of the code in the protection provided by it. Codes with perfect protection for each class are characterized and some constructions based on error correcting codes are proposed.
Unable to display preview. Download preview PDF.
- 1.J.L. Massey, Cryptography, a selective survey, Digital Communications, ed. E. Biglieri and G. Pratti, Elsvier Science Publ., North-Holland, (1986), 3–25.Google Scholar
- 2.G.J. Simmons, Authentication theory/coding Theory, Proc. of Crypto '84, Lect. Notes in Comp. Science 196, (1985), 411–432Google Scholar
- 3.G.J. Simmons, A game theory model of digital message authentication, Congressus Numerantium 34, (1982), 413–424Google Scholar
- 4.E.G. Gilbert, F.J. MacWilliams, N.J. Sloane, Codes which Detect Deception, Bell Sys. Tech. J., 53–3, (1974), 1–19Google Scholar
- 5.F.J. MacWilliams and N.J. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, 1978Google Scholar
- 6.M. De Soete, Some constructions for authentication-secrecy codes, Advances in Cryptology, Eurocrypt '88, (1988), 51–55Google Scholar
- 7.E.F. Brickell, A few results on Message Authentication, Proc. of the 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Boca raton LA, (1984), 141–145Google Scholar
- 8.D.R. Stinson, Combinatorial characterization of authentication codes, Proceedings Crypto 91, Lecture Notes in Computer Science 576, (1992), 62–72Google Scholar
- 9.D.R. Stinson, The combinatorics of authentication and secrecy codes, Journal Cryptology 2, (1990), 23–49Google Scholar