Higher order universal one-way hash functions

Deukjo Hong, Bart Preneel, Sangjin Lee

Research output: Chapter in Book/Report/Conference proceedingChapter

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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsPil Joong Lee, Pil Joong Lee
PublisherSpringer Verlag
Pages201-213
Number of pages13
ISBN (Print)3540239758, 9783540239758
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3329
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

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)

Fingerprint Dive into the research topics of 'Higher order universal one-way hash functions'. Together they form a unique fingerprint.

  • Cite this

    Hong, D., Preneel, B., & Lee, S. (2004). Higher order universal one-way hash functions. In P. J. Lee, & P. J. Lee (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 201-213). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3329). Springer Verlag. https://doi.org/10.1007/978-3-540-30539-2_15