{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:41:33Z","timestamp":1769298093132,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1255\/12"],"award-info":[{"award-number":["1255\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["307952"],"award-info":[{"award-number":["307952"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Check Point Institute for Information Security"},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1218461"],"award-info":[{"award-number":["1218461"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591859","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"505-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":70,"title":["On the existence of extractable one-way functions"],"prefix":"10.1145","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[{"name":"Boston University and Tel Aviv University"}]},{"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[{"name":"Boston University"}]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[{"name":"Efi Arazi School of Computer Science, IDC Herzliya, Israel"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875552"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704152"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.010"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_4"},{"key":"e_1_3_2_2_6_1","volume-title":"The haunting of the snark. Manuscript","author":"Bitansky N.","year":"2013","unstructured":"Bitansky , N. , Canetti , R. , Chiesa , A. , Goldwasser , S. , Lin , H. , Tromer , E. , and Rubinstein , A . The haunting of the snark. Manuscript ( 2013 ). Bitansky, N., Canetti, R., Chiesa, A., Goldwasser, S., Lin, H., Tromer, E., and Rubinstein, A. The haunting of the snark. Manuscript (2013)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_2_9_1","volume-title":"The impossibility of obfuscation with auxiliary input or a universal simulator. CoRR abs\/1401.0348","author":"Bitansky N.","year":"2014","unstructured":"Bitansky , N. , Canetti , R. , Cohn , H. , Goldwasser , S. , Kalai , Y. T. , Paneth , O. , and Rosen , A . The impossibility of obfuscation with auxiliary input or a universal simulator. CoRR abs\/1401.0348 ( 2014 ). Bitansky, N., Canetti, R., Cohn, H., Goldwasser, S., Kalai, Y. T., Paneth, O., and Rosen, A. The impossibility of obfuscation with auxiliary input or a universal simulator. CoRR abs\/1401.0348 (2014)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_16"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090264"},{"key":"e_1_3_2_2_13_1","first-page":"352","volume":"2013","author":"Boneh D.","year":"2013","unstructured":"Boneh , D. , and Waters , B. Constrained pseudorandom functions and their applications. IACR Cryptology e Print Archive 2013 ( 2013 ), 352 . Boneh, D., and Waters, B. Constrained pseudorandom functions and their applications. IACR Cryptology ePrint Archive 2013 (2013), 352.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_14_1","first-page":"642","volume":"2013","author":"Boneh D.","year":"2013","unstructured":"Boneh , D. , and Zhandry , M. Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. IACR Cryptology e Print Archive 2013 ( 2013 ), 642 . Boneh, D., and Zhandry, M. Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. IACR Cryptology ePrint Archive 2013 (2013), 642.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_15_1","first-page":"401","volume":"2013","author":"Boyle E.","year":"2013","unstructured":"Boyle , E. , Goldwasser , S. , and Ivan , I. Functional signatures and pseudorandom functions. IACR Cryptology e Print Archive 2013 ( 2013 ), 401 . Boyle, E., Goldwasser, S., and Ivan, I. Functional signatures and pseudorandom functions. IACR Cryptology ePrint Archive 2013 (2013), 401.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_16_1","first-page":"703","volume":"2013","author":"Boyle E.","year":"2013","unstructured":"Boyle , E. , and Pass , R. Limits of extractability assumptions with distributional auxiliary input. IACR Cryptology e Print Archive 2013 ( 2013 ), 703 . Boyle, E., and Pass, R. Limits of extractability assumptions with distributional auxiliary input. IACR Cryptology ePrint Archive 2013 (2013), 703.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_37"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_35"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.14"},{"key":"e_1_3_2_2_20_1","first-page":"476","author":"Coron J.-S.","year":"2013","unstructured":"Coron , J.-S. , Lepoint , T. , and Tibouchi , M. Practical multilinear maps over the integers. In CRYPTO (1) ( 2013 ), pp. 476 -- 493 . Coron, J.-S., Lepoint, T., and Tibouchi, M. Practical multilinear maps over the integers. In CRYPTO (1) (2013), pp. 476--493.","journal-title":"CRYPTO (1) ("},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.759582"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_21"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703426817"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792230010"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"e_1_3_2_2_27_1","first-page":"601","volume":"2013","author":"Garg S.","year":"2013","unstructured":"Garg , S. , Gentry , C. , Halevi , S. , and Raykova , M. Two -round secure mpc from indistinguishability obfuscation. IACR Cryptology e Print Archive 2013 ( 2013 ), 601 . Garg, S., Gentry, C., Halevi, S., and Raykova, M. Two-round secure mpc from indistinguishability obfuscation. IACR Cryptology ePrint Archive 2013 (2013), 601.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881424"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00195207"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.60"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706338"},{"key":"e_1_3_2_2_41_1","first-page":"509","volume":"2013","author":"Hohenberger S.","year":"2013","unstructured":"Hohenberger , S. , Sahai , A. , and Waters , B. Replacing a random oracle: Full domain hash from indistinguishability obfuscation. IACR Cryptology e Print Archive 2013 ( 2013 ), 509 . Hohenberger, S., Sahai, A., and Waters, B. Replacing a random oracle: Full domain hash from indistinguishability obfuscation. IACR Cryptology ePrint Archive 2013 (2013), 509.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591809"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516668"},{"key":"e_1_3_2_2_44_1","first-page":"683","volume":"2013","author":"Koppula V.","year":"2013","unstructured":"Koppula , V. , Ramchen , K. , and Waters , B. Separations in circular security for arbitrary length key cycles. IACR Cryptology e Print Archive 2013 ( 2013 ), 683 . Koppula, V., Ramchen, K., and Waters, B. Separations in circular security for arbitrary length key cycles. IACR Cryptology ePrint Archive 2013 (2013), 683.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_2_46_1","first-page":"121","volume":"2013","author":"Lipmaa H.","year":"2013","unstructured":"Lipmaa , H. Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. IACR Cryptology e Print Archive 2013 ( 2013 ), 121 . Lipmaa, H. Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. IACR Cryptology ePrint Archive 2013 (2013), 121.","journal-title":"Print Archive"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.016"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_24"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591825"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":50,"alternative-id":["10.1145\/2591796.2591859","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591859","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}