Universal hashing

Known as: Universal family, Universal hashing function, Universal hash 
In mathematics and computing universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2005
2005
Message authentication codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table I
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a… (More)
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen… (More)
Is this relevant?
2000
2000
An experimental study of strongly universal hashing is presented, including non-standard usage of the floating point co-processor… (More)
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
There are well-known techniques for message authentication using universal hash functions. This approach seems very promising, as… (More)
Is this relevant?
1994
1994
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a collection of hash functions… (More)
Is this relevant?
1994
1994
  • J Urgen Bierbrauer
  • 1994
We describe a new application of algebraic coding theory to universal hashing and authentication without secrecy. This permits to… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present three explicit constructions of hash functions, which exhibit a trade-o between the size of the family (and hence the… (More)
Is this relevant?