{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T02:29:47Z","timestamp":1673663387110},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_33","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"566-598","source":"Crossref","is-referenced-by-count":133,"title":["Robust Non-interactive Zero Knowledge"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Di Crescenzo","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, A. De Santis, S. Micali AND G. Persiano, Non-Interactive Zero-Knowledge Proofs. SIAM Journal on Computing, vol. 6, December 1991, pp. 1084\u20131118.","DOI":"10.1137\/0220068"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman AND S. Micali, Non-interactive zero-knowledge and its applications. Proceedings of the 20th Annual Symposium on Theory of Computing, ACM, 1988.","DOI":"10.1145\/62212.62222"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"G. Brassard}}, D. Chaum} and C. Cr\u00e4peau}}, Minimum Disclosure Proofs of Knowledge. JCSS, v. 37, pp 156\u2013189.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"33_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 89 Proceedings","author":"M. Bellare","year":"1989","unstructured":"M. Bellare, S. Goldwasser, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. Advances in Cryptology-Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989."},{"key":"33_CR5","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. ECCC Report TR99-042, revised June 2000. Available from http:\/\/www.eccc.uni-trier.de\/eccc\/ . Preliminary version appeared in ACM STOC 2000."},{"key":"33_CR6","unstructured":"R. Canetti, J. Kilian, E. Petrank, AND A. Rosen Black-Box Concurrent Zero-Knowledge Requires $$ \\tilde \\Omega (\\log n) $$ Rounds. Proceedings of the-67th Annual Symposium on Theory of Computing, ACM, 1901."},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 98 Proceedings","author":"R. Cramer","year":"1998","unstructured":"R. Cramer AND V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Advances in Cryptology-Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"A. De Santis AND G. Persiano, Zero-knowledge proofs of knowledge without interaction. Proceedings of the 33rd Symposium on Foundations of Computer Science, IEEE, 1992.","DOI":"10.1109\/SFCS.1992.267809"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo AND G. Persiano, Randomness-efficient Non-Interactive Zero-Knowledge. Proceedings of 1997 International Colloquium on Automata, Languagues and Applications (ICALP 1997).","DOI":"10.1007\/3-540-63165-8_225"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo AND G. Persiano, Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. Proceedings of 1999 International Colloquium on Automata, Languagues and Applications (ICALP 1999).","DOI":"10.1007\/3-540-48523-6_24"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo AND G. Persiano, Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge Proofs of Knowledge for all NP Relations. Proceedings of 2000 International Colloquium on Automata, Languagues and Applications (ICALP 2000).","DOI":"10.1007\/3-540-45022-X_38"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Y. Ishai, AND R. Ostrovsky, Non-Interactive and Non-Malleable Commitment. Proceedings of the 30th Annual Symposium on Theory of Computing, ACM, 1998.","DOI":"10.1145\/276698.276722"},{"key":"33_CR13","unstructured":"D. Dolev, C. Dwork, AND M. Naor, Non-Malleable Cryptography. Proceedings of the-45th Annual Symposium on Theory of Computing, ACM, 1923 and SIAM Journal on Computing, 2000."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, AND A. Sahai, Concurrent Zero-Knowledge. Proceedings of the 30th Annual Symposium on Theory of Computing, ACM, 1998.","DOI":"10.1145\/276698.276853"},{"key":"33_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 31st Annual Symposium on Foundations of Computer Science, volume I, pages 308\u2013317, St. Louis, Missouri, 22\u201324 October 1990. IEEE.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"33_CR16","unstructured":"O. Goldreich, Secure Multi-Party Computation, 1998. First draft available at http:\/\/theory.lcs.mit.edu\/~oded"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin, A Hard Predicate for All One-way Functions. Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.","DOI":"10.1145\/73007.73010"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser AND S. Micali, How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210\u2013217.","journal-title":"Journal of the ACM"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, AND A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. Proceedings of the 19th Annual Symposium on Theory of Computing, ACM, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"33_CR20","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","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. Journal of ACM 38(3): 691\u2013729 (1991).","journal-title":"Journal of ACM"},{"issue":"1","key":"33_CR21","doi-asserted-by":"crossref","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 Journal on Computing, 18(1):186\u2013208, February 1989.","journal-title":"SIAM Journal on Computing"},{"key":"33_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 92 Proceedings","author":"S. Goldwasser","year":"1992","unstructured":"S. Goldwasser, R. Ostrovsky Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent. Advances in Cryptology-Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992."},{"key":"33_CR23","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin, AND M. Luby, Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing. Preliminary versions by Impagliazzo et. al. in 21st STOC (1989) and H\u00e5stad in 22nd STOC (1990)."},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions, Journal of Cryptology, vol. 11, n. 1, 1998.","DOI":"10.1007\/s001459900032"},{"key":"33_CR25","unstructured":"J. Kilian, E. Petrank Concurrent and Resettable Zero-Knowledge in Polylogarithmic Rounds. Proceedings of the-67th Annual Symposium on Theory of Computing, ACM, 1901"},{"key":"33_CR26","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 92 Proceedings","author":"M. Naor","year":"1992","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, AND M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. Advances in Cryptology-Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992 and J. Cryptology, 11(2):87-108, 1998."},{"key":"33_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor, Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol 4, 1991, pp. 151\u2013158.","journal-title":"Journal of Cryptology"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"M. Naor AND M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks. Proceedings of the 22nd Annual Symposium on Theory of Computing, ACM, 1990.","DOI":"10.1145\/100216.100273"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"M. Naor AND M. Yung, \u201cUniversal One-Way Hash Functions and their Cryptographic Applications\u201d, Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.","DOI":"10.1145\/73007.73011"},{"key":"33_CR30","unstructured":"R. Ostrovsky One-way Functions, Hard on Average Problems and Statistical Zero-knowledge Proofs. In Proceedings of 6th Annual Structure in Complexity Theory Conference (STRUCTURES-91) June 30\u2013July 3, 1991, Chicago. pp. 51\u201359"},{"key":"33_CR31","unstructured":"R. Ostrovsky, AND A. Wigderson One-Way Functions are Essential for Non-Trivial Zero-Knowledge. Appeared In Proceedings of the second Israel Symposium on Theory of Computing and Systems (ISTCS-93) Netanya, Israel, June 7th\u20139th, 1993."},{"key":"33_CR32","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 91 Proceedings","author":"C. Rackoff","year":"1991","unstructured":"C. Rackoff AND D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology-Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991."},{"key":"33_CR33","doi-asserted-by":"crossref","unstructured":"A. Sahai Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. Proceedings of the 40th Symposium on Foundations of Computer Science, IEEE, 1999","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"33_CR34","unstructured":"A. Sahai AND S. Vadhan A Complete Problem for Statistical Zero Knowledge. Preliminary version appeared in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. Newer version may be obtained from authors\u2019 homepages."}],"container-title":["Advances in Cryptology \u2014 CRYPTO 2001","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:22:08Z","timestamp":1556965328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":34,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44647-8_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}