Skip to main content
SpringerLink
Log in

Analysis of Zipper as a Hash Function

  • Conference paper
Information Security Practice and Experience (ISPEC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4991))

Abstract

At CRYPTO 2005, Coron etc. proposed several modified methods to make the usual hash functions based on MD method indifferentiable from random oracles. However, the compression functions used in Coron’s schemes are supposed to be random oracles. This assumption is too strong. To achieve Coron’s goal in the real world, Liskov proposed Zipper structure and implemented a new scheme indifferentiable from random oracle based on this structure. Unlike Coron’s schemes, the indifferentiability of Liskov’s scheme does not depend on strong compression functions and insecure compression functions can be used to implement Liskov’s scheme. In this paper, we show that the security of Liskov’s scheme is not ideal as a hash function. We also analyze those Zipper schemes whose compression functions are insecure PGV compression functions instead of Liskov’s weak compression functions, and we find that some insecure PGV compression functions whose security is stronger than Liskov’s weak compression function cannot be used to build indifferentiable and collision-resistant Zipper schemes.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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., Cochran, M., Shrimpton, T.: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 526–541. Springer, Heidelberg (2005)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Coron, J., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgård revisited:How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 55–70. Springer, Heidelberg (2005)

    Google Scholar 

  4. Damgård, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)

    Google Scholar 

  5. FIPS 180-1, Secure Hash Standard, Federal Information Processing Standard, Publication 180-1, NIST (1995)

    Google Scholar 

  6. FIPS 180-2, Secure Hash Standard, Federal Information Processing Standard, Publication 180-2, NIST (2003)

    Google Scholar 

  7. Hoch, J., Shamir, A.: Breaking the ICE-Finding Multicollisions in IteratedConcatenated and Expanded(ICE) Hhash Functions. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 179–194. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Joux, A.: Multicollisions in Iterated Hash Functions: Application to Cascaded Constructions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306–316. Springer, Heidelberg (2004)

    Google Scholar 

  9. Kelsey, J., Kohno, T.: Herding Hash Functions and the Nostradamus Attack. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 183–200. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Kelsey, J., Schneier, B.: Second Preimages on n-Bit Hash Functions for Much Less than 2n Work. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 474–490. Springer, Heidelberg (2005)

    Google Scholar 

  11. Knudsen, L., Lai, X., Preneel, B.: Attacks on Fast Double Block Length Hash Functions. J. Cryptology. 11, 59–72 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lai, X., Massey, J.: Hash Functions Based on Blcok Ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 55–70. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  13. Liskov, M.: Constructing an Ideal Hash Function from Weak Ideal Compression Functions. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 331–349. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Lucks, S.: A Failure-Friendly Design Principle for Hash Functions. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 474–494. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. 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 

  16. 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 

  17. Rivest, R.L.: the MD4 Message-Digest Algorithm. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 303–311. Springer, Heidelberg (1991)

    Google Scholar 

  18. Rivest, R.L.: the MD5 Message-Digest Algorithm, RFC 1321, Internet Activity Board, Internet Privacy Task Force (1992)

    Google Scholar 

  19. Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–304. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences,  

    Pin Lin, Wenling Wu & Chuankun Wu

  2. National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences,  

    Tian Qiu

  3. Graduate School of Chinese Academy of Sciences,  

    Pin Lin & Tian Qiu

Authors
  1. Pin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenling Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chuankun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tian Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Liqun Chen Yi Mu Willy Susilo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, P., Wu, W., Wu, C., Qiu, T. (2008). Analysis of Zipper as a Hash Function. In: Chen, L., Mu, Y., Susilo, W. (eds) Information Security Practice and Experience. ISPEC 2008. Lecture Notes in Computer Science, vol 4991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79104-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79104-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79103-4

  • Online ISBN: 978-3-540-79104-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation