Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
Authentication codes with multiple arbiters
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
The combinatorics of authentication and secrecy codes
Journal of 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 Authentication Codes
CRYPTO '91 Proceedings of the 11th 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 |
Authentication codes that permit arbitration axe codes that unconditionally protect against deceptions from the outsiders and additionally also protect against some forms of deceptions from the insiders. Simmons introduced this authentication model and he also showed a way of constructing such codes, called the Cartesian product construction. We present a general way of constructing such codes and we also derive two specific classes of such codes. One that is perfect in the sense that it meets the lower bounds on the size of the transmitter's and the receiver's keys and one that allows the number of source states to be chosen arbitrarily large.