Higher order universal one-way hash functions

Deukjo Hong, Bart Preneel, Sangjin Lee

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from the family. Their main security property is that it should be hard to find a second input that collides with the target input. This paper generalizes the concept of UOWHFs to UOWHFs of order r. We demonstrate that it is possible to build UOWHFs with much shorter keys than existing constructions from fixed-size UOWHFs of order r. UOWHFs of order r can be used both in the linear (r + 1)-round Merkle-Damgård construction and in a tree construction.

Original languageEnglish
Pages (from-to)201-213
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3329
Publication statusPublished - 2004 Dec 1

    Fingerprint

Keywords

  • Collision Resistant Hash Function (CRHF)
  • Hash Function
  • Higher Order Universal One-Way Hash Function
  • Universal One-Way Hash Function (UOWHF)

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this