Skip to main content
SpringerLink
Log in

A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model

  • Conference paper
Information Security and Privacy (ACISP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3108))

Included in the following conference series:

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.

The first author was partly supported by the grant M02-2003-000-20834-0 from Korea Science and Engineering Foundation, and also supported by the 21st Century COE Program “Reconstruction of Social Infrastructure Related to Information Science and Electrical Engineering” of the Graduate School of Information Science and Electrical Engineering, Kyushu Univ., Japan. The second and fifth authors were supported (in part) by the Ministry of Information & Communications, Korea, under the Information Technology Research Center (ITRC) Support Program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipherbased hash function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320–335. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers:A synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368–378. Springer, Heidelberg (1994)

    Google Scholar 

  3. Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 210–224. Springer, Heidelberg (1993)

    Google Scholar 

  4. Kilian, J., Rogaway, P.: How to protect DES against exhaustive key search. Journal of Cryptology 14(1), 17–35 (2001); Earlier version in CRYPTO 1996

    Article  MATH  MathSciNet  Google Scholar 

  5. Winternitz, R.: A secure one-way hash function built from DES. In: Proceedings of the IEEE Symposium on Information Security and Privacy, pp. 88–90. IEEE Press, Los Alamitos (1984)

    Google Scholar 

  6. Shannon, C.: Communication theory of secrecy systems. Bell Systems Technical Journal 28(4), 656–715 (1949)

    MATH  MathSciNet  Google Scholar 

  7. Bellare, M., Rogaway, P.: Collision-resistant hashing: towards making UOWHFs practical. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 470–484. Springer, Heidelberg (1997)

    Google Scholar 

  8. Damgard, B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)

    Google Scholar 

  9. Merkle, R.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428–446. Springer, Heidelberg (1990)

    Google Scholar 

  10. Mironov, I.: Hash functions: from Merkle-Damgard to Shoup. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 166–181. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pp. 33–43. ACM Press, New York (1989)

    Chapter  Google Scholar 

  12. Sarkar, P.: Construction of UOWHF: Tree Hashing Revisited, Cryptology ePrint Archive, http://eprint.iacr.org/2002/058

  13. Shoup, V.: A composition theorem for universal one-way hash functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 445–452. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Simon, D.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334–345. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Lee, W., Nandi, M., Sarkar, P., Chang, D., Lee, S., Sakurai, K.: A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model, http://eprint.iacr.org/2004/069/

  16. Lee, W., Chang, D., Lee, S., Sung, S., Nandi, M.: New parallel domain extenders of UOWHF. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 208–227. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Information and Security Technologies, Korea University, Seoul, Korea

    Wonil Lee, Donghoon Chang & Sangjin Lee

  2. Applied Statistics Unit, Indian Statistical Institute, Kolkata, India

    Mridul Nandi & Palash Sarkar

  3. Dept. of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan

    Kouichi Sakurai

Authors
  1. Wonil Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mridul Nandi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Palash Sarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Donghoon Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sangjin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Kouichi Sakurai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Advanced Computing - Algorithms and Cryptography Department of Computing, Macquarie University, Australia

    Huaxiong Wang

  2. Department of Computing, Macquarie University, NSW 2109, Sydney, Australia

    Josef Pieprzyk

  3. Macquarie University, Sydney, Australia

    Vijay Varadharajan

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, W., Nandi, M., Sarkar, P., Chang, D., Lee, S., Sakurai, K. (2004). A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds) Information Security and Privacy. ACISP 2004. Lecture Notes in Computer Science, vol 3108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27800-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27800-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22379-5

  • Online ISBN: 978-3-540-27800-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation