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
Posted Content
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound.
Alexander Moch,Eik List +1 more
TL;DR: The Wegman-Cavazza-Davies-Meyer (EWCDM) construction as mentioned in this paper provides only birthday-bound security if instantiated with a permutation.
Journal ArticleDOI
On an almost-universal hash function family with applications to authentication and secrecy codes
TL;DR: In this paper, the authors introduced a variant of MMH$^*, called GRDH, which is a universal hash function with secrecy, and proved that GRDH is an almost-$\Delta-universal family of hash functions.
Journal ArticleDOI
Improving Classical Authentication over a Quantum Channel
TL;DR: A quantum protocol to authenticate classical messages that can be used to replace Wegman–Carter’s classical authentication scheme in quantum key distribution (QKD) protocols is proposed and it is proved that quantum resources can improve both the secrecy of the key generated by the PRG and the secrets of the tag obtained with a hidden hash function.
Book ChapterDOI
Insuperability of the standard versus ideal model gap for tweakable blockcipher security
Bart Mennink,Bart Mennink +1 more
TL;DR: It is proved that if this proof technique is adopted, tweak-rekeying will not help in achieving optimal security: if 2^{\sigma n/(\sigma +1)}\) is the best one can get without tweak- rekeying, optimal \(2^n\) provable security with tweak-Rekeying is impossible.
Posted Content
A Simple Security Analysis of Hash-CBC and a New Efficient One-Key Online Cipher.
TL;DR: This paper provides a simple security analysis of these online ciphers, namely HCBC and HPCBC, and proposes two variants of HHCBC, namely MHCBC-1 and M HCBC-2.
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.