{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T15:19:26Z","timestamp":1721229566813},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00145-018-09309-5","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T18:11:10Z","timestamp":1549476670000},"page":"393-434","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-black-box Simulation in the Fully Concurrent Setting, Revisited"],"prefix":"10.1007","volume":"32","author":[{"given":"Susumu","family":"Kiyoshima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"issue":"1","key":"9309_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"S. Arora, S. Safra, Probabilistic checking of proofs: a new characterization of np. J. ACM, 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"9309_CR2","doi-asserted-by":"crossref","unstructured":"B. Barak, How to go beyond the black-box simulation barrier, in FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"issue":"2","key":"9309_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\n                           37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9309_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, On defining proofs of knowledge, in CRYPTO, pp. 390\u2013420 (1992)","DOI":"10.1007\/3-540-48071-4_28"},{"issue":"5","key":"9309_CR5","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B Barak","year":"2009","unstructured":"B. Barak, O. Goldreich, Universal arguments and their applications. SIAM J. Comput.\n                           38(5), 1661\u20131694 (2009)","journal-title":"SIAM J. Comput."},{"key":"9309_CR6","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, S. Goldwasser, Y. Lindell, Resettably-sound zero-knowledge and its applications, in FOCS, pp. 116\u2013125 (2001)","DOI":"10.1109\/SFCS.2001.959886"},{"key":"9309_CR7","unstructured":"M. Blum, How to prove a theorem so no one else can claim it, in The International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"9309_CR8","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, From the impossibility of obfuscation to a new non-black-box simulation technique, in FOCS, pp. 223\u2013232 (2012)","DOI":"10.1109\/FOCS.2012.40"},{"key":"9309_CR9","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, On the impossibility of approximate obfuscation and applications to resettable cryptography, in STOC, pp. 241\u2013250 (2013)","DOI":"10.1145\/2488608.2488639"},{"issue":"5","key":"9309_CR10","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1137\/130928236","volume":"44","author":"N Bitansky","year":"2015","unstructured":"N. Bitansky, O. Paneth, On non-black-box simulation and the impossibility of approximate obfuscation. SIAM J. Comput\n                           44(5), 1325\u20131383 (2015)","journal-title":"SIAM J. Comput"},{"key":"9309_CR11","doi-asserted-by":"crossref","unstructured":"M. Bellare, B.S. Yee, Forward-security in private-key cryptography, in CT-RSA, pp. 1\u201318 (2003)","DOI":"10.1007\/3-540-36563-X_1"},{"key":"9309_CR12","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, S. Micali, Resettable zero-knowledge, in STOC, pp. 235\u2013244 (2000)"},{"issue":"1","key":"9309_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R Canetti","year":"2002","unstructured":"R. Canetti, J. Kilian, E. Petrank, A. Rosen, Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput.\n                           32(1), 1\u201347 (2002)","journal-title":"SIAM J. Comput."},{"key":"9309_CR14","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Lin, O. Paneth, Public-coin concurrent zero-knowledge in the global hash model, in TCC, pp. 80\u201399 (2013)","DOI":"10.1007\/978-3-642-36594-2_5"},{"key":"9309_CR15","doi-asserted-by":"crossref","unstructured":"K.-M. Chung, H. Lin, R. Pass, Constant-round concurrent zero knowledge from P-certificates, in FOCS, pp. 50\u201359 (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"9309_CR16","doi-asserted-by":"crossref","unstructured":"K.-M. Chung, H. Lin, R. Pass, Constant-round concurrent zero-knowledge from indistinguishability obfuscation, in CRYPTO, pp. 287\u2013307 (2015)","DOI":"10.1007\/978-3-662-47989-6_14"},{"key":"9309_CR17","doi-asserted-by":"crossref","unstructured":"Y. Deng, V. Goyal, A. Sahai, Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy, in FOCS, pp. 251\u2013260 (2009)","DOI":"10.1109\/FOCS.2009.59"},{"issue":"6","key":"9309_CR18","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C Dwork","year":"2004","unstructured":"C. Dwork, M. Naor, A. Sahai, Concurrent zero-knowledge. J. ACM\n                           51(6), 851\u2013898 (2004)","journal-title":"J. ACM"},{"key":"9309_CR19","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Shamir, Witness indistinguishable and witness hiding protocols, in STOC, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"9309_CR20","doi-asserted-by":"crossref","unstructured":"V. Goyal, D. Gupta, A. Sahai, Concurrent secure computation via non-black box simulation, in CRYPTO, pp. 23\u201342 (2015)","DOI":"10.1007\/978-3-662-48000-7_2"},{"issue":"1","key":"9309_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput.\n                           25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9309_CR22","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput.\n                           18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9309_CR23","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM\n                           38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"9309_CR24","doi-asserted-by":"crossref","unstructured":"V. Goyal, Non-black-box simulation in the fully concurrent setting, in STOC, pp. 221\u2013230 (2013)","DOI":"10.1145\/2488608.2488637"},{"issue":"4","key":"9309_CR25","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J Htad","year":"1999","unstructured":"J. Htad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput.\n                           28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9309_CR26","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank, Concurrent and resettable zero-knowledge in poly-loalgorithm rounds, in STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"issue":"4","key":"9309_CR27","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"S. Micali, Computationally sound proofs. SIAM J. Comput.\n                           30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9309_CR28","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptol.\n                           4(2), 151\u2013158 1991.","journal-title":"J. Cryptol."},{"key":"9309_CR29","doi-asserted-by":"crossref","unstructured":"O. Pandey, M. Prabhakaran, A. Sahai, Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP, in TCC, pp. 638\u2013667 (2015)","DOI":"10.1007\/978-3-662-46497-7_25"},{"key":"9309_CR30","doi-asserted-by":"crossref","unstructured":"R. Pass, A. Rosen, New and improved constructions of non-malleable cryptographic protocols, in STOC, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"9309_CR31","unstructured":"M. Prabhakaran, A. Rosen, A. Sahai, Concurrent zero knowledge with logarithmic round-complexity, in FOCS, pp. 366\u2013375 (2002)"},{"issue":"1","key":"9309_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-011-9110-5","volume":"26","author":"R Pass","year":"2013","unstructured":"R. Pass, A. Rosen, W.-L.\u00a0D. Tseng, Public-coin parallel zero-knowledge for NP. J. Cryptol.\n                           26(1), 1\u201310 (2013)","journal-title":"J. Cryptol."},{"key":"9309_CR33","doi-asserted-by":"crossref","unstructured":"R. Pass, W.-L.D. Tseng, D. Wikstrm, On the composition of public-coin zero-knowledge protocols, in CRYPTO, pp. 160\u2013176 (2009)","DOI":"10.1007\/978-3-642-03356-8_10"},{"key":"9309_CR34","doi-asserted-by":"crossref","unstructured":"R. Richardson, J. Kilian, On the concurrent composition of zero-knowledge proofs, in EUROCRYPT, pp. 415\u2013431 (1999)","DOI":"10.1007\/3-540-48910-X_29"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-09309-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-09309-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-09309-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:12:42Z","timestamp":1586333562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-09309-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9309"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-09309-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"30 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}