{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:27Z","timestamp":1750306647107,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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,7,15]]},"DOI":"10.1145\/2611462.2611480","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"20-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributing the setup in universally composable multi-party computation"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[{"name":"University of Athens, Athens, Greece"}]},{"given":"Hong-Sheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Virginia Commonwealth University, Richmond, VA, USA"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.71"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R.\n      Canetti\n    .\n  Obtaining universally compoable security: Towards the bare bones of trust (invited talk)\n  . In K. Kurosawa editor ASIACRYPT \n  2007 volume \n  4833\n   of \n  LNCS pages \n  88\n  -\n  112\n  . \n  Springer Dec. 2007.   R. Canetti. Obtaining universally compoable security: Towards the bare bones of trust (invited talk). In K. Kurosawa editor ASIACRYPT 2007 volume 4833 of LNCS pages 88-112. Springer Dec. 2007.","DOI":"10.1007\/978-3-540-76900-2_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"R.\n      Canetti Y.\n      Dodis R.\n      Pass and \n      S.\n      Walfish\n  . \n  Universally composable security with global setup\n  . In S. P. Vadhan editor TCC \n  2007 volume \n  4392\n   of \n  LNCS pages \n  61\n  -\n  85\n  . \n  Springer Feb. 2007.   R. Canetti Y. Dodis R. Pass and S. Walfish. Universally composable security with global setup. In S. P. Vadhan editor TCC 2007 volume 4392 of LNCS pages 61-85. Springer Feb. 2007.","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"R.\n      Canetti\n     and \n      M.\n      Fischlin\n  . \n  Universally composable commitments\n  . In J. Kilian editor CRYPTO \n  2001 volume \n  2139\n   of \n  LNCS pages \n  19\n  -\n  40\n  . \n  Springer Aug. 2001.   R. Canetti and M. Fischlin. Universally composable commitments. In J. Kilian editor CRYPTO 2001 volume 2139 of LNCS pages 19-40. Springer Aug. 2001.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0419-9"},{"key":"e_1_3_2_1_7_1","first-page":"494","volume-title":"STOC 2002","author":"Canetti R.","year":"2002","unstructured":"R. Canetti , Y. Lindell , R. Ostrovsky , and A. Sahai . Universally composable two-party and multiparty secure computation. In J. H. Reif, editor , STOC 2002 , pages 494 - 503 . ACM Press , May 2002 . R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multiparty secure computation. In J. H. Reif, editor, STOC 2002, pages 494-503. ACM Press, May 2002."},{"key":"e_1_3_2_1_8_1","first-page":"249","volume-title":"FOCS 2007","author":"Canetti R.","year":"2007","unstructured":"R. Canetti , R. Pass , and A. Shelat . Cryptography from sunspots: How to use an imperfect reference string. In A. Sinclair, editor , FOCS 2007 , pages 249 - 259 . IEEE Computer Society Press , Oct. 2007 . R. Canetti, R. Pass, and A. Shelat. Cryptography from sunspots: How to use an imperfect reference string. In A. Sinclair, editor, FOCS 2007, pages 249-259. IEEE Computer Society Press, Oct. 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"R.\n      Canetti\n     and \n      T.\n      Rabin\n  . \n  Universal composition with joint state\n  . In D. Boneh editor CRYPTO \n  2003 volume \n  2729\n   of \n  LNCS pages \n  265\n  -\n  281\n  . \n  Springer Aug. 2003.  R. Canetti and T. Rabin. Universal composition with joint state. In D. Boneh editor CRYPTO 2003 volume 2729 of LNCS pages 265-281. Springer Aug. 2003.","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"C.\n      Cr\u00e9peau J.\n      van de Graaf and \n      A.\n      Tapp\n  . \n  Committed oblivious transfer and private multiparty computation\n  . In D. Coppersmith editor CRYPTO'95 volume \n  963\n   of \n  LNCS pages \n  110\n  -\n  123\n  . \n  Springer Aug. \n  1995\n  .   C. Cr\u00e9peau J. van de Graaf and A. Tapp. Committed oblivious transfer and private multiparty computation. In D. Coppersmith editor CRYPTO'95 volume 963 of LNCS pages 110-123. Springer Aug. 1995.","DOI":"10.1007\/3-540-44750-4_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"S.\n      Garg V.\n      Goyal A.\n      Jain and \n      A.\n      Sahai\n  . \n  Bringing people of different beliefs together to do UC\n  . In Y. Ishai editor TCC \n  2011 volume \n  6597\n   of \n  LNCS pages \n  311\n  -\n  328\n  . \n  Springer Mar. 2011.   S. Garg V. Goyal A. Jain and A. Sahai. Bringing people of different beliefs together to do UC. In Y. Ishai editor TCC 2011 volume 6597 of LNCS pages 311-328. Springer Mar. 2011.","DOI":"10.1007\/978-3-642-19571-6_19"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"V.\n      Goyal\n     and \n      J.\n      Katz\n  . \n  Universally composable multi-party computation with an unreliable common reference string\n  . In R. Canetti editor TCC \n  2008 volume \n  4948\n   of \n  LNCS pages \n  142\n  -\n  154\n  . \n  Springer Mar. 2008.   V. Goyal and J. Katz. Universally composable multi-party computation with an unreliable common reference string. In R. Canetti editor TCC 2008 volume 4948 of LNCS pages 142-154. Springer Mar. 2008.","DOI":"10.1007\/978-3-540-78524-8_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"J.\n      Groth\n     and \n      R.\n      Ostrovsky\n  . \n  Cryptography in the multi-string model\n  . In A. Menezes editor CRYPTO \n  2007 volume \n  4622\n   of \n  LNCS pages \n  323\n  -\n  341\n  . \n  Springer Aug. 2007.   J. Groth and R. Ostrovsky. Cryptography in the multi-string model. In A. Menezes editor CRYPTO 2007 volume 4622 of LNCS pages 323-341. Springer Aug. 2007.","DOI":"10.1007\/978-3-540-74143-5_18"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"D.\n      Harnik J.\n      Kilian M.\n      Naor O.\n      Reingold and \n      A.\n      Rosen\n  . \n  On robust combiners for oblivious transfer and other primitives\n  . In R. Cramer editor EUROCRYPT \n  2005 volume \n  3494\n   of \n  LNCS pages \n  96\n  -\n  113\n  . \n  Springer May 2005.   D. Harnik J. Kilian M. Naor O. Reingold and A. Rosen. On robust combiners for oblivious transfer and other primitives. In R. Cramer editor EUROCRYPT 2005 volume 3494 of LNCS pages 96-113. Springer May 2005.","DOI":"10.1007\/11426639_6"},{"key":"e_1_3_2_1_17_1","first-page":"25","volume-title":"16th ACM PODC","author":"Hirt M.","year":"1997","unstructured":"M. Hirt and U. M. Maurer . Complete characterization of adversaries tolerable in secure multiparty computation (extended abstract) . In 16th ACM PODC , pages 25 - 34 . ACM Press , Aug. 1997 . M. Hirt and U. M. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation (extended abstract). In 16th ACM PODC, pages 25-34. ACM Press, Aug. 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"D.\n      Hofheinz\n     and \n      J.\n      M\u00fcller-Quade\n  . \n  Universally composable commitments using random oracles\n  . In M. Naor editor TCC \n  2004 volume \n  2951\n   of \n  LNCS pages \n  58\n  -\n  76\n  . \n  Springer Feb. 2004.  D. Hofheinz and J. M\u00fcller-Quade. Universally composable commitments using random oracles. In M. Naor editor TCC 2004 volume 2951 of LNCS pages 58-76. Springer Feb. 2004.","DOI":"10.1007\/978-3-540-24638-1_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Y.\n      Ishai M.\n      Prabhakaran and \n      A.\n      Sahai\n  . \n  Founding cryptography on oblivious transfer - efficiently\n  . In D. Wagner editor CRYPTO \n  2008 volume \n  5157\n   of \n  LNCS pages \n  572\n  -\n  591\n  . \n  Springer Aug. 2008.   Y. Ishai M. Prabhakaran and A. Sahai. Founding cryptography on oblivious transfer - efficiently. In D. Wagner editor CRYPTO 2008 volume 5157 of LNCS pages 572-591. Springer Aug. 2008.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"J.\n      Katz\n    .\n  Universally composable multiparty computation using tamper-proof hardware\n  . In M. Naor editor EUROCRYPT \n  2007 volume \n  4515\n   of \n  LNCS pages \n  115\n  -\n  128\n  . \n  Springer May 2007.   J. Katz. Universally composable multiparty computation using tamper-proof hardware. In M. Naor editor EUROCRYPT 2007 volume 4515 of LNCS pages 115-128. Springer May 2007.","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_22_1","first-page":"179","volume-title":"A unified framework for concurrent security: universal composability from stand-alone non-malleability","author":"Lin H.","year":"2009","unstructured":"H. Lin , R. Pass , and M. Venkitasubramaniam . A unified framework for concurrent security: universal composability from stand-alone non-malleability . In M. Mitzenmacher, editor, STOC 2009 , pages 179 - 188 . ACM Press , May \/ June 2009. H. Lin, R. Pass, and M. Venkitasubramaniam. A unified framework for concurrent security: universal composability from stand-alone non-malleability. In M. Mitzenmacher, editor, STOC 2009, pages 179-188. ACM Press, May \/ June 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"R.\n      Meier B.\n      Przydatek and \n      J.\n      Wullschleger\n  . \n  Robuster combiners for oblivious transfer\n  . In S. P. Vadhan editor TCC \n  2007 volume \n  4392\n   of \n  LNCS pages \n  404\n  -\n  418\n  . \n  Springer Feb. 2007.   R. Meier B. Przydatek and J. Wullschleger. Robuster combiners for oblivious transfer. In S. P. Vadhan editor TCC 2007 volume 4392 of LNCS pages 404-418. Springer Feb. 2007.","DOI":"10.1007\/978-3-540-70936-7_22"}],"event":{"name":"PODC '14: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"PODC '14"},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611480","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:05Z","timestamp":1750229765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":22,"alternative-id":["10.1145\/2611462.2611480","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611480","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}