A generalization of PGV-hash functions and security analysis in black-box model

Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are collision resistant and one-way-secure in black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and prove that besides the previous 20 hash functions we have 22 more collision resistant and one-way secure hash families. As all these 42 families are keyed hash families, these become target collision resistant also. All these 42 hash families have tight upper and lower bounds on (target) collision resistant and one-way-ness.

Original languageEnglish
Pages (from-to)212-223
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3108
Publication statusPublished - 2004 Dec 1

Fingerprint

Hash functions
Security Analysis
Hash Function
Black Box
Collision
Block Cipher
Target
Model
Upper and Lower Bounds
Generalization
Family
Generalise

ASJC Scopus subject areas

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

Cite this

A generalization of PGV-hash functions and security analysis in black-box model. / Lee, Wonil; Nandi, Mridul; Sarkar, Palash; Chang, Donghoon; Lee, Sangjin; Sakurai, Kouichi.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3108, 01.12.2004, p. 212-223.

Research output: Contribution to journalArticle

@article{2c41bf6540c842329a242ae8fb868005,
title = "A generalization of PGV-hash functions and security analysis in black-box model",
abstract = "In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are collision resistant and one-way-secure in black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and prove that besides the previous 20 hash functions we have 22 more collision resistant and one-way secure hash families. As all these 42 families are keyed hash families, these become target collision resistant also. All these 42 hash families have tight upper and lower bounds on (target) collision resistant and one-way-ness.",
author = "Wonil Lee and Mridul Nandi and Palash Sarkar and Donghoon Chang and Sangjin Lee and Kouichi Sakurai",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3108",
pages = "212--223",
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 - A generalization of PGV-hash functions and security analysis in black-box model

AU - Lee, Wonil

AU - Nandi, Mridul

AU - Sarkar, Palash

AU - Chang, Donghoon

AU - Lee, Sangjin

AU - Sakurai, Kouichi

PY - 2004/12/1

Y1 - 2004/12/1

N2 - In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are collision resistant and one-way-secure in black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and prove that besides the previous 20 hash functions we have 22 more collision resistant and one-way secure hash families. As all these 42 families are keyed hash families, these become target collision resistant also. All these 42 hash families have tight upper and lower bounds on (target) collision resistant and one-way-ness.

AB - In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are collision resistant and one-way-secure in black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and prove that besides the previous 20 hash functions we have 22 more collision resistant and one-way secure hash families. As all these 42 families are keyed hash families, these become target collision resistant also. All these 42 hash families have tight upper and lower bounds on (target) collision resistant and one-way-ness.

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

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

M3 - Article

VL - 3108

SP - 212

EP - 223

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 -