New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes

Designs, Codes, and Cryptography

Volumn 15, Issue 1, 1998, Pages 87-100

  Kurosawa, Kaoru ^a   Okada, Koji ^a   Saido, Hajime ^a   Stinson, Douglas R ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Authentication Code; Bounds; Cryptography; Key predistribution scheme

Indexed keywords

EID: 0242621246     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008229625895     Document Type: Article

References (10)

1. A. Beimel, Private communication, (1997).
2. J. Bierbrauer, Bounds on orthogonal arrays and resilient functions, Journal of Combinatorial Designs, Vol. 3 (1995) pp. 179-183.
3. R. Blom, An optimal class of symmetric key generation systems, Lecture Notes in Computer Science, Vol. 209 (1984) pp. 335-338 (Proceedings of EUROCRYPT '84).
4. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly secure key distribution for dynamic conferences, Lecture Notes in Computer Science, Vol. 740 (1993) pp. 471-486 (Proceedings of CRYPTO '92).
5. C. J. Colbourn and J. H. Dinitz, eds, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).
6. D. K. Ray-Chaudhuri and R. M. Wilson, On t-designs, Osaka Journal of Mathematics, Vol. 12 (1975) pp. 737-744.
7. R. S. Rees and D. R. Stinson, Combinatorial characterizations of authentication codes II, Designs, Codes and Cryptography, Vol. 7 (1996) pp. 239-259.
8. G. J. Simmons, A survey of information authentication, Contemporary Cryptology, The Science of Information Integrity, IEEE Press (1992) pp. 379-419.
9. D. R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology, Vol. 2 (1990) pp. 23-49.
10. D. R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 175-187.