Name
Abstract | ||
|---|---|---|
Multireceiver authentication codes allow one sender to construct an authenticatedmessage for a group of receivers such that each receiver can verifyauthenticity of the received message. In this paper, we give a formal definitionof multireceiver authentication codes, derive information theoretic andcombinatorial lower bounds on their performance and give new efficient andflexible constructions for such codes. Finally we extend the basic model to thecase that multiple messages are... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/inco.1998.2769 | Inf. Comput. |
Keywords | DocType | Volume |
multireceiver authentication code4,lower bound | Journal | 151 |
Issue | ISSN | Citations |
1-2 | Information and Computation | 24 |
PageRank | References | Authors |
1.26 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Safavi-Naini | 1 | 173 | 17.60 |
| Huaxiong Wang | 2 | 1701 | 142.11 |