{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:21:41Z","timestamp":1744755701602},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642365935"},{"type":"electronic","value":"9783642365942"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_37","type":"book-chapter","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T21:43:27Z","timestamp":1360187007000},"page":"662-679","source":"Crossref","is-referenced-by-count":5,"title":["A Cookbook for Black-Box Separations and a Recipe for UOWHFs"],"prefix":"10.1007","author":[{"given":"Kfir","family":"Barhum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Holenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","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.\u00a07658, pp. 154\u2013171. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115. IEEE Computer Society (2001)","key":"37_CR2","DOI":"10.1109\/SFCS.2001.959885"},{"unstructured":"Barhum, K., Holenstein, T.: A Cookbook for Black-Box Separations and a Recipe for UOWHFs. Full version available as ECCC report TR12-173","key":"37_CR3"},{"key":"37_CR4","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.\u00a07533, pp. 234\u2013253. Springer, Heidelberg (2012)"},{"issue":"1","key":"37_CR5","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.\u00a035(1), 217\u2013246 (2005)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: FOCS, pp. 669\u2013679. IEEE Computer Society (2007)","key":"37_CR6","DOI":"10.1109\/FOCS.2007.7"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-00457-5_13","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Holenstein, T.: On the (Im)Possibility of Key Dependent Encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 202\u2013219. Springer, Heidelberg (2009)"},{"key":"37_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":"Holenstein, T., Sinha, M.: Constructing a pseudorandom generator requires an almost linear number of calls. CoRR, abs\/1205.4576 (2012)","key":"37_CR9","DOI":"10.1109\/FOCS.2012.51"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44\u201361. ACM (1989)","key":"37_CR10","DOI":"10.1145\/73007.73012"},{"unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutation-based hash functions. In: FOCS, pp. 535\u2013542. IEEE Computer Society (1999)","key":"37_CR11"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC, pp. 33\u201343. ACM (1989)","key":"37_CR12","DOI":"10.1145\/73007.73011"},{"key":"37_CR13","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.P.: Notions of Reducibility between Cryptographic Primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394. ACM (1990)","key":"37_CR14","DOI":"10.1145\/100216.100269"},{"issue":"7","key":"37_CR15","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1137\/100782929","volume":"39","author":"A. Rosen","year":"2010","unstructured":"Rosen, A., Segev, G.: Chosen-ciphertext security via correlated products. SIAM J. Comput.\u00a039(7), 3058\u20133088 (2010)","journal-title":"SIAM J. Comput."},{"key":"37_CR16","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":"37_CR17","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.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: FOCS, pp. 80\u201391. IEEE Computer Society (1982)","key":"37_CR18","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36594-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:08:50Z","timestamp":1557529730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}