Multireceiver authentication codes: Models, bounds, constructions, and extensions

被引：47

作者：

Safavi-Naini, R ^{[1
]}

Wang, H ^{[1
]}

机构：

[1] Univ Wollongong, Sch IT & CS, Wollongong, NSW 2522, Australia

来源：

INFORMATION AND COMPUTATION | 1999年 / 151卷 / 1-2期

基金：

澳大利亚研究理事会;

关键词：

D O I：

10.1006/inco.1998.2769

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal definition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance, and give new efficient and flexible constructions for such codes. Finally, we extend the basic model to the case that multiple messages are sent and the case that the sender can be any member of the group. (C) 1999 Academic Press.

引用

页码：148 / 172

页数：25

共 24 条

[1] ATICI M, 1996, LNCS, V1109, P16
[2] BLOM R, 1985, LECT NOTES COMPUT SC, V209, P335
[3] Blundo C., 1993, LNCS, V740, P471
[4] BRICKELL EF, 1984, C NUMERANTIUM, V43, P141
[5] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[6] DESMEDT Y, 1992, IEEE INFOCOM SER, P2045, DOI 10.1109/INFCOM.1992.263476
[7] DYER M, 1995, J CRYPTOL, V8, P189, DOI 10.1007/BF00191355
[8] FAMILIES OF FINITE SETS IN WHICH NO SET IS COVERED BY THE UNION OF R OTHERS
ERDOS, P
FRANKL, P
FUREDI, Z
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1985, 51 (1-2) : 79 - 89
[9] FAMILIES OF FINITE SETS IN WHICH NO SET IS COVERED BY THE UNION OF 2 OTHERS
ERDOS, P
FRANKL, P
FUREDI, Z
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (02) : 158 - 166
[10] Fiat A., 1994, LECT NOTES COMPUTER, V773, P480, DOI DOI 10.1007/3-540-48329-2

← 1 2 3 →