Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1515/JMC.2008.002 | JOURNAL OF MATHEMATICAL CRYPTOLOGY |
Keywords | Field | DocType |
Authentication code, multi-message, multi-receiver, TWOOA | Discrete mathematics,Broadcasting,Transmitter,Orthogonal array,Authentication,Message authentication code,Cryptography,Computer science,Data Authentication Algorithm | Journal |
Volume | Issue | ISSN |
2 | 1 | 1862-2976 |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryoh Fuji-Hara | 1 | 181 | 11.69 |
| Xiyang Li | 2 | 10 | 3.02 |
| Ying Miao | 3 | 491 | 43.85 |
| Dianhua Wu | 4 | 114 | 16.90 |