Linear authentication codes: Bounds and constructions

IEEE Transactions on Information Theory

Volumn 49, Issue 4, 2003, Pages 866-872

  Wang, Huaxiong ^a   Xing, Chaoping ^b,c   Safavi Naini, Rei ^d  

^a MACQUARIE UNIVERSITY   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^d UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Authentication codes (A codes); Distributed A codes; Linear A codes

Indexed keywords

INFORMATION THEORY; PARAMETER ESTIMATION; PROBABILITY; VECTORS;

AUTHENTICATION CODES;

CODES (SYMBOLS);

EID: 0037399287     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.809567     Document Type: Article

References (28)

1. J. Bierbrauer, "Universal hashing and geometric codes," Des, Codes Cryptogr., vol. 11, pp. 207-221, 1997.
2. J. Bierbrauer, T. Johansson, G. Kabatianskii, and B. Smeets, "On families of hash functions via geometric codes and concatenation," in Advances in Cryptology - CRYPTO'93 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 773, pp. 331-342.
3. E. F. Brickell, "A few results in message authentication," Congressus Numerantium, vol. 43, pp. 141-154, 1984.
4. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol. 18, pp. 143-154, 1979.
5. B. den Boer, "A simple and key-economical unconditional authentication scheme," J. Comput. Security, vol. 2, pp. 65-71, 1993.
6. Y. Desmedt, "Society and group oriented cryptology: A new concept," in Advances in Cryptography - CRYPTO '87 (Lecture Notes in Computer Science). Berlin, Germany: Sprilnger-Verlag, 1988, vol. 293, pp. 120-127.
7. Y. Desmedt, Y. Frankel, and M. Yung, "Multi-receiver/Multi-sender network security: Efficient authenticated multicast/feedback," in Proc. IEEE INFOCOM'92, 1992, pp. 2045-2054.
8. M. van Dijk, C. Gehrmann, and B. Smeets, "Unconditionally secure group authentication," Des., Codes Cryptogr., vol. 14, pp. 281-296, 1998.
9. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm., vol. 21, no. 1, pp. 1-12, 1985.
10. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, "Codes which detect deception," Bell Syst. Tech. J., vol. 33, pp. 405-424, 1974.
11. T. Johansson, "Contributions to unconditionally secure authentication," Ph.D. dissertation, Lund Univ., Lund, Sweden, 1994.
12. _, "Authentication codes for nontrusting parties obtained from rank metric codes," Des., Codes Cryptogr., vol. 6, pp. 205-218, 1995.
13. _, "Further results on asymmetric authentication schemes," Inform. Comput., vol. 151, no. 1/2, pp. 100-133, 1999.
14. G. Kabatianskii, B. Smeets, and T. Johansson, "On the cardinality of systematic authentication codes via error correcting," IEEE Trans. Inform. Theory, vol. 42, pp. 566-578, Mar. 1996.
15. F. J. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
16. K. Martin and R. Safavi-Naini, "Multisender authentication schemes with unconditional security," in Information and Communications Security (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1997, vol. 1334, pp. 130-143.
17. R. Safavi-Naini, "Three systems for shared generation of authenticators," Des., Codes Cryptogr., vol. 13, 1998.
18. R. Safavi-Naini and H. Wang, "New results on multi-receiver authentication codes," in Advances in Cryptology - Eurbcrypt '98 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1998, vol. 1438, pp. 527-541.
19. _, "Multireceiver authentication codes: Models, bounds, constructions and extensions," Inform. Comput., vol. 151, no. 1/2, pp. 148-172, 1999.
20. R. Safavi-Naini, W. Susilo, and H. Wang, "Fail-stop signature for long messages," in Indocrypt'00 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1977, pp. 165-177.
21. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, pp. 612-613, 1979.
22. G. J. Simmons, "Authentication theory/coding theory," in Advances in Cryptology-Crypto '84 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1984, vol. 196, pp. 411-431.
23. _, "A survey of information authentication," in Contemporary Cryptology, The Science of Information Integrity, G. J. Simmons, Ed. Piscataway, NJ: IEEE Press, 1992, pp. 379-419.
24. B. Smeets, P. Vanroose, and Z.-X. Wan, "On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2," in Advances in Cryptology-Eurocrypt '90 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 473, pp. 306-312.
25. D. R. Stinson, "The combinatorics of authentication and secrecy codes," J. Cryptol., vol. 2, pp. 23-49, 1990.
26. _, "Universal hashing and authentication codes," Codes Cryptogr., vol. 4, pp. 369-380, 1994.
27. M. N. Wegman and J. L. Carter, "New hash functions and their use in authentication and set equality," J. Comput. Syst. Sci., vol. 22, pp. 265-279, 1981.
28. C. Xing, H. Wang, and K. Y. Lam, "Constructions of authentication codes from algebraic curves over finite fields," IEEE Trans. Inform. Theory, vol. 46, pp. 886-892, May 2000.