{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:44:53Z","timestamp":1761979493788,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642420320"},{"type":"electronic","value":"9783642420337"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42033-7_2","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:07:02Z","timestamp":1385194022000},"page":"21-40","source":"Crossref","is-referenced-by-count":4,"title":["Constant-Round Concurrent Zero Knowledge in the Bounded Player Model"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Silas","family":"Richelson","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194\u2013203 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: STOC, pp. 484\u2013493 (2002)","DOI":"10.1145\/509978.509979"},{"key":"2_CR4","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires $\\stackrel{\\sim}{\\Omega}(\\log n)$ rounds. In: STOC, pp. 570\u2013579 (2001)","DOI":"10.1145\/380752.380852"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-28914-9_30","volume-title":"Theory of Cryptography","author":"C. Cho","year":"2012","unstructured":"Cho, C., Ostrovsky, R., Scafuro, A., Visconti, I.: Simultaneously resettable arguments of knowledge. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 530\u2013547. Springer, Heidelberg (2012)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from p-certificates. In: FOCS. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-72540-4_9","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., Lin, D.: Instance-dependent verifiable random functions and their application to simultaneous resettability. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 148\u2013168. Springer, Heidelberg (2007)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-79499-8_11","volume-title":"Information Security and Cryptology","author":"Y. Deng","year":"2008","unstructured":"Deng, Y., Lin, D.: Resettable zero knowledge with concurrent soundness in the bare public-key model under standard assumption. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Inscrypt 2007. LNCS, vol.\u00a04990, pp. 123\u2013137. Springer, Heidelberg (2008)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"G. Crescenzo Di","year":"2004","unstructured":"Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 237\u2013253. Springer, Heidelberg (2004)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-30539-2_37","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"G. Crescenzo Di","year":"2004","unstructured":"Di Crescenzo, G., Persiano, G., Visconti, I.: Improved setup assumptions for 3-round resettable zero knowledge. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 530\u2013544. Springer, Heidelberg (2004)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/11523468_66","volume-title":"Automata, Languages and Programming","author":"G. Crescenzo Di","year":"2005","unstructured":"Di Crescenzo, G., Visconti, I.: Concurrent zero knowledge in the public-key model. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 816\u2013827. Springer, Heidelberg (2005)"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"2_CR16","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: FOCS, pp. 308\u2013317 (1990)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-36594-2_4","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2013","unstructured":"Goyal, V., Jain, A., Ostrovsky, R., Richelson, S., Visconti, I.: Concurrent zero knowledge in the bounded player model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 60\u201379. Springer, Heidelberg (2013)"},{"key":"2_CR19","unstructured":"Gupta, D., Sahai, A.: On constant-round concurrent zero-knowledge from a knowledge assumption. IACR Cryptology ePrint Archive 2012, 572 (2012)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the internet. In: FOCS, pp. 484\u2013492 (1998)","DOI":"10.1109\/SFCS.1998.743499"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-44647-8_32","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Soundness in the public-key model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 542\u2013565. Springer, Heidelberg (2001)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-44647-8_32","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Soundness in the public-key model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 542\u2013565. Springer, Heidelberg (2001)"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-70583-3_45","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2008","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Constant-round concurrent non-malleable zero knowledge in the bare public-key model. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 548\u2013559. Springer, Heidelberg (2008)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Pass, R.: Limits of provable security from standard assumptions. In: STOC, pp. 109\u2013118 (2011)","DOI":"10.1145\/1993636.1993652"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 451\u2013468. Springer, Heidelberg (2000)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-29011-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Scafuro","year":"2012","unstructured":"Scafuro, A., Visconti, I.: On round-optimal zero knowledge in the bare public-key model. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 153\u2013171. Springer, Heidelberg (2012)"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11787006_3","volume-title":"Automata, Languages and Programming","author":"I. Visconti","year":"2006","unstructured":"Visconti, I.: Efficient zero knowledge on the internet. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 22\u201333. Springer, Heidelberg (2006)"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-642-14165-2_59","volume-title":"Automata, Languages and Programming","author":"A.C. Yao","year":"2010","unstructured":"Yao, A.C., Yung, M., Zhao, Y.: Concurrent knowledge extraction in the public-key model. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 702\u2013714. Springer, Heidelberg (2010)"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-25385-0_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y. Deng","year":"2011","unstructured":"Deng, Y., Feng, D., Goyal, V., Lin, D., Sahai, A., Yung, M.: Resettable cryptography in constant rounds \u2013 the case of zero knowledge. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 390\u2013406. Springer, Heidelberg (2011)"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-72540-4_8","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"M. Yung","year":"2007","unstructured":"Yung, M., Zhao, Y.: Generic and practical resettable zero-knowledge in the bare public-key model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 129\u2013147. Springer, Heidelberg (2007)"},{"key":"2_CR39","unstructured":"Zhao, Y.: Concurrent\/resettable zero-knowledge with concurrent soundness in the bare public-key model and its applications. Cryptology ePrint Archive, Report 2003\/265 (2003), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42033-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:54:37Z","timestamp":1746053677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42033-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420320","9783642420337"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42033-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}