Name
Abstract | ||
|---|---|---|
In this paper we study authentication codes (A-codes) that are r-fold secure against spoofing. We obtain necessary and sufficient conditions for such codes and give a characterization of codes with a minimum number of encoding rules. We will show that if the source is uniform, A-codes that provide perfect protection against spoofing attack of order r are r-fold secure. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1145/191177.191211 | ACM Conference on Computer and Communications Security |
Keywords | Field | DocType |
sufficient condition,spoofing attack,perfect protection,minimum number,encoding rule,order r,authentication code,cryptography,authentication,computer security | Internet privacy,Authentication,Spoofing attack,Cryptography,Computer security,Computer science,Computer network,Data Authentication Algorithm,Encoding (memory) | Conference |
Volume | ISSN | ISBN |
48 | 0315-3681 | 0-89791-732-4 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Tombak | 1 | 6 | 2.29 |
| R. Safavi-Naini | 2 | 173 | 17.60 |