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

One-way Hash Function
Hash functions
Higher Order
Target
Hash Function
Generalise
Demonstrate

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

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{753d82ca241842098013f42f4ce844f9,
title = "Higher order universal one-way hash functions",
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{\aa}rd construction and in a tree construction.",
keywords = "Collision Resistant Hash Function (CRHF), Hash Function, Higher Order Universal One-Way Hash Function, Universal One-Way Hash Function (UOWHF)",
author = "Deukjo Hong and Bart Preneel and Sangjin Lee",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3329",
pages = "201--213",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Higher order universal one-way hash functions

AU - Hong, Deukjo

AU - Preneel, Bart

AU - Lee, Sangjin

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

KW - Collision Resistant Hash Function (CRHF)

KW - Hash Function

KW - Higher Order Universal One-Way Hash Function

KW - Universal One-Way Hash Function (UOWHF)

UR - http://www.scopus.com/inward/record.url?scp=35048855599&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048855599&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048855599

VL - 3329

SP - 201

EP - 213

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -