Bucket Hashing and its Application to Fast Message Authentication
Phillip Rogaway
- pp 29-42
Reads0
Chats0
TLDR
A new technique for generating a message authentication code (MAC) using a simple metaphor to (noncryptographically) hash a string x, cast each of its words into a small number of buckets, and collect up all the buckets' contents.Abstract:
We introduce a new technique for generating a message authentication code (MAC). At its center is a simple metaphor: to (noncryptographically) hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman-Carter authentication, this style of hash function provides the fastest known approach to software message authentication.read more
Citations
More filters
Journal ArticleDOI
Security analysis of the message authenticator algorithm (MAA)
TL;DR: The attacks presented herein, which exploit the internal structure of the algorithm, are the first computationally feasible attacks on MAA and lead to the identification of several classes of weak keys for MAA.
Book ChapterDOI
Multisender authentication systems with unconditional security
TL;DR: This work gives two generic constructions using secret sharing schemes and authentication codes as the underlying primitives and shows that key-efficient and fast SGA-systems can be constructed by proper choice of the two primitives.
Journal ArticleDOI
Multiround Unconditionally Secure Authentication
TL;DR: This paper defines a multiround authentication model and shows how to calculate the probability of a successful attack for this model, and proves the security for a 3-round scheme and gives a construction for the 3- round scheme based on Reed-Solomom codes.
Journal ArticleDOI
Symmetric authentication in a simulatable Dolev---Yao-style cryptographic library
TL;DR: This work extends this Dolev–Yao-style model, its realization, and the security proof to include a first symmetric primitive message authentication, so that the exchange of secret keys can be dealt with at any time, before or after the keys are first used for authentication.
Journal ArticleDOI
Robust Multi-Property Combiners for Hash Functions
TL;DR: In this article, the notion of robust multi-property combiners for hash functions has been proposed, which takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure.
References
More filters
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
Graph theory with applications (revised edition), by J. A. Bondy and U.S.R. Murty. Pp x, 264. £5·95 paperback. 1977. SBN 0 333 22694 1 (Macmillan)
Proceedings Article
The MD5 Message-Digest Algorithm
TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Journal ArticleDOI
A digital signature scheme secure against adaptive chosen-message attacks
TL;DR: A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.