LOWER BOUNDS ON THE PROBABILITY OF DECEPTION IN AUTHENTICATION WITH ARBITRATION

被引：39

作者：

JOHANSSON, T

机构：

[1] Department of Information Theory, University of Lund

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1994年 / 40卷 / 05期

关键词：

AUTHENTICATION; AUTHENTICATION CODES; ARBITRATION; INFORMATION-THEORETIC BOUNDS; UNCONDITIONAL SECURITY;

D O I：

10.1109/18.333869

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This 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.

引用

页码：1573 / 1585

页数：13

共 14 条

[1] BRICKELL EF, 1988, 1988 P EUR 88 DAV, P51
[2] CSISZAR I, 1981, INFORMATION THEORY C, P48
[3] DESMEDT Y, P CRYPTO 90 BERLIN, P177
[4] FELLER W, 1966, INTRO PROBABILITY TH, V2, P153
[5] GALLAGER RG, 1968, INFORMATION THEORY R
[6] CODES WHICH DETECT DECEPTION
GILBERT, EN
MACWILLIAMS, FJ
SLOANE, NJA
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1974, 53 (03): : 405 - 424
[7] STRENGTHENING SIMMONS BOUND ON IMPERSONATION
JOHANNESSON, R
SGARRO, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1182 - 1185
[8] JOHANSSON T, 1994, P EUROCRYPT 93 BERLI, P1
[9] MASSEY JL, 1991, CONT CRYPTOLOGY SCI, P3
[10] Simmons G. J., 1990, Journal of Cryptology, V2, P77, DOI 10.1007/BF00204449

← 1 2 →