On Fast and Provably Secure Message Authentication Based on Universal Hashing

TLDR: The basic construction and some variants under more realistic and practical assumptions are analyzed, and the results of empirical performance tests demonstrate that these schemes arc competitive with other commonly employed schemes whose security is less well-established.

Abstract: There are well-known techniques for message authentication using universal hash functions. This approach seems very promising, as it provides schemes that, are: both efficient and provably secure under reasonable assumptions. This paper contributes to this line of research in two ways. First, it analyzes the basic construction and some variants under more realistic and practical assumptions. Second, it shows how these schemes can be efficiently implemented, and it reports on the results of empirical performance tests that demonstrate that these schemes arc competitive with other commonly employed schemes whose security is less well-established.