{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:31:48Z","timestamp":1787509908375,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662242","type":"print"},{"value":"9783540485230","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_24","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T07:06:31Z","timestamp":1197270391000},"page":"271-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"A.","family":"De Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Di Crescenzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"24_CR1","unstructured":"M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic Simulation in Logspace, Proc. of STOC 87."},{"key":"24_CR2","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions, Proc. of STOC 88."},{"issue":"6","key":"24_CR3","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":"24_CR4","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proc. of STOC 88."},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to Generate Cryptographically Strong Sequence of Pseudo-Random Bits, SIAM J. on Computing, vol. 13, no. 4, 1984, pp. 850\u2013864.","journal-title":"SIAM J. on Computing"},{"key":"24_CR6","unstructured":"J. Boyar and R. Peralta, Short Discreet Proofs, Proc. of EUROCRYPT 96."},{"key":"24_CR7","unstructured":"A. Cohen and A. Wigderson, Dispersers, Deterministic Amplification and Weak Random Sources, Proc. of FOCS 89."},{"key":"24_CR8","unstructured":"I. Damgaard, Non-interactive circuit-based proofs and non-interactive perfect zero-knowledge with preprocessing, Proc. of EUROCRYPT 92."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(94)90237-2","volume":"132","author":"A. De Santis","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":"24_CR10","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, Randomness-Efficient Non-Interactive Zero-Knowledge, Proc. of ICALP 97."},{"key":"24_CR11","unstructured":"A. De Santis and M. Yung, Cryptographic applications of the meta-proof and the many-prover systems, Proc. of CRYPTO 90."},{"key":"24_CR12","unstructured":"G. Di Crescenzo, Recycling Random Bits for Composed Perfect Zero-Knowledge, Proc. of EUROCRYPT 95."},{"key":"24_CR13","unstructured":"U. Feige, S. Goldwasser, L. Lovasz, S. Safra and M. Szegedy, Approximating Clique is Almost NP-complete, Proc. of FOCS 91."},{"key":"24_CR14","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proc. of STOC 90."},{"key":"24_CR15","unstructured":"Gillman, A Chernoff Bound for Random Walks on Expanders, Proc. of STOC 93."},{"key":"24_CR16","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":"24_CR17","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":"24_CR18","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"},{"issue":"n. 2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, and S. Micali, Probabilistic Encryption, in Journal of Computer and System Sciences, vol. 28, n. 2, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM J. on Computing, vol. 18, n. 1, 1989.","DOI":"10.1137\/0218012"},{"key":"24_CR21","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proc. of FOCS 89."},{"key":"24_CR22","unstructured":"J. Kilian, On the complexity of bounded-interaction and non-interactive zero-knowledge proofs, Proc. of FOCS 94."},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"J. Kilian, and E. Petrank, An efficient zero-knowledge proof system for NP under general assumptions, Journal of Cryptology, vol. 11, n. 1, pp. 1\u201328.","DOI":"10.1007\/s001459900032"},{"key":"24_CR24","unstructured":"M. Luby and A. Wigderson, Pairwise Independence and Derandomization, ICSI Technical Report TR-95-035."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T22:06:32Z","timestamp":1642802792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}