{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:43Z","timestamp":1725496663157},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_42","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"426-435","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"42_CR1","unstructured":"M. Ben-Or, J. Hastad, J. Kilian, O. Goldreich, S. Goldwasser, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, CRYPTO 88."},{"key":"42_CR2","unstructured":"T. Beth and Y. Desmedt, Identification Tokens-or: Solving the Chess Grandmaster Problem, in Proc. of CRYPTO 90."},{"key":"42_CR3","unstructured":"M. Blum, How to Prove a Theorem So No One Else Can Claim It, in Proc. of the International Congress of Mathematicians, 1986."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"R. Boppana, J. H\u00e5stad, and S. Zachos, Does co-NP have Short Interactive Proofs?, in Inf. Proc. Lett., vol. 25, May 1987.","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"42_CR5","unstructured":"I. Damgaard, Interactive Hashing Simplifies Zero-Knowledge Protocol Design Without Complexity Assumptions, in Proc. of CRYPTO 93."},{"key":"42_CR6","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano and M. Yung, On Monotone Formula Closure of SZK, in Proc. of FOCS 94."},{"key":"42_CR7","unstructured":"G. Di Crescenzo and R. Ostrovsky, On Concurrent Zero-Knowledge with Pre-Processing, in Proc. of CRYPTO 99."},{"key":"42_CR8","unstructured":"G. Di Crescenzo, K. Sakurai and M. Yung, On Zero-Knowledge Proofs: \u201cFrom Membership to Decision\u201d, in Proc. of STOC 2000."},{"key":"42_CR9","unstructured":"C. Dwork, M. Naor, and A. Sahai, Concurrent Zero-Knowledge, STOC 98."},{"key":"42_CR10","unstructured":"C. Dwork and A. Sahai, Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints, in Proc. of CRYPTO 98."},{"key":"42_CR11","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proc. of STOC 87."},{"key":"42_CR12","doi-asserted-by":"crossref","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, in Journal of the ACM, vol. 38, n. 1, 1991.","DOI":"10.1145\/116825.116852"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, in SIAM Journal on Computing, vol. 18, n. 1, February 1989.","DOI":"10.1137\/0218012"},{"key":"42_CR14","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computation, in Proc. of CRYPTO 87."},{"key":"42_CR15","unstructured":"J. Kilian, E. Petrank, and C. Rackoff, Lower Bounds for Zero-Knowledge on the Internet, in Proc. of FOCS 98."},{"key":"42_CR16","unstructured":"R. Richardson and J. Kilian, On the Concurrent Composition of Zero-Knowledge Proofs, in Proc. of EUROCRYPT 99."},{"key":"42_CR17","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, in Proc. of FOCS 87."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:16:49Z","timestamp":1558264609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_42"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"21 July 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}