A < sup> 2 -codes from universal hash classes

Document Type

Conference Proceeding

Publication Date



© Springer-Verlag Berlin Heidelberg 1995. 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)