DocumentCode
1197714
Title
Lower bounds on the probability of deception in authentication with arbitration
Author
Johansson, Thomas
Author_Institution
Dept. of Inf. Theory, Lund Univ., Sweden
Volume
40
Issue
5
fYear
1994
fDate
9/1/1994 12:00:00 AM
Firstpage
1573
Lastpage
1585
Abstract
The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality
Keywords
codes; combinatorial mathematics; encoding; message authentication; probability; arbitration; authentication; probability of deception; probability of success; projective space; receiver; secure authentication codes; transmitter; Authentication; Entropy; Helium; Information geometry; Information security; Information theory; Protection; Random variables; Student members; Transmitters;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.333869
Filename
333869
Link To Document