{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:46Z","timestamp":1750306966711,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488637","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"221-230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Non-black-box simulation in the fully concurrent setting"],"prefix":"10.1145","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"volume-title":"CRYPTO","year":"2012","author":"Agrawal S.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875552"},{"key":"e_1_3_2_1_3_1","unstructured":"B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. 2002.  B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/872747.873184"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875549"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.21"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.43"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"M.\n       \n      Ben-Or O.\n       \n      Goldreich S.\n       \n      Goldwasser J.\n       \n      H\u00e5stad J.\n       \n      Kilian S.\n       \n      Micali and \n      \n      \n      P.\n       \n      Rogaway\n      \n  \n  . \n  Everything provable is provable in zero-knowledge. In S. Goldwasser editor CRYPTO volume \n  403\n   of \n  Lecture Notes in Computer Science pages \n  37\n  --\n  56\n  . \n  Springer 1988\n  .   M. Ben-Or O. Goldreich S. Goldwasser J. H\u00e5stad J. Kilian S. Micali and P. Rogaway. Everything provable is provable in zero-knowledge. In S. Goldwasser editor CRYPTO volume 403 of Lecture Notes in Computer Science pages 37--56. Springer 1988.","DOI":"10.1007\/0-387-34799-2_4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.40"},{"volume-title":"Proceedings of the International Congress of Mathematicians","year":"1986","author":"Blum M.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380852"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.21"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.59"},{"key":"e_1_3_2_1_16_1","first-page":"186","volume-title":"CRYPTO","author":"Fiat A.","year":"1986"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_4"},{"volume-title":"Eurocrypt","year":"2012","author":"Garg S.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_25"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"S.\n       \n      Garg V.\n       \n      Rao A.\n       \n      Sahai D.\n       \n      Schr\u00f6der and \n      \n      \n      D.\n       \n      Unruh\n      \n  \n  . \n  Round optimal blind signatures. In P. Rogaway editor CRYPTO volume \n  6841\n   of \n  Lecture Notes in Computer Science pages \n  630\n  --\n  648\n  . \n  Springer 2011\n  .   S. Garg V. Rao A. Sahai D. Schr\u00f6der and D. Unruh. Round optimal blind signatures. In P. Rogaway editor CRYPTO volume 6841 of Lecture Notes in Computer Science pages 630--648. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.13"},{"volume-title":"preparation","year":"2013","author":"Goyal V.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806717"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"V.\n       \n      Goyal A.\n       \n      Jain and \n      \n      \n      R.\n       \n      Ostrovsky\n      \n  \n  . \n  Password-authenticated session-key generation on the internet in the plain model. In T. Rabin editor CRYPTO volume \n  6223\n   of \n  Lecture Notes in Computer Science pages \n  277\n  --\n  294\n  . \n  Springer 2010\n  .   V. Goyal A. Jain and R. Ostrovsky. Password-authenticated session-key generation on the internet in the plain model. In T. Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 277--294. Springer 2010.","DOI":"10.1007\/978-3-642-14623-7_15"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.74"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_3"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"C.\n       \n      Hazay J.\n       \n      Katz C.-Y.\n       \n      Koo and \n      \n      \n      Y.\n       \n      Lindell\n      \n  \n  . \n  Concurrently-secure blind signatures without random oracles or setup assumptions. In S. P. Vadhan editor TCC volume \n  4392\n   of \n  Lecture Notes in Computer Science pages \n  323\n  --\n  341\n  . \n  Springer 2007\n  .   C. Hazay J. Katz C.-Y. Koo and Y. Lindell. Concurrently-secure blind signatures without random oracles or setup assumptions. In S. P. Vadhan editor TCC volume 4392 of Lecture Notes in Computer Science pages 323--341. Springer 2007.","DOI":"10.1007\/978-3-540-70936-7_18"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380851"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780641"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9015-5"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007393"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"R. Pass and A. Rosen. Bounded-concurrent secure two-party computation in a constant number of rounds. 2003.  R. Pass and A. Rosen. Bounded-concurrent secure two-party computation in a constant number of rounds. 2003.","DOI":"10.1145\/1007352.1007393"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.27"},{"volume-title":"Journal of Cryptology","year":"2011","author":"Pass R.","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811465"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250853"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652156"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756164"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Palo Alto California USA","acronym":"STOC'13"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488637","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":41,"alternative-id":["10.1145\/2488608.2488637","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488637","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}