Abstract
We prove a Shannon-theoretic theorem for authentication codes resistant against impersonation and substitution. The code construction is based upon block-designs. We conjecture that this construction is asymptotically the best possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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
A. Sgarro, Information-theoretic bounds for authentication frauds,in “Advances in Cryptology - Eurocrypt ‘82”, ed. by R.A. Rueppel, Springer Verlag, Lecture Notes in Computer Science 658 (1993) 467–471; full version submitted to Journal of Computer Security
A. Sgarro, A Shannon-theoretic coding theorem in authentication theory,in “Eurocode ‘80”, ed. by G. Cohen, P. Charpin, Springer Verlag, Lecture Notes in Computer Science 514 (1991) 282–291
A. Sgarro, An asymptotic coding theorem for authentication and secrecy, Workshop on Sequences 91, Positano, 17–21 June 1991
I. Csiszâr, J. Körner, Information theory, Academic Press, New York, 1982
D. R. Hughes, F. C. Piper, Design theory, Cambridge University Press, 1985
S. Maset, Verso una teoria asintotica dell’autenticazione con impersonazione e sostituzione,Tesi di laurea, Università di Udine, AA 1990–91
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Wien
About this chapter
Cite this chapter
Maset, S., Sgarro, A. (1993). An Asymptotic Theorem for Substitution-Resistant Authentication Codes. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2786-5_17
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82519-8
Online ISBN: 978-3-7091-2786-5
eBook Packages: Springer Book Archive