Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2012: Advances in Cryptology – ASIACRYPT 2012 pp 154–171Cite as

  1. Home
  2. Advances in Cryptology – ASIACRYPT 2012
  3. Conference paper
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions

  • Scott Ames18,
  • Rosario Gennaro19 &
  • Muthuramakrishnan Venkitasubramaniam18 
  • Conference paper
  • 3543 Accesses

  • 4 Citations

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

Abstract

This paper presents the Generalized Randomized Iterate of a (regular) one-way function f and show that it can be used to build Universal One-Way Hash Function (UOWHF) families with O(n 2) key length.

We then show that Shoup’s technique for UOWHF domain extension can be used to improve the efficiency of the previous construction. We present the Reusable Generalized Randomized Iterate which consists of k ≥ n + 1 iterations of a regular one-way function composed at each iteration with a pairwise independent hash function, where we only use logk such hash functions, and we “schedule” them according to the same scheduling of Shoup’s domain extension technique. The end result is a UOWHF construction from regular one-way functions with an O(n logn) key. These are the first such efficient constructions of UOWHF from regular one-way functions of unknown regularity.

Finally we show that the Shoup’s domain extension technique can also be used in lieu of derandomization techniques to improve the efficiency of PRGs and of hardness amplification constructions for regular one-way functions.

Keywords

  • Hash Function
  • Success Probability
  • Random Input
  • Pseudorandom Generator
  • Randomization Step

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. SIAM Journal of Computing, 112–117 (1982)

    Google Scholar 

  2. De Santis, A., Yung, M.: On the Design of Provably-Secure Cryptographic Hash Functions. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 412–431. Springer, Heidelberg (1991)

    Google Scholar 

  3. Gennaro, R., Trevisan, L.: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. In: FOCS 2000, pp. 305–313 (2000)

    Google Scholar 

  4. Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing 22(6), 1163–1175 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989, pp. 25–32 (1989)

    Google Scholar 

  6. Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17, 281–308 (1988)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Haitner, I., Harnik, D., Reingold, O.: On the Power of the Randomized Iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 22–40. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  8. Haitner, I., Holenstein, T., Reingold, O., Vadhan, S., Wee, H.: Universal One-Way Hash Functions via Inaccessible Entropy. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 616–637. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  9. Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible Entropy. In: STOC 2009, pp. 611–620 (2009)

    Google Scholar 

  10. Halevi, S., Krawczyk, H.: Strengthening Digital Signatures Via Randomized Hashing. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 41–59. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  11. Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal of Computing 28(4), 1364–1396 (1989)

    CrossRef  MathSciNet  Google Scholar 

  12. Naor, M., Yung, M.: Universal One-Way Hash Functions and their Cryptographic Applications. In: STOC 1989, pp. 33–43 (1989)

    Google Scholar 

  13. Rompel, J.: One-Way Functions are Necessary and Sufficient for Secure Signatures. In: STOC 1990, pp. 387–394 (1990)

    Google Scholar 

  14. Sarkar, P.: Masking-based domain extenders for UOWHFs: bounds and constructions. IEEE Transactions on Information Theory 51(12), 4299–4311 (2005)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  16. Simon, D.R.: Findings 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)

    CrossRef  Google Scholar 

  17. Yao, A.: Theory and applications of trapdoor functions. In: FOCS, pp. 80–91 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Rochester, Rochester, NY, 14611, USA

    Scott Ames & Muthuramakrishnan Venkitasubramaniam

  2. IBM T.J.Watson Research Center, Hawthore, NY, 10532, USA

    Rosario Gennaro

Authors
  1. Scott Ames
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rosario Gennaro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Muthuramakrishnan Venkitasubramaniam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tsinghua University, 30 Shuangqing Road, 100084, Beijing, China

    Xiaoyun Wang

  2. Central Research Laboratories, NEC, 1754 Shimonumabe Nakahara, 211-8666, Kawasaki, Japan

    Kazue Sako

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 International Association for Cryptologic Research

About this paper

Cite this paper

Ames, S., Gennaro, R., Venkitasubramaniam, M. (2012). The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions. In: Wang, X., Sako, K. (eds) Advances in Cryptology – ASIACRYPT 2012. ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_11

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-34961-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34960-7

  • Online ISBN: 978-3-642-34961-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature