{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:32:10Z","timestamp":1725460330908},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642365935"},{"type":"electronic","value":"9783642365942"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_5","type":"book-chapter","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T21:43:27Z","timestamp":1360187007000},"page":"80-99","source":"Crossref","is-referenced-by-count":19,"title":["Public-Coin Concurrent Zero-Knowledge in the Global Hash Model"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput. (2008)","DOI":"10.1137\/070709244"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E.: On the concrete-efficiency threshold of probabilistically-checkable proofs. In: Electronic Colloquium on Computational Complexity, ECCC (2012)","DOI":"10.1145\/2488608.2488681"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-28914-9_15","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2012","unstructured":"Bitansky, N., Canetti, R., Halevi, S.: Leakage-Tolerant Interactive Protocols. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 266\u2013284. Springer, Heidelberg (2012)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC (1988)","DOI":"10.1145\/62212.62222"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. IACR Cryptology ePrint Archive (2001)","DOI":"10.1007\/3-540-44647-8_2"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput. (2002)","DOI":"10.1145\/380752.380852"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Paneth, O.: Public-coins concurrent zero-knowledge in the global hash model. IACR Cryptology ePrint Archive (2013)","DOI":"10.1007\/978-3-642-36594-2_5"},{"key":"5_CR9","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":"5_CR10","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 (2009)","DOI":"10.1109\/FOCS.2009.59"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC (1998)","DOI":"10.1145\/276698.276853"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-22792-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Garg","year":"2011","unstructured":"Garg, S., Jain, A., Sahai, A.: Leakage-Resilient Zero Knowledge. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 297\u2013315. Springer, Heidelberg (2011)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology (1996)","DOI":"10.1007\/BF00208001"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. (1996)","DOI":"10.1137\/S0097539791220688"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in np have zero-knowledge proof systems. J. ACM (1991)","DOI":"10.1145\/116825.116852"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC (1985)","DOI":"10.1145\/22145.22178"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC (2001)","DOI":"10.1145\/380752.380851"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78967-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Sahai, A., Tseng, W.-L.D., Venkitasubramaniam, M.: Precise Concurrent Zero Knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 397\u2013414. Springer, Heidelberg (2008)"},{"key":"5_CR19","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS (2005)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A., Tseng, W.: Public-coin parallel zero-knowledge for np. Journal of Cryptology (2011)","DOI":"10.1007\/s00145-011-9110-5"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-03356-8_10","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"R. Pass","year":"2009","unstructured":"Pass, R., Tseng, W.-L.D., Wikstr\u00f6m, D.: On the Composition of Public-Coin Zero-Knowledge Protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 160\u2013176. Springer, Heidelberg (2009)"},{"key":"5_CR22","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)"},{"key":"5_CR23","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":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing Human Ignorance. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 211\u2013228. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36594-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:08:53Z","timestamp":1557529733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}