How to construct universal one-way hash functions of order r

Deukjo Hong, Jaechul Sung, Seokhie Hong, Sangjin Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damgård) or some-level TR (TRee) extension is a UOWHF. Since MD and TR extensions do not require additional key values except the key of compression functions for hashing, their result means that the order of UOWHFs can be useful for minimizing the total key length. In this paper we study how to construct such UOWHFs of order r. As the first step, we observe Bellare-Rogaway UOWHF and Naor-Yung UOWHF. It is shown that Bellare-Rogaway UOWHF has the order 0 and that Naor-Yung UOWHF has the order 1. We generalize the construction of Naor-Yung UOWHF based on a one-way permutation to that of the UOWHF of order r.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages63-76
Number of pages14
Volume3797 LNCS
Publication statusPublished - 2005 Dec 1
Event6th International Conference on Cryptology in India, INDOCRYPT 2005 - Bangalore, India
Duration: 2005 Dec 102005 Dec 12

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3797 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Conference on Cryptology in India, INDOCRYPT 2005
CountryIndia
CityBangalore
Period05/12/1005/12/12

Fingerprint

One-way Hash Function
Hash functions
Compression Function
Hashing
Hash Function
Permutation
Query
Game
Generalise
Target

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

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

Cite this

Hong, D., Sung, J., Hong, S., & Lee, S. (2005). How to construct universal one-way hash functions of order r. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3797 LNCS, pp. 63-76). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3797 LNCS).

How to construct universal one-way hash functions of order r. / Hong, Deukjo; Sung, Jaechul; Hong, Seokhie; Lee, Sangjin.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3797 LNCS 2005. p. 63-76 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3797 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hong, D, Sung, J, Hong, S & Lee, S 2005, How to construct universal one-way hash functions of order r. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3797 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3797 LNCS, pp. 63-76, 6th International Conference on Cryptology in India, INDOCRYPT 2005, Bangalore, India, 05/12/10.
Hong D, Sung J, Hong S, Lee S. How to construct universal one-way hash functions of order r. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3797 LNCS. 2005. p. 63-76. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hong, Deukjo ; Sung, Jaechul ; Hong, Seokhie ; Lee, Sangjin. / How to construct universal one-way hash functions of order r. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3797 LNCS 2005. pp. 63-76 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9cc2e729679e406d892ee68dd0d63a5d,
title = "How to construct universal one-way hash functions of order r",
abstract = "At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damg{\aa}rd) or some-level TR (TRee) extension is a UOWHF. Since MD and TR extensions do not require additional key values except the key of compression functions for hashing, their result means that the order of UOWHFs can be useful for minimizing the total key length. In this paper we study how to construct such UOWHFs of order r. As the first step, we observe Bellare-Rogaway UOWHF and Naor-Yung UOWHF. It is shown that Bellare-Rogaway UOWHF has the order 0 and that Naor-Yung UOWHF has the order 1. We generalize the construction of Naor-Yung UOWHF based on a one-way permutation to that of the UOWHF of order r.",
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 Jaechul Sung and Seokhie Hong and Sangjin Lee",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "3540308059",
volume = "3797 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "63--76",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - How to construct universal one-way hash functions of order r

AU - Hong, Deukjo

AU - Sung, Jaechul

AU - Hong, Seokhie

AU - Lee, Sangjin

PY - 2005/12/1

Y1 - 2005/12/1

N2 - At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damgård) or some-level TR (TRee) extension is a UOWHF. Since MD and TR extensions do not require additional key values except the key of compression functions for hashing, their result means that the order of UOWHFs can be useful for minimizing the total key length. In this paper we study how to construct such UOWHFs of order r. As the first step, we observe Bellare-Rogaway UOWHF and Naor-Yung UOWHF. It is shown that Bellare-Rogaway UOWHF has the order 0 and that Naor-Yung UOWHF has the order 1. We generalize the construction of Naor-Yung UOWHF based on a one-way permutation to that of the UOWHF of order r.

AB - At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damgård) or some-level TR (TRee) extension is a UOWHF. Since MD and TR extensions do not require additional key values except the key of compression functions for hashing, their result means that the order of UOWHFs can be useful for minimizing the total key length. In this paper we study how to construct such UOWHFs of order r. As the first step, we observe Bellare-Rogaway UOWHF and Naor-Yung UOWHF. It is shown that Bellare-Rogaway UOWHF has the order 0 and that Naor-Yung UOWHF has the order 1. We generalize the construction of Naor-Yung UOWHF based on a one-way permutation to that of the UOWHF of order r.

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=33646825234&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:33646825234

SN - 3540308059

SN - 9783540308058

VL - 3797 LNCS

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

SP - 63

EP - 76

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

ER -