{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:06:12Z","timestamp":1746331572954,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662443804"},{"type":"electronic","value":"9783662443811"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44381-1_19","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T04:27:09Z","timestamp":1405312029000},"page":"337-350","source":"Crossref","is-referenced-by-count":1,"title":["Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_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"},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B. Barak","year":"2008","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput.\u00a038(5), 1661\u20131694 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput.\u00a032(1), 1\u201347 (2002)","journal-title":"SIAM J. Comput."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-36594-2_5","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2013","unstructured":"Canetti, R., Lin, H., Paneth, O.: Public-coin concurrent zero-knowledge in the global hash model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 80\u201399. Springer, Heidelberg (2013)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509978.509980"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from p-certificates. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Deng, Y., Goyal, V., Sahai, A.: 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"},{"key":"19_CR8","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"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Non-black-box simulation in the fully concurrent setting. In: STOC, pp. 221\u2013230 (2013)","DOI":"10.1145\/2488608.2488637"},{"key":"19_CR11","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":"19_CR12","unstructured":"Gupta, D., Sahai, A.: On constant-round concurrent zero-knowledge from a knowledge assumption. IACR Cryptology ePrint Archive 2012, 572 (2012)"},{"key":"19_CR13","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":"19_CR14","unstructured":"Pandey, O., Prabhakaran, M., Sahai, A.: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for np. IACR Cryptology ePrint Archive 2013, 754 (2013)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-011-9110-5","volume":"26","author":"R. Pass","year":"2013","unstructured":"Pass, R., Rosen, A., Tseng, W.L.D.: Public-coin parallel zero-knowledge for np. J. Cryptology\u00a026(1), 1\u201310 (2013)","journal-title":"J. Cryptology"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11523468_19","volume-title":"Automata, Languages and Programming","author":"G. Persiano","year":"2005","unstructured":"Persiano, G., Visconti, I.: Single-prover concurrent zero knowledge in almost constant rounds. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 228\u2013240. Springer, Heidelberg (2005)"},{"key":"19_CR17","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":"19_CR18","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":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-17373-8_21","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A. Rosen","year":"2010","unstructured":"Rosen, A., Shelat, A.: Optimistic concurrent zero knowledge. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 359\u2013376. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:47:25Z","timestamp":1746301645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}