{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:42Z","timestamp":1725549522820},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_37","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"530-544","source":"Crossref","is-referenced-by-count":10,"title":["Improved Setup Assumptions for 3-Round Resettable Zero Knowledge"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","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 J. on Computing\u00a018, 186\u2013208 (1989)","journal-title":"SIAM J. on Computing"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/276698.276853","volume-title":"Proceedings of the 30th ACM Symposium on Theory of Computing (STOC 1998)","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 409\u2013418. ACM, New York (1998)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/335305.335334","volume-title":"Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000)","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 235\u2013244. ACM, New York (2000)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"37_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/380752.380851","volume-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC 2001)","author":"J. Kilian","year":"2001","unstructured":"Kilian, J., Petrank, E.: Concurrent and Resettable Zero-Knowledge in Poly-Logarithmic Rounds. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC 2001), pp. 560\u2013569. ACM, New York (2001)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower Bounds for Zero Knowledge on the Internet. In: Proceedings of the 39th Symposium on Foundations of Computer Science (FOCS 1998), pp. 484\u2013492 (1998)","DOI":"10.1109\/SFCS.1998.743499"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/380752.380852","volume-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC 2001)","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires \u03c9(logn) Rounds. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC 2001), pp. 570\u2013579. ACM, New York (2001)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BFb0055746","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 442\u2013457. Springer, Heidelberg (1998)"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1145\/509907.509959","volume-title":"Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 2002)","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O.: Concurrent Zero-Knowledge with Timing, Revisited. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 2002), pp. 332\u2013340. ACM, New York (2002)"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-Interactive Zero-Knowledge. SIAM J. on Computing\u00a020, 1084\u20131118 (1991)","journal-title":"SIAM J. on Computing"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I. Damgard","year":"2000","unstructured":"Damgard, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44968-X_42","volume-title":"Computing and Combinatorics","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G.: Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, p. 426. Springer, Heidelberg (2000)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/3-540-48405-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R.: On Concurrent Zero-Knowledge with Pre-processing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 485. Springer, Heidelberg (1999)"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-44647-8_32","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Soundness in the Public-Key Model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 542\u2013565. Springer, Heidelberg (2001)"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"G. Crescenzo Di","year":"2004","unstructured":"Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 237\u2013253. Springer, Heidelberg (2004)"},{"key":"37_CR16","unstructured":"Reyzin, L.: Zero-Knowledge with Public Keys, Ph.D. Thesis. MIT (2001)"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44987-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Min-Round Resettable Zero-Knowledge in the Public-key Model. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 373\u2013393. Springer, Heidelberg (2001)"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-39200-9_8","volume-title":"Advances in Cryptology \u2013 Eurocrypt 2003","author":"Y. Zhao","year":"2003","unstructured":"Zhao, Y., Deng, X., Lee, C., Zhu, H.: ResettableZero-Knowledge in the Weak Public-Key Model. In: EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 123\u2013139. Springer, Heidelberg (2003)"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-Way Functions are Necessary and Sufficient for Digital Signatures. In: Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC 1990), pp. 12\u201319 (1990)","DOI":"10.1145\/100216.100269"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","first-page":"160","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Pass","year":"2001","unstructured":"Pass, R.: Simulation in Quasi-Polynomial Time and Its Applications to Protocol Composition. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 160\u2013176. Springer, Heidelberg (2001)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: IEEE Symposium on Foundations of Computer Science, pp. 283\u2013293 (2000)","DOI":"10.1109\/SFCS.2000.892117"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-Sound Zero-Znowledge and its Applications. In: Proceeding of the 42nd Symposium on Foundations of Computer Science (FOCS 2001), pp. 116\u2013125 (2001)","DOI":"10.1109\/SFCS.2001.959886"},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple Non-Interactive Zero Knowledge Proofs Under General Assumptions. SIAM J. on Computing\u00a029, 1\u201328 (1999)","journal-title":"SIAM J. on Computing"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"De Santis, A., Persiano, G.: Zero-Knowledge Proofs of Knowledge Without Interaction. In: Proceedings of the 33rd Symposium on Foundations of Computer Science (FOCS 1992), pp. 427\u2013436 (1992)","DOI":"10.1109\/SFCS.1992.267809"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-38424-3_26","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D. Lapidot","year":"1991","unstructured":"Lapidot, D., Shamir, A.: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 353\u2013365. Springer, Heidelberg (1991)"},{"key":"37_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-28628-8_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Katz","year":"2004","unstructured":"Katz, J., Ostrovsky, R.: Round-Optimal Secure Two-Party Computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 335\u2013354. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:09:43Z","timestamp":1558912183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}