On Fast and Provably Secure Message Authentication Based on Universal Hashing (1996)
| Venue: | In Advances in Cryptology – CRYPTO ’96 |
| Citations: | 61 - 0 self |
BibTeX
@INPROCEEDINGS{Shoup96onfast,
author = {Victor Shoup},
title = {On Fast and Provably Secure Message Authentication Based on Universal Hashing},
booktitle = {In Advances in Cryptology – CRYPTO ’96},
year = {1996},
pages = {313--328},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 are competitive with other commonly employed schemes whose security is less well-established. 1 Introduction Message Authentication. Message authentication schemes are an important security tool. As more and more data is being transmitted over networks, the need for secure, high-speed, software-based message authentication is becoming more acute. The setting for message authentication is the following. Two parties A and B agree on a secre...
