Abstract
For the authentication model with arbitration (A 2-code), Johansson showed a lower bound on the size of encoding rules. However, this bound is no longer tight if the size of source states is large. This paper presents a more tight lower bound on the size of encoding rules for large source states. An A 2-code is shown which approximately meets the proposed bound, also. Further, we show that the size of encoding rules for the transmitter can be greatly reduced if the receiver’s cheating probability is slightly large.
Chapter PDF
References
E.N. Gilbert, F.J. MacWilliams and N.J.A. Sloane, “Codes which detect deception”, Bell Syst. Tech. J., Vol.53, 1974, pp.405–424
G.J. Simmons, “Authentication theory/coding theory”, in Advances in Cryptology, Proceedings of CRYPTO 84, G.R. Blakley and D. Chaum, Eds. Lecture notes in Computer Science, No.196. New York, NY: Springer, 1985, pp.411–431.
J.L. Massey, “Contemporary Cryptology, An Introduction”, in Contemporary Cryptology, The Science of Information Integrity, G.J. Simmons, Ed., IEEE Press, 1991, pp.3–39.
G.J. Simmons, “A survey of Information Authentication”, in Contemporary Cryptology, The science of information integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.
D.R. Stinson, Combinatorial Characterization of Authentication Codes, Proceedings Crypto 91, Lecture Notes in Computer Science 576, Springer 1992, pp 62–72.
G.J. Simmons, “Message authentication with arbitration of transmitter/receiver disputes”, in Proceedings of Eurocrypt’ 87.
G.J. Simmons, “A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration”, in Journal of Cryptology, Vol.2, no.2, 1990, pp.77–104.
Thomas Johansson, “Lower Bounds on the Probability of Deception in Authentication with Arbitation”, in Proceedings of 1993 IEEE International Symposium on Information Theory, San Antonio, USA, January 17–22, 1993, p.231
Thomas Johansson, “On the construction of perfect authentication codes that permit arbitration”, Crypto 93
D.R. Stinson, “The combinatorics of authentication and secrecy codes”, Journal of Cryptology, Vol.2, 1990, pp.23–49.
M.N. Wegman and J.L. Carter. New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22(1981), 265–279.
D.R. Stinson, “Universal Hashing and authentication codes” Proceeding of Crypto 91, Santa, Barbara, USA, 1991, pp.74–85
Jürgen Bierbrauter, Thomas Johanssen, Gregory Kabatianskii, Ben Smeets, “On Families of Hash Functions via Geometic Codes Concatination”, Crypto 93
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K. (1994). New Bound on Authentication Code with Arbitration. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive