Advertisement

Yet Another Definition of Weak Collision Resistance and Its Analysis

  • Shoichi Hirose
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2971)

Abstract

In this article, a new definition of weak collision resistance is presented following the definition of weak one-wayness. Collision resistance is a security notion of cryptographic hash functions. A collision of a hash function is a pair of different inputs which give the same output. In the new definition, weak collision resistance means that the probability of failing to find a collision is not negligible. This weak collision resistance is then analyzed. First, it is shown that there really exist weakly collision resistant hash functions if collision resistant ones exist. Second, it is shown that weak collision resistance can be amplifiable, that is, (strongly) collision resistant hash functions are constructed from a certain kind of weakly collision resistant ones. An example of weakly collision resistant hash functions is also presented to which the proposed amplification method is applicable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    An, J.H., Bellare, M.: Constructing VIL-MACs from FIL-MACs: Message authentication under weakened assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 252–269. Springer, Heidelberg (1999)Google Scholar
  2. 2.
    Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1–15. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Chaum, D., van Heijst, E., Pfitzmann, B.: Cryptographically strong undeniable signatures, unconditionally secure for the signer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 470–484. Springer, Heidelberg (1992)Google Scholar
  4. 4.
    Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)zbMATHCrossRefGoogle Scholar
  5. 5.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)CrossRefGoogle Scholar
  6. 6.
    Preneel, B.: The state of cryptographic hash functions. In: Damgård, I.B. (ed.) EEF School 1998. LNCS, vol. 1561, pp. 158–182. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Simon, D.R.: 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Shoichi Hirose
    • 1
  1. 1.Graduate School of Informatics Kyoto UniversityKyotoJapan

Personalised recommendations