A2-codes from universal hash classes
Document Type
Conference Proceeding
Publication Date
1995
Department
Department of Mathematical Sciences
Abstract
We describe a general method to construct codes for unconditional authentication with arbitration (A2-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 A2-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.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Bierbrauer, J.
(1995).
A2-codes from universal hash classes.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
921, 311-318.
http://doi.org/10.1007/3-540-49264-X_25
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4010