A TWOOA construction for multi-receiver multi-message authentication codes

被引：3

作者：

Fuji-Hara, Ryoh ^{[1
]}

Li, Xiyang ^{[2
]}

Miao, Ying ^{[3
]}

Wu, Dianhua ^{[4
]}

机构：

[1] Univ Tsukuba, Grad Sch Syst & Informat Engn, Dept Social Syst & Management, Tsukuba, Ibaraki 3058573, Japan

[2] Guangxi Normal Univ, Dept Math, Guilin 541004, Peoples R China

[3] Univ Tsukuba, Grad Sch Syst & Informat Engn, Dept Social Syst & Management, Tsukuba, Ibaraki 3058573, Japan

[4] Guangxi Normal Univ, Dept Math, Guilin 541004, Peoples R China

来源：

JOURNAL OF MATHEMATICAL CRYPTOLOGY | 2008年 / 2卷 / 01期

关键词：

Authentication code; multi-message; multi-receiver; TWOOA;

D O I：

10.1515/JMC.2008.002

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A (k; n; w) multi-receiver multi-message authentication code allows a transmitter to broadcast up to w 1 distinct authenticated messages to n receivers in such a way that (1) not only an opponent but also any up to k 1 receivers cannot cheat any other receivers, and (2) all the receivers can independently verify the authenticity of the messages. Obana and Kurosawa [Designs, Codes and Cryptography, 22 (2001), pp. 47-63] used a special pair of orthogonal arrays, calledTWOOA, to construct a (k; n; 2) multi-receiver single-message authentication code. In this paper, we generalize the notion of a TWOOA, and then use this generalized TWOOA to construct a (k; n; w) multi-receiver multi-message authentication code, which exceeds that of Safavi-Naini and Wang [Proc. of Eurocrypt' 98, LNCS 1403, Springer (1998), pp. 527-541] at least in the numbers of receivers and authenticated messages. The structures of TWOOAs are investigated. Two constructions for TWOOAs are also provided.

引用

页码：9 / 28

页数：20

共 14 条

[1]

Colbourn C.J., 1996, CRC HDB COMBINATORIA

[2]

DESMEDT Y, 1992, IEEE INFOCOM SER, P2045, DOI 10.1109/INFCOM.1992.263476

[3] CODES WHICH DETECT DECEPTION [J].

GILBERT, EN ;

MACWILLIAMS, FJ ;

SLOANE, NJA .

BELL SYSTEM TECHNICAL JOURNAL, 1974, 53 (03) :405-424

[4]

HIRSCHFELD JWP, 1983, LONDON MATH SOC LECT, V82, P55

[5]

Kurosawa K, 1997, LECT NOTES COMPUT SC, V1270, P204, DOI 10.1007/BFb0027927

[6]

Li Yuqiang, 1999, Acta Mathematicae Applicatae Sinica, V22, P91

[7]

MacWilliams F. J., 1977, THEORY ERROR CORRE 1

[8]

Massey J. L., 1986, Digital Communications. Proceedings of the Second Tirrenia International Workshop, P3

[9] Bounds and combinatorial structure of (k,n) multi-receiver A-codes [J].

Obana, S ;

Kurosawa, K .

DESIGNS CODES AND CRYPTOGRAPHY, 2001, 22 (01) :47-63

[10]

Safavi-Naini R, 1998, LECT NOTES COMPUT SC, V1403, P527, DOI 10.1007/BFb0054151

← 1 2 →