{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:38Z","timestamp":1776210698347,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540658894","type":"print"},{"value":"9783540489108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48910-x_29","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T13:57:35Z","timestamp":1192024655000},"page":"415-431","source":"Crossref","is-referenced-by-count":89,"title":["On the Concurrent Composition of Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Ransom","family":"Richardson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,15]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau. Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences, Vol. 37, 1988, pp. 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"C. Brassard","year":"1991","unstructured":"C. Brassard, C. Crepeau and M. Yung, \u201cConstant-Round Perfect Zero-Knowledge Computationally Convincing Protocols\u201d, Theoretical Computer Science, Vol. 84, 1991, pp. 23\u201352.","journal-title":"Theoretical Computer Science"},{"key":"29_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-38424-3_12","volume-title":"Proc. CRYPTO 90","author":"T. Beth","year":"1991","unstructured":"T. Beth and Y. Desmedt. Identification tokens \u2014 or: Solving the chess grandmaster problem. In A. J. Menezes and S. A. Vanstone, editors, Proc. CRYPTO 90, pages 169\u2013177. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 537."},{"key":"29_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Proc. CRYPTO 93","author":"Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, Torben P. Pedersen, and Birgit Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Douglas R. Stinson, editor, Proc. CRYPTO 93, pages 250\u2013265. Springer, 1994. Lecture Notes in Computer Science No. 773."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In ACM, editor, Proceedings of the twenty third annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, May 6\u20138, 1991, pages 542\u2013552, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1991. IEEE Computer Society Press.","DOI":"10.1145\/103418.103474"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork, Moni Naor, and Amit Sahai. Concurrent zero knowledge. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 409\u2013418, New York, May23\u201326 1998. ACM Press.","DOI":"10.1145\/276698.276853"},{"key":"29_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Concurrent zero-knowledge: Reducing the need for timing constraints","author":"C. Dwork","year":"1998","unstructured":"C. Dwork and A. Sahai. Concurrent zero-knowledge: Reducing the need for timing constraints. Lecture Notes in Computer Science, 1462, 1998."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive, zero-knowledge proofs based on a single random string. In Proc. 31st Ann. IEEE Symp. on Foundations of Computer Science, pages 308\u2013317, 1990.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir, \u201cZero Knowledge Proofs of Knowledge in Two Rounds\u201d, Advances in Cryptology \u2014 Crypto 89 proceedings, pp. 526\u2013544, 1990.","DOI":"10.1007\/0-387-34805-0_46"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. on Computing, Vol. 25, No.1, pp. 169\u2013192, 1996","journal-title":"SIAM J. on Computing"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. The Knowledge Complexity of Interactive Proofs. Proc. 17th STOC, 1985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Computing, Vol. 17, 2(1988), pp. 281\u2013308.","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"29_CR13","first-page":"691","volume":"38","author":"S. Goldwasser","year":"1991","unstructured":"S. Goldwasser, S. Micali, A. Wigderson. Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs. J. of the ACM, Vol. 38, No. 3, July 1991, pp. 691\u2013729.","journal-title":"J. of the ACM"},{"key":"29_CR14","series-title":"Technical Report TR-91-068","volume-title":"Construction of a pseudo-random generator from any one-way function","author":"J. Hastad","year":"1991","unstructured":"Johan Hastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Construction of a pseudo-random generator from any one-way function. Technical Report TR-91-068, International Computer Science Institute, Berkeley, CA, December 1991."},{"key":"29_CR15","unstructured":"Kilian, Petrank, and Rackoff. Lower bounds for zero knowledge on the internet. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1998."},{"key":"29_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 96","author":"P. C. Kocher","year":"1996","unstructured":"Paul C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Neal Koblitz, editor, Advances in Cryptology\u2014CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 104\u2013113. Springer-Verlag, 18\u201322 August 1996."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Moni Naor. Bit commitment using pseudo-randomness. In Advances in Cryptology: CRYPTO\u2019 89, pages 128\u2013137, Berlin, August 1990. Springer.","DOI":"10.1007\/0-387-34805-0_13"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Y. Oren. On the cunning powers of cheating verifiers: Some observations about zero knowledge proofs. In Ashok K. Chandra, editor, Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 462\u2013471, Los Angeles, CA, October 1987. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1987.43"},{"key":"29_CR19","unstructured":"R. Ostrovsky and G. Di Crescenzo. Personal Communication, September 15, 1998."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll. Random self-reducibility and zero-knowledge interactive proofs of possession of information. In Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science, pages 472\u2013482, 1987.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48910-X_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:58:53Z","timestamp":1556906333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48910-X_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658894","9783540489108"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48910-x_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}