Bucket Hashing and its Application to Fast Message Authentication
Phillip Rogaway
- pp 29-42
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
Book ChapterDOI
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
TL;DR: In this paper, a stronger bound of 2n/2/61 was proven by a new technique, using a recently found universal family of hash functions, and a first non-trivial upper bound of 7/3 ċ 24n/3 for the OBDD size of MULn-1,n was provided.
Book ChapterDOI
Efficient Strongly Universal and Optimally Universal Hashing
TL;DR: An optimally universal hash class is presented, which means that the universality parameter achieves the minimum possible value, and it is shown how to reduce the size of a known class, retaining its properties.
Posted Content
Optimally Secure Tweakable Blockciphers.
TL;DR: In this paper, the generic design of a tweakable blockcipher from one or more evaluations of a classical block cipher, in such a way that all input and output wires are of size n bits, was considered.
Book ChapterDOI
ASC-1: an authenticated encryption stream cipher
Goce Jakimoski,Samant Khajuria +1 more
TL;DR: It is argued that ASC-1 is secure by reducing its (IND-CCA, INT-CTXT) security to the problem of distinguishing the case when the round keys are uniformly random from the caseWhen the round key are generated by a key scheduling algorithm.
Proceedings ArticleDOI
Towards self-repairing replication-based storage systems using untrusted clouds
Bo Chen,Reza Curtmola +1 more
TL;DR: The main insight behind RDC -- SR is that the replicas are differentiated based on a controllable amount of masking, which offers R DC -- SR flexibility in handling different adversarial strengths.
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.