Abstract
We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when enemy uses plaintext or chosen plaintext attack. A-codes with minimum number of encoding rules that provide perfect protection for impersonation and substitution in these attacks are characterized and a general method of constructing A-codes that provide perfect protection for these attacks, using A-codes that provide perfect protection in its traditional sense, are given. The constructions are optimal as they produce A-codes with minimum number of encoding rules if the original A-code has the same property.
Original language | English |
---|---|
Title of host publication | IEEE International Symposium on Information Theory, 1994 |
Place of Publication | Pistacaway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1-1 |
Number of pages | 1 |
ISBN (Print) | 0780320158 |
DOIs | |
Publication status | Published - 1994 |
Externally published | Yes |
Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994 |
Other
Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
---|---|
City | Trodheim, Norw |
Period | 27/06/94 → 1/07/94 |