Abstract
We describe a general method to construct codes for unconditional authentication with arbitration (A 2-codes), which protect not only against outside opponents but also against certain types of frauds from the receiver and transmitter. The constructions are based on orthogonal arrays and universal hash classes. The idea is to construct A 2-codes out of pairs of A-codes. The hitherto known examples are special cases of the construction. Along the way we also construct new universal hash classes.
Download conference paper PDF
References
J. Bierbrauer: Universal hashing and geometric codes, to appear in Designs, Codes and Cryptography.
J. Bierbrauer, T. Johansson, G. Kabatianskii, B. Smeets: On families of hash functions via geometric codes and concatenation, Proceedings of CRYPTO’93, Lecture Notes in Computer Science 773 (1994), 331–342.
J.L. Carter, M.N. Wegman: Universal Classes of Hash Functions, J.Computer and System Sci. 18 (1979), 143–154.
E.N. Gilbert, F.J. MacWilliams, N.J.A. Sloane: Codes which detect deception, Bell System Technical Journal 53 (1974), 405–424.
T. Johansson: Lower bounds on the probability of deception in authentication with arbitration, in Proceedings of the 1993 IEEE International Symposium on Information Theory, San Antonio, USA, page 231.
T. Johansson: On the construction of perfect authentication codes that permit arbitration, Proceedings of CRYPTO’93, Lecture Notes in Computer Science 773 (1994), 343–354.
T. Johansson, G. Kabatianskii, B. Smeets: On the relation between A-codes and codes correcting independent errors, Proceedings Eurocrypt 93, 1–11.
K. Kurosawa: New bound on authentication code with arbitration, Proceedings of CRYPTO’94, Lecture Notes in Computer Science 839 (1994), 140–149.
G.J. Simmons: Message authentication with arbitration of transmitter/receiver disputes, Proceedings Eurocrypt 87, 151–165.
G.J. Simmons: A cartesian product construction for unconditionally secure authentication codes that permit arbitration, Journal of Cryptology 2 (1990), 77–104.
D.R. Stinson: The combinatorics of authentication and secrecy codes, Journal of Cryptology 2 (1990), 23–49.
M.N. Wegman, J.L. Carter: New hash functions and their use in authentication and set equality, J.Computer and System Sci. 22 (1981), 265–279.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bierbrauer, J. (1995). A2—codes from universal hash classes. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_25
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive