Skip to main content
SpringerLink
Log in

On selectable collisionful hash functions

  • Session 9: Hashing
  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1996)

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

Included in the following conference series:

Abstract

This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses of his method are studied and possible solutions are given. Some secure methods that require additional assumptions are also suggested.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, “Cryptographic Hash Functions: A Survey,” Tech. Rep. 95-09, Department of Computer Science, University of Wollongong, July 1995.

    Google Scholar 

  2. S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, “Password-Based Authenticated Key Exchange using Collisionful Hash Functions,” in the Astralian Conference on Information Security and Privacy, 1996. (To Appear).

    Google Scholar 

  3. T. A. Berson, L. Gong, and T. M. A. Lomas, “Secure, Keyed, and Collisionful Hash Functions,” Tech. Rep. (included in) SRI-CSL-94-08, SRI International Laboratory, Menlo Park, California, Dec. 1993. The revised version (September 2, 1994).

    Google Scholar 

  4. J. L. Carter and M. N. Wegman, “Universal Class of Hash Functions,” Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, 1979.

    Google Scholar 

  5. I. B. Damgård, “A Design Principle for Hash Functions,” in Advances in Cryptology, Proceedings of CRYPTO '89, pp. 416–427, Oct. 1989.

    Google Scholar 

  6. L. Gong, “Collisionful Keyed Hash Functions with Selectable Collisions,” Information Processing Letters, vol. 55, pp. 167–170, 1995.

    Google Scholar 

  7. M. Naor and M. Yung, “Universal One-Way Hash Functions and Their Cryptographic Applications,” in Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 33–43, 1989.

    Google Scholar 

  8. B. Preneel, Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke University Leuven, Jan. 1993.

    Google Scholar 

  9. R. L. Rivest, “The MD5 Message-Digest Algorithm.” RFC 1321, Apr. 1992. Network Working Group, MIT Laboratory for Computer Science and RSA Data Security, Inc.

    Google Scholar 

  10. M. N. Wegman and J. L. Carter, “New Hash Functions and Their Use in Authentication and Set Equality,” Journal of Computer and System Sciences, vol. 22, pp. 265–279, 1981.

    Google Scholar 

  11. Y. Zheng, T. Hardjono, and J. Pieprzyk, “The Sibling Intractable Function Family (SIFF): Notion, Construction and Applications,” IEICE Trans, Fundamentals, vol. E76-A, Jan. 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Security Research Department of Computer Science, University of Wollongong, 2522, Wollongong, NSW, Australia

    S. Bakhtiari, R. Safavi-Naini & J. Pieprzyk

Authors
  1. S. Bakhtiari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josef Pieprzyk Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bakhtiari, S., Safavi-Naini, R., Pieprzyk, J. (1996). On selectable collisionful hash functions. In: Pieprzyk, J., Seberry, J. (eds) Information Security and Privacy. ACISP 1996. Lecture Notes in Computer Science, vol 1172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023307

Download citation

  • DOI: https://doi.org/10.1007/BFb0023307

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61991-8

  • Online ISBN: 978-3-540-49583-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation