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
Robust Multi-Property Combiners for Hash Functions.
TL;DR: A combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code is proposed, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function.
Book ChapterDOI
An improved memory integrity protection scheme
Yin Hu,Berk Sunar +1 more
TL;DR: An improved memory integrity protection scheme to provide real-time protection service and a provably secure scheme that takes advantage of the "error inheritance" property that can minimize the costly check process that is normally required before every access.
Book ChapterDOI
Cryptographic Primitives for Information Authentication - State of the Art
TL;DR: In this paper, the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signature schemes; the first class can be divided into Manipulation Detection Codes (MDCs), also known as one-way and collision resistant hash functions) and Message Authentication Codes (or MACs).
Journal ArticleDOI
A New Look at Counters: Don’t Run Like Marathon in a Hundred Meter Race
TL;DR: A unified notion for counters is presented, called counter function family, and some necessary and sufficient conditions on counters are identified which give (possibly) simple proof of security for various counter-based cryptographic schemes.
Posted Content
Improved security analysis of OMAC.
Mridul Nandi,Avradip Mandal +1 more
TL;DR: In this paper, an improved security analysis of OMAC was presented, where the improved bound is O( 2 2 2n ) where the original bound was O(2 2n ).
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.