The combinatorics of authentication and secrecy codes
Journal of Cryptology
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the construction of perfect authentication codes that permit arbitration
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Universal Hashing and Geometric Codes
Designs, Codes and Cryptography
New Bound on Authentication Code with Arbitration
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Combinatorial Bounds on Authentication Codes with Arbitration
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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.