{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:41:42Z","timestamp":1787506902020,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540647812","type":"print"},{"value":"9783540686811","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0055102","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"784-795","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Image density is complete for non-interactive-SZK"],"prefix":"10.1007","author":[{"given":"A.","family":"De Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Di Crescenzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Yung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"67_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"W. Aiello and J. H\u00e5stad, Statistical Zero Knowledge Can Be Recognized in Two Rounds, Journal of Computer and System Sciences, 42, 1991, pp. 327\u2013345.","journal-title":"Journal of Computer and System Sciences"},{"key":"67_CR2","unstructured":"W. Aiello, M. Bellare and R. Venkatesan, Knowledge on the average \u2014 Perfect, Statistical and Logarithmic, in Proc. of STOC 95."},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"L. Babai and S. Moran, Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, Journal of Computer and System Sciences, vol. 36, 1988, pp. 254\u2013276.","journal-title":"Journal of Computer and System Sciences"},{"key":"67_CR4","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. H\u00e5stad, J. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in CRYPTO 88."},{"issue":"no.6","key":"67_CR5","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":"67_CR6","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in STOC 88."},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter and M. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences, vol. 18, 1979, pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"67_CR8","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, G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, Theoretical Computer Science, vol. 132, (1994), pag. 291\u2013317.","journal-title":"Theoretical Computer Science"},{"key":"67_CR9","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano, Randomness-Efficient Non-Interactive Zero-Knowledge, in Proc. of ICALP 97."},{"key":"67_CR10","unstructured":"A. De Santis, G. Di Crescenzo, P. Persiano, and M. Yung, On Monotone Formula Closure of SZK, in FOCS 94."},{"key":"67_CR11","unstructured":"L. Fortnow, The Complexity of Perfect Zero Knowledge, in STOC 87."},{"key":"67_CR12","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey e D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979."},{"issue":"n.1","key":"67_CR13","first-page":"691","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 the ACM, vol. 38, n. 1, 1991, pp. 691\u2013729.","journal-title":"Journal of the ACM"},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, v. 7, n. 1, 1994.","DOI":"10.1007\/BF00195207"},{"key":"67_CR15","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":"67_CR16","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof-Systems, in STOC 1986.","DOI":"10.1145\/12130.12137"},{"key":"67_CR17","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a Pseudo-Random Generator from One-Way Function, to appear in SIAM J. on Computing."},{"key":"67_CR18","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in CRYPTO 87."},{"key":"67_CR19","unstructured":"R. Impagliazzo and D. Zuckerman, How to recycle random bits, in FOCS 89."},{"key":"67_CR20","unstructured":"M. Naor and M. Yung, Public-Key Crypto systems Provably Secure against Chosen Ciphertext Attack, in STOC 90."},{"key":"67_CR21","unstructured":"T. Okamoto, On Relationships Between Statistical Zero-Knowledge Proofs, in STOC 96."},{"key":"67_CR22","unstructured":"R. Ostrovsky and A. Wigderson, One-way Functions are Essential for Non-Trivial Zero-Knowledge, in ISTCS 93."},{"key":"67_CR23","unstructured":"A. Sahai and S. Vadhan, A Complete Promise Problem for Statistical Zero-Knowledge, in FOCS 97."},{"key":"67_CR24","unstructured":"M. Sipser, A Complexity Theoretic Approach to Randomness, in STOC 83."},{"key":"67_CR25","unstructured":"A. Shamir, IP=PSPACE, in FOCS 90."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:55:23Z","timestamp":1578495323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055102"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0055102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}