Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2009_21_3_a5, author = {A. Yu. Zubov}, title = {On the game-theoretical approach to the analysis of authentication codes}, journal = {Diskretnaya Matematika}, pages = {45--72}, publisher = {mathdoc}, volume = {21}, number = {3}, year = {2009}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2009_21_3_a5/} }
A. Yu. Zubov. On the game-theoretical approach to the analysis of authentication codes. Diskretnaya Matematika, Tome 21 (2009) no. 3, pp. 45-72. http://geodesic.mathdoc.fr/item/DM_2009_21_3_a5/
[1] Vorobev N. N., Teoriya igr, Nauka, Moskva, 1985 | MR
[2] Den Boer B., “A simple and key-economical unconditional authentication scheme”, J. Computer Security, 2 (1993), 65–71
[3] Johansson T., Kabatianskii G., Smeets`B., “On the relation between $A$-codes and codes correcting independent errors”, Lect. Notes Computer Sci., 765, 1994, 1–11 | MR | Zbl
[4] Simmons G. J., “A game theoretical model of digital message authentication”, Congressus Numerantium, 34 (1982), 413–424 | MR | Zbl
[5] Simmons G. J., “Message authentication: A game on hypergraphs”, Congressus Numerantium, 45 (1984), 161–192 | MR | Zbl
[6] Simmons G. J., “Authentication theory/Coding theory”, Lect. Notes Computer Sci., 196, 1985, 411–432
[7] Simmons G. Dzh., “Obzor metodov autentifikatsii informatsii”, TIIER, 76:5 (1988), 105–125
[8] Stinson D. R., “Universal hashing and authentication codes”, Designs, Codes and Cryptography, 4 (1994), 369–380 | DOI | MR | Zbl