K-independent hashing

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A family of hash functions is said to be k-independent or k-universal[1] if selecting a hash function at random from the family guarantees that the hash codes of any designated k keys are independent random variables (see precise mathematical definitions below). Such families allow good average case performance in randomized algorithms or data structures, even if the input data is chosen by an adversary. The trade-offs between the degree of independence and the efficiency of evaluating the hash function are well studied, and many k-independent families have been proposed.

Introduction[edit]

See also: Hash function

The goal of hashing is usually to map keys from some large domain (universe) U into a smaller range, such as m bins (labelled [m] = \{0, \dots, m-1\}). In the analysis of randomized algorithms and data structures, it is often desirable for the hash codes of various keys to "behave randomly". For instance, if the hash code of each key were an independent random choice in [m], the number of keys per bin could be analyzed using the Chernoff bound. A deterministic hash function cannot offer any such guarantee in an adversarial setting, as the adversary may choose the keys to be the precisely the preimage of a bin. Furthermore, a deterministic hash function does not allow for rehashing: sometimes the input data turns out to be bad for the hash function (e.g. there are too many collisions), so one would like to change the hash function.

The solution to these problems is to pick a function randomly from a large family of hash functions. The randomness in choosing the hash function can be used to guarantee some desired random behavior of the hash codes of any keys of interest. The first definition along these lines was universal hashing, which guarantees a low collision probability for any two designated keys. The concept of k-independent hashing, introduced by Wegman and Carter in 1981,[2] strengthens the guarantees of random behavior to families of k designated keys, and adds a guarantee on the uniform distribution of hash codes.

Mathematical Definitions[edit]

The strictest definition, introduced by Wegman and Carter[2] under the name "strongly universal_k hash family", is the following. A family of hash functions H=\{ h:U \to [m] \} is k-independent if for any k distinct keys (x_1, \dots, x_k) \in U^k and any k hash codes (not necessarily distinct) (y_1, \dots, y_k) \in [m]^k, we have:

\Pr_{h \in H} \left[ h(x_1)=y_1 \land \cdots \land h(x_k)=y_k \right] = m^{-k}

This definition is equivalent to the following two conditions:

  1. for any fixed x\in U, as h is drawn randomly from H, h(x) is uniformly distributed in [m].
  2. for any fixed, distinct keys x_1, \dots, x_k \in U, as h is drawn randomly from H, h(x_1), \dots, h(x_k) are independent random variables.

Often it is inconvenient to achieve the perfect joint probability of m^{-k} due to rounding issues. Following,[3] one may define a (\mu, k)-independent family to satisfy:

\forall distinct (x_1, \dots, x_k) \in U^k and \forall (y_1, \dots, y_k) \in [m]^k, ~~\Pr_{h \in H} \left[ h(x_1)=y_1 \land \cdots \land h(x_k)=y_k \right] \le  \mu / m^k

Observe that, even if \mu is close to 1, h(x_i) are no longer independent random variables, which is often a problem in the analysis of randomized algorithms. Therefore, a more common alternative to dealing with rounding issues is to prove that the hash family is close in statistical distance to a k-independent family, which allows black-box use of the independence properties.

See also[edit]

References[edit]

  1. ^ Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press. ISBN 0-262-03384-4. 
  2. ^ a b Wegman, Mark N.; Carter, J. Lawrence (1981). "New hash functions and their use in authentication and set equality". Journal of Computer and System Sciences 22 (3): 265–279. doi:10.1016/0022-0000(81)90033-7. Conference version in FOCS'79. Retrieved 9 February 2011. 
  3. ^ Siegel, Alan (2004). "On universal classes of extremely random constant-time hash functions and their time-space tradeoff". SIAM Journal on Computing 33 (3): 505–543. doi:10.1137/S0097539701386216. Conference version in FOCS'89. 

Further reading[edit]

  • Motwani, Rajeev; Raghavan, Prabhakar (1995). Randomized Algorithms. Cambridge University Press. p. 221. ISBN 0-521-47465-5.