{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T01:40:05Z","timestamp":1745199605323,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642349607"},{"type":"electronic","value":"9783642349614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34961-4_11","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T09:22:26Z","timestamp":1353057746000},"page":"154-171","source":"Crossref","is-referenced-by-count":5,"title":["The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions"],"prefix":"10.1007","author":[{"given":"Scott","family":"Ames","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. SIAM Journal of Computing, 112\u2013117 (1982)","key":"11_CR1","DOI":"10.1109\/SFCS.1982.72"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/3-540-46877-3_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"A. Santis De","year":"1991","unstructured":"De Santis, A., Yung, M.: On the Design of Provably-Secure Cryptographic Hash Functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 412\u2013431. Springer, Heidelberg (1991)"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. In: FOCS 2000, pp. 305\u2013313 (2000)","key":"11_CR3","DOI":"10.1109\/SFCS.2000.892119"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM Journal of Computing"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989, pp. 25\u201332 (1989)","key":"11_CR5","DOI":"10.1145\/73007.73010"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing\u00a017, 281\u2013308 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the Power of the Randomized Iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 22\u201340. Springer, Heidelberg (2006)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-13190-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I. Haitner","year":"2010","unstructured":"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.\u00a06110, pp. 616\u2013637. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible Entropy. In: STOC 2009, pp. 611\u2013620 (2009)","key":"11_CR9","DOI":"10.1145\/1536414.1536497"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11818175_3","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Halevi","year":"2006","unstructured":"Halevi, S., Krawczyk, H.: Strengthening Digital Signatures Via Randomized Hashing. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 41\u201359. Springer, Heidelberg (2006)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1989","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal of Computing\u00a028(4), 1364\u20131396 (1989)","journal-title":"SIAM Journal of Computing"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and their Cryptographic Applications. In: STOC 1989, pp. 33\u201343 (1989)","key":"11_CR12","DOI":"10.1145\/73007.73011"},{"doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-Way Functions are Necessary and Sufficient for Secure Signatures. In: STOC 1990, pp. 387\u2013394 (1990)","key":"11_CR13","DOI":"10.1145\/100216.100269"},{"issue":"12","key":"11_CR14","doi-asserted-by":"publisher","first-page":"4299","DOI":"10.1109\/TIT.2005.859244","volume":"51","author":"P. Sarkar","year":"2005","unstructured":"Sarkar, P.: Masking-based domain extenders for UOWHFs: bounds and constructions. IEEE Transactions on Information Theory\u00a051(12), 4299\u20134311 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: A Composition Theorem for Universal One-Way Hash Functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 445\u2013452. Springer, Heidelberg (2000)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"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.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: FOCS, pp. 80\u201391 (1982)","key":"11_CR17","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34961-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T01:08:26Z","timestamp":1745197706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34961-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349607","9783642349614"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34961-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}