Abstract
In this paper we define an optimal authentication systems as a system whose minimum probability of deception is k/M, k and M being the number of source states and cryptograms respectively, and satisfies information theoretic bounds on the value of impersonation and substitution games. We will characterize order-1 perfect systems and δ-perfect systems and prove their optimality when E, the number of encoding rules, satisfies certain bounds. We will show that both types of systems, in this case, also have best game theoretic performance. This will be used to prove that optimal systems exist only if E ≥ M 2/k 2 and for less value of E probability of deception is always greater than k/M. We will prove that doubly perfect codes are optimal systems with minimum value of E and perfect systems are not optimal. Characterization of doubly perfect systems follows from characterization theorems mentioned earlier. We give constructions for each class.
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
References
E. Brickell, A Few Results in Message Authentication, Congressus Numerantium, vol 43, 1984, pp 141–154.
R. Johansen, A. Sgarro Strengthening Simmons’ Bound in Impersonation, IEEE Transactions on Information Theory, vol 37, No 4, July 1991, pp 1182–1185.
J.L. Massey, Cryptography-A Selective Survey, Proc. of 1985 Int. Tirrenia Workshop on Digital Communication, Tirrenia, 1985, Digital Communications, ed. E. Biglieri and G. Pratti, Elsevier Science Publ., 1986, North-Holland, pp 3–25
J.L. Massey, Introduction to Contemporary Cryptography, Proceedings of the IEEE, vol 76, No 5, May 1988, pp 533–549.
D. Pei Information-Theoretic Bounds for Authentication Codes and PBIB, Asiacrypt 1991, Ramp Session.
R. Safavi, L. Tombak, Authentication Codes under Impersonation Attack, Proc. of Auscrypt 1992, to appear.
G.J. Simmons, Message Authentication: A Game on Hypergraphs, Congressus Numerantium, Vol 45, 1984, pp 161–192.
G.J. Simmons, Authentication Theory/Coding Theory, Proc. of Crypto 84, Lecture Notes in Computer Science 196, Springer 1985, pp 411–432.
G.J. Simmons, A Game Theory Model of Digital Message Authentication, Congressus Numerantium, Vol. 34, 1982, pp 413–424.
G.J. Simmons, A Survey of Information Authentication, Proceedings of the IEEE vol 76, No 5, May 1988, pp 603–619.
D.R. Stinson, Some Constructions and Bounds for Authentication Codes, Journal of Cryptology, No 1, 1988, pp 37–51.
D.R. Stinson, The Combinatorics of Authentication and Secrecy Codes, Journal of Cryptology, No 2 (1990), pp 23–49.
D.R. Stinson, Combinatorial Characterization of Authentication Codes, Proceedings Crypto 91, Lecture Notes in Computer Science 576, Springer 1992, pp 62–72.
L. Tombak, R. Safavi, Authentication Codes with Perfect Protection, Proc. of Auscrypt 1992, to appear.
M. Walker Information-Theoretic Bounds for Authentication Schemes, Journal of Cryptology, No 2, 1990, pp 131–143.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Tombak, L. (1994). Optimal Authentication Systems. In: Helleseth, T. (eds) Advances in Cryptology — EUROCRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, vol 765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48285-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-48285-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57600-6
Online ISBN: 978-3-540-48285-7
eBook Packages: Springer Book Archive