{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:43:27Z","timestamp":1758271407941,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594093"},{"type":"electronic","value":"9783540492641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-49264-x_30","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T06:52:09Z","timestamp":1186469529000},"page":"367-381","source":"Crossref","is-referenced-by-count":2,"title":["Recycling Random Bits in Composed Perfect Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proof Systems, Proceedings of the 31th Annual IEEE Symposium on Foundation of Computer Science, 1990, pp. 563\u2013572.","DOI":"10.1109\/FSCS.1990.89577"},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 88","author":"M. Ben-Or","year":"1990","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 37\u201356."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, n. 4, pp. 185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084\u20131118.","journal-title":"SIAM Journal of Computing"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, Proceedings of International Colloquium of Algorithms, Languages and Programming (ICALP) 1994.","DOI":"10.1007\/3-540-58201-0_99"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R. Boppana, J. Hastad, and S. Zachos, Does co-N P has Short Interactive Proofs ?, Inf. Proc. Lett., vol. 25, May 1987, pp. 127\u2013132.","journal-title":"Inf. Proc. Lett."},{"issue":"1","key":"30_CR8","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, Perfect Zero-Knowledge Computationally Convincing Proofs for NP in Constant Rounds, Theoretical Computer Science, vol. 84, n. 1 (1991) pp. 23\u201352.","journal-title":"Theoretical Computer Science"},{"key":"30_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology \u2014 CRYPTO 93","author":"I. Damgaard","year":"1994","unstructured":"I. Damgaard, T. Pedersen, and B. Pfitzmann, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, in \u201cAdvances in Cryptology \u2014 CRYPTO 93\u201d, vol. 773 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 250\u2013265."},{"key":"30_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-48329-2_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 93","author":"A. Santis De","year":"1994","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, in \u201cAdvances in Cryptology \u2014 CRYPTO 93\u201d, vol. 773 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 73\u201384."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(94)90237-2","volume":"132","author":"A. Santis De","year":"1994","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, in Theoretical Computer Science, Vol. 132 pp. 291\u2013317 (1994).","journal-title":"Theoretical Computer Science"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, Proceedings of the 35th Annual IEEE Symposium on Foundation on Computer Science, November 1994.","DOI":"10.1109\/SFCS.1994.365745"},{"key":"30_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"Y. Desmedt","year":"1988","unstructured":"Y. Desmedt, C. Goutier, and S. Bengio, Special Uses and Abuses of the Fiat-Shamir Passport Protocol, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-38424-3_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 90","author":"A. Santis De","year":"1991","unstructured":"A. De Santis and M. Yung, Cryptographic Applications of the Non-Interactive Metaproof and Many-Prover Systems, in \u201cAdvances in Cryptology \u2014 CRYPTO 90\u201d, vol. 537 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp 366\u2013377."},{"key":"30_CR15","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 Proceedings of 22nd Annual Symposium on the Theory of Computing, 1990, pp. 308\u2013317.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"30_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/0-387-34799-2_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 88","author":"O. Goldreich","year":"1990","unstructured":"O. Goldreich and E. Kushilevitz, A Perfect Zero Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, Ed. S. Goldwasser, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 57\u201370."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.","DOI":"10.1137\/0218012"},{"key":"30_CR20","doi-asserted-by":"publisher","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, Journal of Cryptology, vol. 7, 1994, pp. 1\u201332.","journal-title":"Journal of Cryptology"},{"key":"30_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"R. Impagliazzo","year":"1988","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag pp. 40\u201351."},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"J. Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, May 1992.","DOI":"10.1145\/129712.129782"},{"key":"30_CR23","series-title":"Lect Notes Comput Sci","first-page":"40","volume-title":"Advances in Cryptology \u2014 CRYPTO 94","author":"E. Kushilevitz","year":"1988","unstructured":"E. Kushilevitz and A. Rosen, A Randomness-Rounds Tradeoff in Private Computations \u201cAdvances in Cryptology \u2014 CRYPTO 94\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag pp. 40\u201351."},{"key":"30_CR24","unstructured":"I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York."},{"key":"30_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_43","volume-title":"Advances in Cryptology \u2014 CRYPTO 89","author":"T. Okamoto","year":"1990","unstructured":"T. Okamoto and K. Ohta, Disposable Zero-Knowledge Authentications and their Applications to Untraceable Electronic Cash \u201cAdvances in Cryptology \u2014 CRYPTO 89\u201d, vol. 435 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"30_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-38424-3_33","volume-title":"Advances in Cryptology \u2014 CRYPTO 90","author":"T. Okamoto","year":"1991","unstructured":"T. Okamoto and K. Ohta, How to Utilize the Randomness of Zero-Knowledge Proof Systems \u201cAdvances in Cryptology \u2014 CRYPTO 90\u201d, vol. 537 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, Proc. 28th Symposium on Foundations of Computer Science, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49264-X_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:07:27Z","timestamp":1737349647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49264-X_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594093","9783540492641"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-49264-x_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]}}}