{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:49:05Z","timestamp":1743018545564,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904524"},{"type":"electronic","value":"9783030904531"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90453-1_15","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T14:14:32Z","timestamp":1636035272000},"page":"429-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Derandomizing Yao\u2019s Weak-to-Strong OWF Construction"],"prefix":"10.1007","author":[{"given":"Chris","family":"Brzuska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pihla","family":"Karanko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Rohrbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"15_CR1","series-title":"LNCS","first-page":"543","volume-title":"CRYPTO 2018, Part II","author":"N Attrapadung","year":"2018","unstructured":"Attrapadung, N., Matsuda, T., Nishimaki, R., Yamada, S., Yamakawa, T.: Constrained PRFs for $$\\rm NC^1$$ in traditional groups. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 543\u2013574. Springer, Heidelberg (2018)"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1(1), 3\u201340 (1991)","journal-title":"Comput. Complex."},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L Babai","year":"1993","unstructured":"Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unlessexptime has publishable proofs. Comput. Complex. 3(4), 307\u2013318 (1993)","journal-title":"Comput. Complex."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-42033-7_16","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"P Baecher","year":"2013","unstructured":"Baecher, P., Brzuska, C., Fischlin, M.: Notions of black-box reductions, revisited. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 296\u2013315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_16"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1996.0095","volume":"131","author":"C Blundo","year":"1996","unstructured":"Blundo, C., Santis, A.D., Vaccaro, U.: Randomness in distribution protocols. Inf. Comput. 131(2), 111\u2013139 (1996)","journal-title":"Inf. Comput."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-74143-5_15","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Rivest, R., Sudan, M., Trevisan, L., Vadhan, S., Wee, H.: Amplifying collision resistance: a complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 264\u2013283. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_15"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26954-8_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: 35th ACM STOC, pp. 417\u2013425. ACM Press, June 2003","key":"15_CR8","DOI":"10.1145\/780542.780604"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st FOCS, pp. 305\u2013313. IEEE Computer Society Press, November 2000","key":"15_CR9","DOI":"10.1109\/SFCS.2000.892119"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: 31st FOCS, pp. 318\u2013326. IEEE Computer Society Press, October 1990","key":"15_CR10","DOI":"10.1109\/FSCS.1990.89550"},{"unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On yao\u2019s xor lemma. Technical report TR95-050, Electronic Colloquium on Computational Complexity (1995)","key":"15_CR11"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-19571-6_12","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2011","unstructured":"Goyal, V., O\u2019Neill, A., Rao, V.: Correlated-input secure hash functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 182\u2013200. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_12"},{"doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 437\u2013446. ACM Press, June 2010","key":"15_CR13","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"15_CR14","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)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Healy, A., Vadhan, S.P., Viola, E.: Using nondeterminism to amplify hardness. In: Babai, L. (ed.) 36th ACM STOC, pp. 192\u2013201. ACM Press, June 2004","key":"15_CR15","DOI":"10.1145\/1007352.1007389"},{"key":"15_CR16","series-title":"LNCS","first-page":"558","volume-title":"PKC 2012","author":"B Hemenway","year":"2012","unstructured":"Hemenway, B., Lu, S., Ostrovsky, R.: Correlated product security from any one-way function. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 558\u2013575. Springer, Heidelberg (May (2012)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C-Y Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding collisions on a public road, or do secure hash functions need secret coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 92\u2013105. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_6"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: 36th FOCS, pp. 538\u2013545. IEEE Computer Society Press, October 1995","key":"15_CR18","DOI":"10.1109\/SFCS.1995.492584"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st ACM STOC, pp. 44\u201361. ACM Press, May 1989","key":"15_CR19","DOI":"10.1145\/73007.73012"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/0-387-34799-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"R Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 8\u201326. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_2"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: 29th ACM STOC, pp. 220\u2013229. ACM Press, May 1997","key":"15_CR21","DOI":"10.1145\/258533.258590"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutation-based hash functions. In: 40th FOCS, pp. 535\u2013542. IEEE Computer Society Press, October 1999","key":"15_CR23"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-30576-7_3","volume-title":"Theory of Cryptography","author":"H Lin","year":"2005","unstructured":"Lin, H., Trevisan, L., Wee, H.: On hardness amplification of one-way functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 34\u201349. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_3"},{"key":"15_CR25","first-page":"191","volume":"2","author":"R Lipton","year":"1991","unstructured":"Lipton, R.: New directions in testing. Distrib. Comput. Cryptogr. 2, 191\u2013202 (1991)","journal-title":"Distrib. Comput. Cryptogr."},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/11681878_24","volume-title":"Theory of Cryptography","author":"C-J Lu","year":"2006","unstructured":"Lu, C.-J.: On the complexity of parallel hardness amplification for one-way functions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 462\u2013481. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_24"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-01001-9_4","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"C-J Lu","year":"2009","unstructured":"Lu, C.-J.: On the security loss in cryptographic reductions. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 72\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_4"},{"unstructured":"Mahmoody, M., Mohammed, A., Nematihaji, S., Pass, R., Shelat, A.: A note on black-box separations for indistinguishability obfuscation. Cryptology ePrint Archive, Report 2016\/316 (2016). https:\/\/eprint.iacr.org\/2016\/316","key":"15_CR28"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-ciphertext security via correlated products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 419\u2013436. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_25"},{"doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Viola, E.: Hardness amplification proofs require majority. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 589\u2013598. ACM Press, May 2008","key":"15_CR31","DOI":"10.1145\/1374376.1374461"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"DR Simon","year":"1998","unstructured":"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\u2013345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054137"},{"issue":"2","key":"15_CR33","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62(2), 236\u2013266 (2001)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Trevisan, L.: List-decoding using the XOR lemma. In: 44th FOCS, pp. 126\u2013135. IEEE Computer Society Press, October 2003","key":"15_CR34","DOI":"10.1109\/SFCS.2003.1238187"},{"doi-asserted-by":"crossref","unstructured":"Trevisan, L.: On uniform amplification of hardness in NP. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 31\u201338. ACM Press, May 2005","key":"15_CR35","DOI":"10.1145\/1060590.1060595"},{"doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 817\u2013836. ACM Press, May 2012","key":"15_CR36","DOI":"10.1145\/2213977.2214051"},{"doi-asserted-by":"crossref","unstructured":"Viola, E.: The complexity of constructing pseudorandom generators from hard functions. Comput. Complex. 13(3\u20134), 147\u2013188 (2005)","key":"15_CR37","DOI":"10.1007\/s00037-004-0187-1"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-70936-7_23","volume-title":"Theory of Cryptography","author":"H Wee","year":"2007","unstructured":"Wee, H.: One-way permutations, interactive hashing and statistically hiding commitments. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 419\u2013433. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_23"},{"doi-asserted-by":"crossref","unstructured":"Wichs, D.: Barriers in cryptography with weak, correlated and leaky sources. In: Kleinberg, R.D. (ed.) ITCS 2013, pp. 111\u2013126. ACM, January 2013","key":"15_CR39","DOI":"10.1145\/2422436.2422451"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd FOCS, pp. 80\u201391. IEEE Computer Society Press, November 1982","key":"15_CR40","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90453-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:22:11Z","timestamp":1730683331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90453-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904524","9783030904531"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90453-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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)"}}]}}