{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:22Z","timestamp":1725484522902},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429876"},{"type":"electronic","value":"9783540456827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_25","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:31:48Z","timestamp":1180146708000},"page":"422-441","source":"Crossref","is-referenced-by-count":3,"title":["Responsive Round Complexity and Concurrent Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Tzafrir","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Boaz Barak: How to Go Beyond The Black-Box Simulation Barrier. To appear in IEEE, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, October, 2001.","DOI":"10.1109\/SFCS.2001.959885"},{"key":"25_CR2","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. JCSS 37 (1988) 156\u2013189","journal-title":"JCSS"},{"key":"25_CR3","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. Record 99-22, Theory of Cryptography Library (1999) received October 25th, 1999. Supercedes Theory of Cryptography Library Record 99-15."},{"key":"25_CR4","first-page":"235","volume-title":"Resettable zero-knowledge (extended abstract)","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In ACM, ed.: Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21\u201323, [2000], New York, NY, USA, ACM Press (2000) 235\u2013244 see also [3]."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Concurrent zero-knowledge requires \u03a9(log n) rounds. In: Proceedings of the thirty third annual ACM Symposium on Theory of Computing, ACM Press (2001)","DOI":"10.1145\/380752.380852"},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/3-540-48405-1_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"G.D. Crescenzo","year":"1999","unstructured":"Crescenzo, G.D., Ostrovsky, R.: On concurrent zero-knowledge with preprocessing. In Wiener, M., ed.: Advances in Cryptology \u2014 CRYPTO\u2019 99. Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany (1999) 485\u2013502"},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In Preneel, B., ed.: Advances in Cryptology \u2014 EUROCRYPT\u2019 2000. Lecture Notes in Computer Science, Brugge, Belgium, Springer-Verlag, Berlin Germany (2000) 418\u2013430"},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Proc. CRYPTO 93","author":"Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Stinson, D.R., ed.: Proc. CRYPTO 93, Springer (1994) 250\u2013265 Lecture Notes in Computer Science No. 773."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In IEEE, ed.: Proceedings of the 41st Annual Symposium on Foundations of Computer Science: proceedings: 12\u201314 November, 2000, Redondo Beach, California, IEEE Computer Society Press (2000) 283\u2013293","DOI":"10.1109\/SFCS.2000.892117"},{"key":"25_CR10","first-page":"409","volume-title":"Concurrent zero-knowledge","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In ACM, ed.: Proceedings of the thirtieth annual ACM Symposium on Theory of Computing: Dallas, Texas, May 23\u201326, 1998, New York, NY, USA, ACM Press (1998) 409\u2013418"},{"key":"25_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BFb0055746","volume-title":"Concurrent zero-knowledge: Reducing the need for timing constraints","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrent zero-knowledge: Reducing the need for timing constraints. Lecture Notes in Computer Science 1462 (1998) 442\u2013457"},{"key":"25_CR12","unstructured":"Feige, U.: Alternative models for zero knowledge interactive proofs. PhD thesis, Weizmann Institute of science (1990)"},{"key":"25_CR13","first-page":"416","volume-title":"Witness indistinguishable and witness hiding protocols","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In ACM, ed.: Proceedings of the twenty-second annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 14\u201316, 1990, New York, NY, USA, ACM Press (1990) 416\u2013426"},{"key":"25_CR14","doi-asserted-by":"crossref","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: the journal of the International Association for Cryptologic Research 9 (1996) 167\u2013189","journal-title":"Journal of Cryptology: the journal of the International Association for Cryptologic Research"},{"key":"25_CR15","doi-asserted-by":"crossref","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. SICOMP 25 (1996) 169\u2013192","journal-title":"SICOMP"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Racko., C.: The knowledge complexity of interactive systems. SIAM Journal of Computing 18 (1989) 186\u2013208","journal-title":"SIAM Journal of Computing"},{"key":"25_CR17","unstructured":"Goldwasser, S., Micali, S., Racko., C.: The knowledge complexity of interactive proof-systems. In: ACM Symposium on Theory of Computing (STOC\u2019 85), Baltimore, USA, ACM Press (1985) 291\u2013304"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent zero-knowledge in poly-logarithmic rounds. In: Proceedings of the thirty third annual ACM Symposium on Theory of Computing, ACM Press (2001)","DOI":"10.1145\/380752.380851"},{"key":"25_CR19","first-page":"484","volume-title":"Lower bounds for zero knowledge on the Internet","author":"J. Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E., Racko., C.: Lower bounds for zero knowledge on the Internet. In IEEE, ed.: 39th Annual Symposium on Foundations of Computer Science: proceedings: November 8\u201311, 1998, Palo Alto, California, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, IEEE Computer Society Press (1998) 484\u2013492"},{"key":"25_CR20","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. Journal of Cryptology 4 (1991) 151\u2013158","journal-title":"Journal of Cryptology"},{"key":"25_CR21","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21th Annual Symposium on Theory of Computing (STOC), ACM Press (1988) 33\u201343"},{"key":"25_CR22","unstructured":"Goldreich, O.: Foundation of cryptography \u2014 fragments of a book. Available from the Electronic Colloquium on Computational Complexity (ECCC) http:\/\/www.eccc.uni-trier.de\/eccc\/ , February 1995. (1995)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Oren, Y.: On the cunning powers of cheating verifiers: Some observations about zero knowledge proofs. In Chandra, A.K., ed.: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, IEEE Computer Society Press (1987) 462\u2013471","DOI":"10.1109\/SFCS.1987.43"},{"key":"25_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"On the concurrent composition of zero-knowledge proofs","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. Lecture Notes in Computer Science 1592 (1999) 415\u201343"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: CRYPTO: Proceedings of Crypto. (2000)","DOI":"10.1007\/3-540-44598-6_28"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:48:07Z","timestamp":1556434087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}