Abstract
Suppose that A wants t o send a message M to B. It is important that B receives the message without any alteration. On the other hand, a bad guy X looks for his chance to alter M in his favour. In order t o make the bad guy’s life difficult, A authenticates the message M.
Chapter PDF
Similar content being viewed by others
References
Dembowski, P: Finite Geometries. Springer-Verlag, 1968.
E.N. Gilbert, F.J. MacWilliams, N.J.A. Sloane: Codes which detect deception. Bell. Syst. Tech. J. 53 (1974), 405–424.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beutelspacher, A. (1988). Perfect and Essentially Perfect Authentication Schemes. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive