{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T20:36:32Z","timestamp":1793738192783,"version":"4.6.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"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":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688105","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T15:42:45Z","timestamp":1421077365000},"page":"163-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":111,"title":["On the Communication Complexity of Secure Function Evaluation with Long Output"],"prefix":"10.1145","author":[{"given":"Pavel","family":"Hubacek","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"S.\n      Agrawal S.\n      Gorbunov V.\n      Vaikuntanathan and \n      H.\n      Wee\n  . \n  Functional encryption: New perspectives and lower bounds\n  . In R. Canetti and J. A. Garay editors CRYPTO (2) volume \n  8043\n   of \n  LNCS pages \n  500\n  --\n  518\n  . \n  Springer 2013\n  .  S. Agrawal S. Gorbunov V. Vaikuntanathan and H. Wee. Functional encryption: New perspectives and lower bounds. In R. Canetti and J. A. Garay editors CRYPTO (2) volume 8043 of LNCS pages 500--518. Springer 2013.","DOI":"10.1007\/978-3-642-40084-1_28"},{"key":"e_1_3_2_1_2_1","first-page":"689","volume":"2013","author":"Ananth P.","year":"2013","journal-title":"Differing-inputs obfuscation and applications. IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"B.\n      Applebaum Y.\n      Ishai E.\n      Kushilevitz and \n      B.\n      Waters\n  . \n  Encoding functions with constant online rate or how to compress garbled circuits keys\n  . In R. Canetti and J. A. Garay editors CRYPTO (2) volume \n  8043\n   of \n  LNCS pages \n  166\n  --\n  184\n  . \n  Springer 2013\n  .  B. Applebaum Y. Ishai E. Kushilevitz and B. Waters. Encoding functions with constant online rate or how to compress garbled circuits keys. In R. Canetti and J. A. Garay editors CRYPTO (2) volume 8043 of LNCS pages 166--184. Springer 2013.","DOI":"10.1007\/978-3-642-40084-1_10"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"B.\n      Barak O.\n      Goldreich R.\n      Impagliazzo S.\n      Rudich A.\n      Sahai S. P.\n      Vadhan and \n      K.\n      Yang\n  . \n  On the (im)possibility of obfuscating programs\n  . In J. Kilian editor CRYPTO volume \n  2139\n   of \n  LNCS pages \n  1\n  --\n  18\n  . \n  Springer 2001\n  .   B. Barak O. Goldreich R. Impagliazzo S. Rudich A. Sahai S. P. Vadhan and K. Yang. On the (im)possibility of obfuscating programs. In J. Kilian editor CRYPTO volume 2139 of LNCS pages 1--18. Springer 2001.","DOI":"10.1007\/3-540-44647-8_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"E.\n      Boyle K.-M.\n      Chung and \n      R.\n      Pass\n  . \n  On extractability obfuscation\n  . In Y. Lindell editor TCC volume \n  8349\n   of \n  LNCS pages \n  52\n  --\n  73\n  . \n  Springer 2014\n  .  E. Boyle K.-M. Chung and R. Pass. On extractability obfuscation. In Y. Lindell editor TCC volume 8349 of LNCS pages 52--73. Springer 2014.","DOI":"10.1007\/978-3-642-54242-8_3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_9_1","first-page":"752","volume":"2013","author":"De Caro A.","year":"2013","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"A.\n      De Caro V.\n      Iovino A.\n      Jain A.\n      O'Neill O.\n      Paneth and \n      G.\n      Persiano\n  . \n  On the achievability of simulation-based security for functional encryption\n  . In R. Canetti and J. A. Garay editors CRYPTO (2) volume \n  8043\n   of \n  LNCS pages \n  519\n  --\n  535\n  . \n  Springer 2013\n  .  A. De Caro V. Iovino A. Jain A. O'Neill O. Paneth and G. Persiano. On the achievability of simulation-based security for functional encryption. In R. Canetti and J. A. Garay editors CRYPTO (2) volume 8043 of LNCS pages 519--535. Springer 2013.","DOI":"10.1007\/978-3-642-40084-1_29"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"S.\n      Garg C.\n      Gentry S.\n      Halevi and \n      D.\n      Wichs\n  . \n  On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input\n  . In J. A. Garay and R. Gennaro editors CRYPTO (1) volume \n  8616\n   of \n  LNCS pages \n  518\n  --\n  535\n  . \n  Springer 2014\n  .  S. Garg C. Gentry S. Halevi and D. Wichs. On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In J. A. Garay and R. Gennaro editors CRYPTO (1) volume 8616 of LNCS pages 518--535. Springer 2014.","DOI":"10.1007\/978-3-662-44371-2_29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.50"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"C.\n      Gentry A.\n      Sahai and \n      B.\n      Waters\n  . \n  Homomorphic encryption from learning with errors: Conceptually-simpler asymptotically-faster attribute-based\n  . In R. Canetti and J. A. Garay editors CRYPTO (1) volume \n  8042\n   of \n  LNCS pages \n  75\n  --\n  92\n  . \n  Springer 2013\n  .  C. Gentry A. Sahai and B. Waters. Homomorphic encryption from learning with errors: Conceptually-simpler asymptotically-faster attribute-based. In R. Canetti and J. A. Garay editors CRYPTO (1) volume 8042 of LNCS pages 75--92. Springer 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_16_1","first-page":"727","volume":"2013","author":"Goldwasser S.","year":"2013","journal-title":"Multi-input functional encryption. IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488678"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_10"},{"key":"e_1_3_2_1_20_1","first-page":"669","volume":"2014","author":"Hub\u00e1cek P.","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Y.\n      Lindell K.\n      Nissim and \n      C.\n      Orlandi\n  . \n  Hiding the input-size in secure two-party computation\n  . In K. Sako and P. Sarkar editors ASIACRYPT volume \n  8270\n   of \n  LNCS pages \n  421\n  --\n  440\n  . \n  Springer 2013\n  .  Y. Lindell K. Nissim and C. Orlandi. Hiding the input-size in secure two-party computation. In K. Sako and P. Sarkar editors ASIACRYPT volume 8270 of LNCS pages 421--440. Springer 2013.","DOI":"10.1007\/978-3-642-42045-0_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","location":"Rehovot Israel","acronym":"ITCS'15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:04Z","timestamp":1750212784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":25,"alternative-id":["10.1145\/2688073.2688105","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688105","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}