Paper 2004/069 Original: eprint.iacr.org/2004/069 ↗

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
Abstract

In~\cite{B02} it was proved that 20 out of 64 PGV-hash functions~\cite{P94} 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 we will 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 family, 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2004-03-02: last updated
2004-03-02: published
Short URL
https://ia.cr/2004/069
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/069,
      author = {Wonil Lee and Mridul Nandi and Palash Sarkar and Donghoon Chang and Sangjin Lee and Kouichi Sakurai},
      title = {A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/069},
      year = {2004},
      url = {https://eprint.iacr.org/2004/069}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.