Several properties of authentication codes depend on a simple underlying mathematical structure, which we call below a fraud scheme. Relying on this fact, we are able to derive in an easy and compact way a whole range of information-theoretic lower bounds to fraud probabilities in authentication coding.
Get full access to this article
View all access options for this article.
References
1.
SimmonsG.A survey of information authentication, Proceedings of the IEEE, 1988, May issue, pp. 603–620.
2.
MasseyJ. L.An introduction to contemporary cryptology, Proceedings of the IEEE, 1988, May issue, pp. 533–549.
3.
CsiszárI. and KörnerJ.Information Theory, Academic Press, New York, 1981.
4.
JohannessonR. and SgarroA.Strengthening Simmons' bound on impersonation, IEEE Transactions on Information Theory, vol. IT-37, n. 4, pp. 1182–1185, 1991.
5.
SgarroA.Lower bounds for authentication codes with splitting, pp. 283–293 in Advances in Cryptology - Eurocrypt '90, (DamgårdI. B. ed.), Lecture Notes in Computer Science, 473, Springer Verlag, Berlin, 1991.
6.
SgarroA.Informational-divergence bounds for authentication codes, pp. 93–101 in Advances in Cryptology - Eurocrypt '89, (QuisquaterJ.-J. and VandewalleJ. ed.), Lecture Notes in Computer Science, 434, Springer Verlag, Berlin, 1990.
7.
SimmonsG. J. and SmetsB.A paradoxical result in unconditionally secure authentication codes and an explanation, pp. 231–258 in Cryptography and Coding II, (MitchellC. J. ed.), Oxford University Press, 1992.
8.
SmetsB.Bounds on the probability of deception in multiple authentication, preprint, 1992.
