{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T04:26:30Z","timestamp":1744777590799,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306334"},{"type":"electronic","value":"9783031306341"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30634-1_17","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T23:03:07Z","timestamp":1681513387000},"page":"502-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-adaptive Universal One-Way Hash Functions from\u00a0Arbitrary One-Way Functions"],"prefix":"10.1007","author":[{"given":"Xinyu","family":"Mao","sequence":"first","affiliation":[]},{"given":"Noam","family":"Mazor","sequence":"additional","affiliation":[]},{"given":"Jiapeng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/978-3-030-26951-7_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Agrawal","year":"2019","unstructured":"Agrawal, R., Chen, Y.-H., Horel, T., Vadhan, S.: Unifying computational entropies via Kullback\u2013Leibler divergence. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 831\u2013858. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_28"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-34961-4_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"S Ames","year":"2012","unstructured":"Ames, S., Gennaro, R., Venkitasubramaniam, M.: The generalized randomized iterate and its application to new efficient constructions of UOWHFs from regular one-way functions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 154\u2013171. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_11"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Haramaty-Krasne, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.7","DOI":"10.4230\/LIPIcs.ITCS.2017.7"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$\\text{ NC}^0$$. SIAM J. Comput. 36(4), 845\u2013888 (2006). https:\/\/doi.org\/10.1137\/S0097539705446950","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00145-016-9232-x","volume":"30","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B., Moses, Y.: Locally computable UOWHF with linear shrinkage. J. Cryptol. 30(3), 672\u2013698 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9232-x","journal-title":"J. Cryptol."},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/15M1034064","volume":"45","author":"G Asharov","year":"2016","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. SIAM J. Comput. 45(6), 2117\u20132176 (2016). https:\/\/doi.org\/10.1137\/15M1034064","journal-title":"SIAM J. Comput."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-642-36594-2_37","volume-title":"Theory of Cryptography","author":"K Barhum","year":"2013","unstructured":"Barhum, K., Holenstein, T.: A cookbook for black-box separations and a recipe for UOWHFs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 662\u2013679. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_37"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-33481-8_13","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"K Barhum","year":"2012","unstructured":"Barhum, K., Maurer, U.: UOWHFs from OWFs: trading regularity for efficiency. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol. 7533, pp. 234\u2013253. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33481-8_13"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-78375-8_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Berman","year":"2018","unstructured":"Berman, I., Degwekar, A., Rothblum, R.D., Vasudevan, P.N.: Multi-collision resistant hash functions and their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 133\u2013161. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_5"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 671\u2013684 (2018). https:\/\/doi.org\/10.1145\/3188745.3188870","DOI":"10.1145\/3188745.3188870"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: Annual Symposium on Foundations of Computer Science (FOCS), pp. 112\u2013117 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.72","DOI":"10.1109\/SFCS.1982.72"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/S0097539704443276","volume":"35","author":"R Gennaro","year":"2005","unstructured":"Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J. Comput. 35(1), 217\u2013246 (2005). https:\/\/doi.org\/10.1137\/S0097539704443276","journal-title":"SIAM J. Comput."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-22670-0_10","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 76\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_10"},{"key":"17_CR14","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. 4117, pp. 22\u201340. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_2"},{"key":"17_CR15","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. 6110, pp. 616\u2013637. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_31"},{"key":"17_CR16","unstructured":"Haitner, I., Mazor, N., Silbak, J.: Incompressibility and next-block pseudoentropy. 14th Innovations in Theoretical Computer Science (2023)"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/100814421","volume":"42","author":"I Haitner","year":"2013","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructing pseudorandom generators from one-way functions. SIAM J. Comput. 42(3), 1405\u20131430 (2013). https:\/\/doi.org\/10.1137\/100814421","journal-title":"SIAM J. Comput."},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible entropy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 611\u2013620 (2009). https:\/\/doi.org\/10.1145\/1536414.1536497","DOI":"10.1145\/1536414.1536497"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Holenstein, T., Sinha, M.: Constructing a pseudorandom generator requires an almost linear number of calls. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 698\u2013707. IEEE (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.51","DOI":"10.1109\/FOCS.2012.51"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Holmgren, J., Lombardi, A.: Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications). In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 850\u2013858. IEEE (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00085","DOI":"10.1109\/FOCS.2018.00085"},{"key":"17_CR22","unstructured":"Katz, J., Koo, C.Y.: On constructing universal one-way hash functions from arbitrary one-way functions. Cryptology ePrint Archive (2005)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-78375-8_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Collision resistant hashing for paranoids: dealing with multiple collisions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 162\u2013194. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_6"},{"key":"17_CR24","unstructured":"Mao, X., Mazor, N., Zhang, J.: Non-adaptive universal one-way hash functions from arbitrary one-way functions. Cryptology ePrint Archive, Paper 2022\/431 (2022). https:\/\/eprint.iacr.org\/2022\/431"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-030-90453-1_16","volume-title":"Theory of Cryptography","author":"N Mazor","year":"2021","unstructured":"Mazor, N., Zhang, J.: Simple constructions from (almost) regular one-way functions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 457\u2013485. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_16"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 33\u201343 (1989). https:\/\/doi.org\/10.1145\/73007.73011","DOI":"10.1145\/73007.73011"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 387\u2013394 (1990). https:\/\/doi.org\/10.1145\/100216.100269","DOI":"10.1145\/100216.100269"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Rothblum, R.D., Vasudevan, P.N.: Collision-resistance from multi-collision-resistance. In: Advances in Cryptology-CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, 15\u201318 August 2022, Proceedings, Part III, pp. 503\u2013529. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_17","DOI":"10.1007\/978-3-031-15982-4_17"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Vadhan, S., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 817\u2013836 (2012). https:\/\/doi.org\/10.1145\/2213977.2214051","DOI":"10.1145\/2213977.2214051"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 80\u201391. IEEE (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-48000-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Yu Yu","year":"2015","unstructured":"Yu, Yu., Gu, D., Li, X., Weng, J.: (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 209\u2013229. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_11"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30634-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:45Z","timestamp":1744754625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30634-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306334","9783031306341"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30634-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}