Universal hashing and authentication codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 576 LNCS, Issue , 1992, Pages 74-85

  Stinson, D R ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; HASH FUNCTIONS;

AUTHENTICATION CODES; PLAINTEXT; UNCONDITIONALLY SECURE; UNIVERSAL HASHING;

CODES (SYMBOLS);

EID: 71049183202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_5     Document Type: Conference Paper

References (10)

1. J. L Carter and M. N. Wegman. Universal classes of hash functions, J. Com-put. System Sci. 18 (1979), 143-154.
2. R. L. Plackett and J. P. Burman. The design of optimum multi-factorial experiments, Biometrika 33 (1945), 305-325.
3. D. V. Sarwate. A note on universal classes of hash functions, Inform. Proc. Letters 10 (1980), 41-45.
4. G. J. Simmons. Message authentication: a game on hypergraphs, Congr. Numer. 45 (1984), 161-192.
5. G. J. Simmons. A survey of information authentication, Proc. of the IEEE 76 (1988), 603-620.
6. D. R. Stinson. Some constructions and bounds for authentication codes, J. Cryp-tology 1 (1988), 37-51.
7. D. R. Stinson. The combinatorics of authentication and secrecy codes, J. Cryptology 2 (1990), 23-49.
8. D. R. Stinson. Combinatorial techniques for universal hashing, submitted to J. Comput. System Sci.
9. D. R. Stinson. Combinatorial characterizations of authentication codes, submitted to Designs, Codes and Cryptography (a preliminary version appears elsewhere in these proceedings).
10. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (1981), 265-279.