{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:49Z","timestamp":1750306789687,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,1,12]]},"DOI":"10.1145\/2554797.2554801","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"23-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Limits of random oracles in secure computation"],"prefix":"10.1145","author":[{"given":"Mohammad","family":"Mahmoody","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63440"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.38"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_22"},{"key":"e_1_3_2_1_5_1","first-page":"65","volume-title":"Proceedings of DIMACS Workshop on Distributed Computing and Cryptography","volume":"2","author":"Beaver D.","year":"1989","unstructured":"D. Beaver . Perfect privacy for two-party protocols. In J. Feigenbaum and M. Merritt, editors , Proceedings of DIMACS Workshop on Distributed Computing and Cryptography , volume 2 , pages 65 -- 77 . American Mathematical Society , 1989 . D. Beaver. Perfect privacy for two-party protocols. In J. Feigenbaum and M. Merritt, editors, Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, volume 2, pages 65--77. American Mathematical Society, 1989."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703968"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.67"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73013"},{"key":"e_1_3_2_1_9_1","volume-title":"Martingales, collective coin flipping and discrete control processes (extended abstract)","author":"Cleve R.","year":"1993","unstructured":"R. Cleve and R. Impagliazzo . Martingales, collective coin flipping and discrete control processes (extended abstract) , 1993 . R. Cleve and R. Impagliazzo. Martingales, collective coin flipping and discrete control processes (extended abstract), 1993."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987296"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443276"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796557"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875550"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802646"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725404"},{"key":"e_1_3_2_1_17_1","first-page":"129","volume":"19","author":"Haitner I.","year":"2012","unstructured":"I. Haitner , E. Omri , and H. Zarosim . On the power of random oracles. Electronic Colloquium on Computational Complexity (ECCC) , 19 : 129 , 2012 . I. Haitner, E. Omri, and H. Zarosim. On the power of random oracles. Electronic Colloquium on Computational Complexity (ECCC), 19:129, 2012.","journal-title":"On the power of random oracles. Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_25"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/829497.829786"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_1_22_1","volume-title":"TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings","volume":"6597","author":"Ishai Y.","year":"2011","unstructured":"Y. Ishai , editor. Theory of Cryptography - 8th Theory of Cryptography Conference , TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings , volume 6597 of Lecture Notes in Computer Science. Springer , 2011 . Y. Ishai, editor. Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings, volume 6597 of Lecture Notes in Computer Science. Springer, 2011."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007"},{"key":"e_1_3_2_1_24_1","first-page":"615","volume-title":"Ishai {22}","author":"Katz J.","unstructured":"J. Katz , D. Schr\u00f6der , and A. Yerukhimovich . Impossibility of blind signatures from one-way permutations . In Ishai {22} , pages 615 -- 629 . J. Katz, D. Schr\u00f6der, and A. Yerukhimovich. Impossibility of blind signatures from one-way permutations. In Ishai {22}, pages 615--629."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103475"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335342"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321742"},{"key":"e_1_3_2_1_28_1","first-page":"535","volume-title":"FOCS","author":"Kim J. H.","year":"1999","unstructured":"J. H. Kim , D. R. Simon , and P. Tetali . Limits on the efficiency of one-way permutation-based hash functions . In FOCS , pages 535 -- 542 , 1999 . J. H. Kim, D. R. Simon, and P. Tetali. Limits on the efficiency of one-way permutation-based hash functions. In FOCS, pages 535--542, 1999."},{"key":"e_1_3_2_1_29_1","volume-title":"Manuscript","author":"Kraschewski D.","year":"2013","unstructured":"D. Kraschewski , H. K. Maji , M. Prabhakaran , and A. Sahai . A full characterization of completeness for two-party randomized function evaluation . Manuscript , 2013 . D. Kraschewski, H. K. Maji, M. Prabhakaran, and A. Sahai. A full characterization of completeness for two-party randomized function evaluation. Manuscript, 2013."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987289"},{"key":"e_1_3_2_1_31_1","first-page":"382","volume-title":"Ishai {22}","author":"Kreitz G.","unstructured":"G. Kreitz . A zero-one law for secure multi-party computation with ternary outputs . In Ishai {22} , pages 382 -- 399 . G. Kreitz. A zero-one law for secure multi-party computation with ternary outputs. In Ishai {22}, pages 382--399."},{"key":"e_1_3_2_1_32_1","first-page":"238","volume-title":"Reingold {46}","author":"K\u00fcnzler R.","unstructured":"R. K\u00fcnzler , J. M\u00fcller-Quade , and D. Raub . Secure computability of functions in the it setting with dishonest majority and applications to long-term security . In Reingold {46} , pages 238 -- 255 . R. K\u00fcnzler, J. M\u00fcller-Quade, and D. Raub. Secure computability of functions in the it setting with dishonest majority and applications to long-term security. In Reingold {46}, pages 238--255."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63512"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_3"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_9"},{"key":"e_1_3_2_1_36_1","volume-title":"Limits of random oracles in secure computation. Electronic Colloquium on Computational Complexity (ECCC), 19: 65","author":"Mahmoody M.","year":"2012","unstructured":"M. Mahmoody , H. K. Maji , and M. Prabhakaran . Limits of random oracles in secure computation. Electronic Colloquium on Computational Complexity (ECCC), 19: 65 , 2012 . http:\/\/eccc.hpi-web.de\/report\/2012\/065\/. M. Mahmoody, H. K. Maji, and M. Prabhakaran. Limits of random oracles in secure computation. Electronic Colloquium on Computational Complexity (ECCC), 19:65, 2012. http:\/\/eccc.hpi-web.de\/report\/2012\/065\/."},{"key":"e_1_3_2_1_37_1","volume-title":"TCC (To Appear), 2014","author":"Mahmoody M.","year":"2013","unstructured":"M. Mahmoody , H. K. Maji , and M. Prabhakaran . On the power of public-key encryption in secure computation . In TCC (To Appear), 2014 . Full version available from IACR Eprint Archive : http:\/\/eccc.hpi-web.de\/report\/ 2013 \/137\/. M. Mahmoody, H. K. Maji, and M. Prabhakaran. On the power of public-key encryption in secure computation. In TCC (To Appear), 2014. Full version available from IACR Eprint Archive: http:\/\/eccc.hpi-web.de\/report\/2013\/137\/."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987298"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_16"},{"key":"e_1_3_2_1_40_1","first-page":"266","volume-title":"A. C.-C","author":"Maji H. K.","year":"2010","unstructured":"H. K. Maji , M. Prabhakaran , and M. Rosulek . Cryptographic complexity classes and computational intractability assumptions . In A. C.-C . Yao, editor, ICS, pages 266 -- 289 . Tsinghua University Press , 2010 . H. K. Maji, M. Prabhakaran, and M. Rosulek. Cryptographic complexity classes and computational intractability assumptions. In A. C.-C. Yao, editor, ICS, pages 266--289. Tsinghua University Press, 2010."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881453"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34931-7_4"},{"key":"e_1_3_2_1_43_1","first-page":"597","volume-title":"Ishai {22}","author":"Matsuda T.","unstructured":"T. Matsuda and K. Matsuura . On black-box separations among injective one-way functions . In Ishai {22} , pages 597 -- 614 . T. Matsuda and K. Matsuura. On black-box separations among injective one-way functions. In Ishai {22}, pages 597--614."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160253"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1530441"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"O.\n      Reingold L.\n      Trevisan and \n      S. P.\n      Vadhan\n  . \n  Notions of reducibility between cryptographic primitives\n  . In M. Naor editor TCC volume \n  2951\n   of \n  Lecture Notes in Computer Science pages \n  1\n  --\n  20\n  . \n  Springer 2004\n  .  O. Reingold L. Trevisan and S. P. Vadhan. Notions of reducibility between cryptographic primitives. In M. Naor editor TCC volume 2951 of Lecture Notes in Computer Science pages 1--20. Springer 2004.","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054137"}],"event":{"name":"ITCS'14: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Princeton New Jersey USA","acronym":"ITCS'14"},"container-title":["Proceedings of the 5th conference on Innovations in theoretical computer science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554797.2554801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:21Z","timestamp":1750232061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":47,"alternative-id":["10.1145\/2554797.2554801","10.1145\/2554797"],"URL":"https:\/\/doi.org\/10.1145\/2554797.2554801","relation":{},"subject":[],"published":{"date-parts":[[2014,1,12]]},"assertion":[{"value":"2014-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}