Higher order universal one-way hash functions

Deukjo Hong; Bart Preneel; Sangjin Lee

doi:10.1007/978-3-540-30539-2_15

Higher order universal one-way hash functions

Deukjo Hong^*
, Bart Preneel
, Sangjin Lee

^*Corresponding author for this work

Department of Computer Science & Artificial Intelligence

Korea University
KU Leuven

Research output: Contribution to conference › Chapter › peer-review

8 Scopus citations

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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Pil Joong Lee, Pil Joong Lee
Publisher	Springer Verlag
Pages	201-213
Number of pages	13
ISBN (Print)	3540239758, 9783540239758
DOIs	https://doi.org/10.1007/978-3-540-30539-2_15
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3329
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)

Access to Document

10.1007/978-3-540-30539-2_15

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

Hong, Deukjo ; Preneel, Bart ; Lee, Sangjin. / Higher order universal one-way hash functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Pil Joong Lee ; Pil Joong Lee. Springer Verlag, 2004. pp. 201-213 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{b3314378f3e94620b19fe2bd7fa25625,

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",

doi = "10.1007/978-3-540-30539-2\_15",

language = "English",

isbn = "3540239758",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "201--213",

editor = "Lee, \{Pil Joong\} and Lee, \{Pil Joong\}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

Higher order universal one-way hash functions. / Hong, Deukjo; Preneel, Bart; Lee, Sangjin.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Pil Joong Lee; Pil Joong Lee. Springer Verlag, 2004. p. 201-213 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3329).

Research output: Contribution to conference › Chapter › peer-review

TY - CHAP

T1 - Higher order universal one-way hash functions

AU - Hong, Deukjo

AU - Preneel, Bart

AU - Lee, Sangjin

PY - 2004

Y1 - 2004

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 - https://www.scopus.com/pages/publications/35048855599

U2 - 10.1007/978-3-540-30539-2_15

DO - 10.1007/978-3-540-30539-2_15

M3 - Chapter

AN - SCOPUS:35048855599

SN - 3540239758

SN - 9783540239758

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

SP - 201

EP - 213

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

A2 - Lee, Pil Joong

PB - Springer Verlag

ER -

Hong D, Preneel B, Lee S. Higher order universal one-way hash functions. In Lee PJ, Lee PJ, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 201-213. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-30539-2_15

Higher order universal one-way hash functions

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this