Abstract
Several properties of authentication codes depend on a mathematical structure, called below a fraud scheme, which is much simpler than the one originally given. Relying on this fact, we present a powerful lower bound, which is a sort of mould to painlessly derive a whole range of information-theoretic bounds to fraud probabilities in authentication coding.
Short version
Chapter PDF
Similar content being viewed by others
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 survey of information authentication”, Proceedings of the IEEE, may 1988, 603–620
R. Johannesson, A. Sgarro, “Strengthening Simmons’ bound on impersonation”, IEEE Transactions on Information Theory, vol.IT-37, n.4 (1991) 1182–1185
A. Sgarro, “Lower bounds for authentication codes with splitting”, in “Advances in Cryptology — Eurocrypt’ 90”, ed. by I. B. Damgård, Springer Verlag, Lecture Notes in Computer Science 473 (1991) 283–293
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sgarro, A. (1993). Information-Theoretic Bounds for Authentication Frauds. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_41
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive