Abstract
Consider the situation whereby each member of a sequence of n distinct messages from a finite source space is provided with an authentication check, generated using one and the same encoding rule selected from a finite space of such rules. Let P(n) be the expected probability that a spoofer, who observes such a sequence of messages and their corresponding authentication checks, but does not know the encoding rule in advance, succeeds in generating the correct authentication check for a different message in the source space. The purpose of this paper is to derive a lower bound for the average P Nof the probabilities P(0), P(1),...;, P(N) in terms of the entropy of the space of encoding rules, and to derive necessary and sufficient conditions which the encoding scheme must satisfy in order to ensure that this bound cannot be exceeded.
Article PDF
Similar content being viewed by others
References
G. Castagnoli, Comments on Massey's concepts of perfect secrecy and perfect authenticity, Alta Frequenza, Vol. LVI, No. 4 (1987), 227–228.
M. De Soete, Some constructions for authentication—secrecy codes, Advances in Cryptology—Proceedings of Eurocrypt 88, Lecture Notes in Computer Science, Vol. 330, Springer-Verlag, Berlin, 1988, pp. 57–75.
M. De Soete, K. Vedder, and M. Walker, Authentication schemes (to appear in the Proceedings of Eurocrypt 89).
V. Fak, Repeated use of codes which detect deception, IEEE Transactions on Information Theory, Vol. IT-25, No. 2 (1979), 233–234.
E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell System Technical Journal, Vol. 53 (1974), 405–424.
J. Massey, Cryptography—a selective survey, Alta Frequenza, Vol. LV, No. 1 (1986), 4–11.
P. Schobi, Perfect authentication systems for data sources with arbitrary statistics (Preprint).
G. J. Simmons, Authentication theory/coding theory, Advances in Cryptology—Proceedings of Crypto 84, Lecture Notes in Computer Science, Vol. 196, Springer-Verlag, Berlin, 1985, pp. 411–431
D. R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs, Journal of Cryptology, Vol. 1 (1988), 119–127.
D. R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology, Vol. 2 (1990), 23–49.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Walker, M. Information-theoretic bounds for authentication schemes. J. Cryptology 2, 131–143 (1990). https://doi.org/10.1007/BF00190800
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00190800