Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
Some constructions and bounds for authentication codes
Journal of Cryptology
Some constructions for authentication-secrecy codes
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Bounds and constructions for authentication-secrecy codes with splitting
CRYPTO '88 Proceedings 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
| Hi-index | 0.00 |
If we agree to use one of v possible messages to communicate one of k possible source states, then an opponent can successfully impersonate a transmitter with probability at least k / v, and can successfully substitute a message with a fraudulent one with probability at least (k - 1) / (v - 1). We wish to limit an opponent to these bounds. In addition, we desire that the observation of any two messages in the communication channel will give an opponent no clue as to the two source states. We describe a construction for a code which achieves these goals, and which does so with the minimum possible number of encoding rules (namely, v(v -1) / 2). The construction uses a structure from combinatorial design theory known as a perpendicular array.