Universal Hashing and Multiple Authentication

  • Authors:
  • M. Atici;Douglas R. Stinson

  • Affiliations:
  • -;-

  • Venue:
  • CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes. Then we generalize the theory of universal hashing in order to accommodate the situation where we would like to authenticate a sequence of messages with the same key. Unlike previous methods for doing this, we do not require that each message in the sequence have a "counter" attached to it.