DocumentCode :
2625685
Title :
Authentication codes and plaintext attack
Author :
Safavi-Naini, R. ; Tombak, L. ; Pieprayk, J.
Author_Institution :
Dept. of Comput. Sci., Wollongong Univ., NSW, Australia
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
500
Abstract :
We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when the 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
Keywords :
codes; cryptography; message authentication; probability; A-codes; authentication codes; cryptograms; encoding rules; impersonation; lower bounds; optimal construction; perfect protection; plaintext attack; probability; substitution; Authentication; Computer science; Councils; Cryptography; Encoding; Game theory; Protection; Security;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.395115
Filename :
395115
Link To Document :
بازگشت