Hash functions in the dedicated-key setting: design choices and MPP transforms

  • Authors:
  • Mihir Bellare;Thomas Ristenpart

  • Affiliations:
  • Dept. of Computer Science & Engineering, University of California San Diego, La Jolla, CA;Dept. of Computer Science & Engineering, University of California San Diego, La Jolla, CA

  • Venue:
  • ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the dedicated-key setting, one uses a compression function f: {0, 1}k ×{0, 1}n+d → {0, 1}n to build a family of hash functions Hf : K×M → {0, 1}n indexed by a key space K. This is different from the more traditional design approach used to build hash functions such as MD5 or SHA-1, in which compression functions and hash functions do not have dedicated key inputs. We explore the benefits and drawbacks of building hash functions in the dedicated-key setting (as compared to the more traditional approach), highlighting several unique features of the former. Should one choose to build hash functions in the dedicated-key setting, we suggest utilizing multi-property-preserving (MPP) domain extension transforms. We analyze seven existing dedicated-key transforms with regard to the MPP goal and propose two simple new MPP transforms.