Abstract
The role of non-deterministic authentication coding (coding with splitting) is discussed; a new substitution attack is put forward which is argued to be more relevant than usual substitution for codes with splitting. A reduction theorem is proved which allows to extend “abstract” bounds for impersonation (including the new JS-bound, which is shown to hold on the large class of “abstract” authentication codes) to the new substitution attack.
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. J. Simmons “A survey of information authentication”, Proceedings of the IEEE, may 1988, 603–620
J. Massey “An introduction to contemporary cryptology”, Proceedings of the IEEE, may 1988, 533–549
R. Johannesson, A. Sgarro “Strengthening Simmons’ bound on impersonation”, submitted
A. Sgarro “Informational-divergence bounds for authentication codes”, Proceedings of Eurocrypt 89, Houthalen, April 1989
M.-G. Croatto “Codifica probabilistica nei sistemi di segretezza e autenticazione”, tesi di laurea, Università di Udine, marzo 1990
A. Sgarro “Towards a coding theorem in authentication theory”, IEEE Information Theory Workshop, Eindhoven, June 1990
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sgarro, A. (1991). Lower Bounds for Authentication Codes with Splitting. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive