STRENGTHENING SIMMONS BOUND ON IMPERSONATION

被引:10
作者
JOHANNESSON, R
SGARRO, A
机构
[1] UNIV UDINE,DEPARTIMENTO MATEMAT & INFORMAT,I-33100 UDINE,ITALY
[2] UNIV TRIESTE,DIPARTIMENTO SCI MATEMAT,I-34100 TRIESTE,ITALY
关键词
AUTHENTICATION; IMPERSONATION; DECEPTION; PERFECT AUTHENTICATION;
D O I
10.1109/18.86970
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Simmons' lower bound on impersonation, P(I) greater-than-or-equal-to 2-I(M;E), where M and E denote the message and the encoding rule, respectively, is strengthened by maximizing over the source statistics and by allowing dependence between the message and the encoding rule.
引用
收藏
页码:1182 / 1185
页数:4
相关论文
共 7 条
[1]  
CSISZAR I, 1981, INFORMATION THEORY C
[2]  
Korner J., COMMUNICATION
[3]   AN INTRODUCTION TO CONTEMPORARY CRYPTOLOGY [J].
MASSEY, JL .
PROCEEDINGS OF THE IEEE, 1988, 76 (05) :533-549
[4]  
SGARRO A, 1990, LECT NOTES COMPUT SC, V434, P93
[5]  
SGARRO A, 1989, ADV CRYPTOLOGY EUROC
[6]  
Simmons G. J., 1985, LECTURE NOTES COMPUT, P411, DOI DOI 10.1007/3-540-39568-7_32
[7]  
SIMMONS GJ, 1989, COMMUNICATION 1016