LOWER BOUNDS FOR AUTHENTICATION CODES WITH SPLITTING

被引：0

作者：

SGARRO, A

机构：

[1] UNIV UDINE,DEPT MATH & COMP SCI,I-33100 UDINE,ITALY

[2] UNIV TRIESTE,DEPT MATH SCI,I-34100 TRIESTE,ITALY

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 473卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The role of non-deterministic authentication coding (coding with splitting) is discussed; a new substitution attack is put forward which is argued to be more relevant than usual substitution for codes with splitting. A reduction theorem is proved which allows to extend "abstract" bounds for impersonation (including the new JS-bound, which is shown to hold on the large class of "abstract" authentication codes) to the new substitution attack.

引用

页码：283 / 293

页数：11

共 50 条

[1] Combinatorial bounds and characterizations of splitting authentication codes
Michael Huber
[J]. Cryptography and Communications, 2010, 2 : 173 - 185
[2] BOUNDS AND CONSTRUCTIONS FOR AUTHENTICATION - SECRECY CODES WITH SPLITTING
DESOETE, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 403 : 311 - 317
[3] Combinatorial bounds and characterizations of splitting authentication codes
Huber, Michael
[J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2010, 2 (02): : 173 - 185
[4] INFORMATIONAL DIVERGENCE BOUNDS FOR AUTHENTICATION CODES
SGARRO, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 93 - 101
[5] Linear authentication codes: Bounds and constructions
Wang, HX
Xing, CP
Safavi-Naini, R
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) : 866 - 872
[6] Combinatorial bounds on authentication codes with arbitration
Kurosawa, K
Obana, S
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2001, 22 (03) : 265 - 281
[7] Combinatorial Bounds on Authentication Codes with Arbitration
Kaoru Kurosawa
Satoshi Obana
[J]. Designs, Codes and Cryptography, 2001, 22 : 265 - 281
[8] Bounds and constructions for multireceiver authentication codes
Safavi-Naini, R
Wang, H
[J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT'98, 1998, 1514 : 242 - 256
[9] SOME CONSTRUCTIONS AND BOUNDS FOR AUTHENTICATION CODES
STINSON, DR
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 418 - 425
[10] On Lower Bounds for Covering Codes
Bhandari M.C.
Chanduka K.K.P.
Lal A.K.
[J]. Designs, Codes and Cryptography, 1998, 15 (3) : 237 - 243

← 1 2 3 4 5 →