{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:55:56Z","timestamp":1778291756670,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642289132","type":"print"},{"value":"9783642289149","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28914-9_29","type":"book-chapter","created":{"date-parts":[[2012,3,5]],"date-time":"2012-03-05T21:12:39Z","timestamp":1330981959000},"page":"512-529","source":"Crossref","is-referenced-by-count":4,"title":["The Knowledge Tightness of Parallel Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Lung Dustin","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS 2001, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"29_CR2","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: Computational Complexity, pp. 162\u2013171 (2002)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: STOC 2002, pp. 484\u2013493 (2002)","DOI":"10.1145\/509978.509979"},{"key":"29_CR4","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proc. of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires $\\tilde\\omega(\\log n)$ rounds. In: STOC 2001, pp. 570\u2013579 (2001)","DOI":"10.1145\/380752.380852"},{"issue":"6","key":"29_CR7","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. J. ACM\u00a051(6), 851\u2013898 (2004)","journal-title":"J. ACM"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"29_CR12","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 Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","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\u00a038(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology\u00a07, 1\u201332 (1994)","journal-title":"Journal of Cryptology"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography \u2014 Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Concurrent zero-knowledge with timing, revisited. In: STOC 2002, pp. 332\u2013340 (2002)","DOI":"10.1145\/509907.509959"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. In: FOCS 2009, pp. 241\u2013250 (2009)","DOI":"10.1109\/FOCS.2009.50"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-00457-5_14","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Rosen, A., Shaltiel, R.: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 220\u2013237. Springer, Heidelberg (2009)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-78524-8_5","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2008","unstructured":"Katz, J.: Which Languages Have 4-Round Zero-Knowledge Proofs? In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 73\u201388. Springer, Heidelberg (2008)"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the internet. In: FOCS 1998, pp. 484\u2013492 (1998)","DOI":"10.1109\/SFCS.1998.743499"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: STOC 2006, pp. 306\u2013315 (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"29_CR22","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":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-11799-2_31","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2010","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 518\u2013534. Springer, Heidelberg (2010)"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-78524-8_30","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2008","unstructured":"Pass, R., Venkitasubramaniam, M.: On Constant-Round Concurrent Zero-Knowledge. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 553\u2013570. Springer, Heidelberg (2008)"},{"key":"29_CR25","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)"}],"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-28914-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T12:03:41Z","timestamp":1742645021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28914-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642289132","9783642289149"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28914-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}