{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:52:14Z","timestamp":1725483134599},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679073"},{"type":"electronic","value":"9783540445982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_28","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"451-468","source":"Crossref","is-referenced-by-count":24,"title":["A Note on the Round-Complexity of Concurrent Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Alon","family":"Rosen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols? In 38th FOCS, pages 374\u2013383, 1997.","DOI":"10.1109\/SFCS.1997.646126"},{"issue":"2","key":"28_CR2","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156\u2013189, 1988.","journal-title":"JCSS"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"G. Brassard","year":"1991","unstructured":"G. Brassard, C. Cr\u00e9peau and M. Yung. Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theoret. Comput. Sci., Vol. 84, pp. 23\u201352, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. In 32nd STOC, 2000.","DOI":"10.1145\/335305.335334"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"I. Damgard. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In EuroCrypt2000.","DOI":"10.1007\/3-540-45539-6_30"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409\u2013418, 1998.","DOI":"10.1145\/276698.276853"},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BFb0055746","volume-title":"Crypto98","author":"C. Dwork","year":"1998","unstructured":"C. Dwork, and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Crypto98, Springer LNCS 1462, pages 442\u2013457, 1998."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416\u2013426, 1990.","DOI":"10.1145\/100216.100272"},{"key":"28_CR9","unstructured":"O. Goldreich. Foundations of Cryptography-Fragments of a Book. Available from http:\/\/theory.lcs.mit.edu\/~oded\/frag.html ."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Jour. of Cryptology, Vol. 9, No. 2, pages 167\u2013189, 1996.","journal-title":"Jour. of Cryptology"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. Computing, Vol. 25, No. 1, pages 169\u2013192, 1996.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"28_CR12","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38, No. 1, pp. 691\u2013729, 1991.","journal-title":"JACM"},{"issue":"1","key":"28_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1\u201332, 1994.","journal-title":"Jour. of Cryptology"},{"issue":"1","key":"28_CR14","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., Vol. 18, No. 1, pp. 186\u2013208, 1989.","journal-title":"SIAM J. Comput."},{"key":"28_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/BFb0055744","volume-title":"Crypto98","author":"S. Hada","year":"1998","unstructured":"S. Hada and T. Tanaka. On the Existence of 3-Round Zero-Knowledge Protocols. In Crypto98, Springer LNCS 1462, pages 408\u2013423, 1998."},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. SIAM Jour. on Computing, Vol. 28(4), pages 1364\u20131396, 1999.","journal-title":"SIAM Jour. on Computing"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"J. Kilian and E. Petrank. Concurrent Zero-Knowledge in Poly-logarithmic Rounds. In Cryptology ePrint Archive: Report 2000\/013. Available from http:\/\/eprint.iacr.org\/2000\/013","DOI":"10.1145\/380752.380851"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In 39th FOCS, pages 484\u2013492, 1998.","DOI":"10.1109\/SFCS.1998.743499"},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor. Bit Commitment using Pseudorandomness. Jour. of Cryptology, Vol. 4, pages 151\u2013158, 1991.","journal-title":"Jour. of Cryptology"},{"key":"28_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"EuroCrypt99","author":"R. Richardson","year":"1999","unstructured":"R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt99, Springer LNCS 1592, pages 415\u2013431, 1999."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:25:51Z","timestamp":1683825951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}