{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T01:40:51Z","timestamp":1788486051540,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540557197","type":"print"},{"value":"9783540472780","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55719-9_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:34:51Z","timestamp":1330252491000},"page":"28-40","source":"Crossref","is-referenced-by-count":7,"title":["One-message statistical Zero-Knowledge Proofs and space-bounded verifier"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"6","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal on Computing, vol. 6, December 1991, pp. 1084\u20131118. (Preliminary version: MIT Research Report MIT\/LCS\/TM-430, May 1990.)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 1988.","DOI":"10.1145\/62212.62222"},{"key":"3_CR3","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-NP have Short Interactive Proofs?, Information Processing Letters, vol. 25, May 1987, pp. 127\u2013132.","journal-title":"Information Processing Letters"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, Siam J. on Computing, April 1988.","DOI":"10.1137\/0217015"},{"key":"3_CR5","unstructured":"A. De Santis and G. Persiano, Non-Interactive Zero-Knowledge Proofs of Knowledge, manuscript."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag, pp. 52\u201372.","DOI":"10.1007\/3-540-48184-2_5"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems with Preprocessing, in \u201cAdvances in Cryptology \u2014 CRYPTO 88\u201d, vol. 403 of \u201cLecture Notes in Computer Science\u201d, Springer-Verlag, pp. 269\u2013282.","DOI":"10.1007\/0-387-34799-2_21"},{"key":"3_CR8","doi-asserted-by":"crossref","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.","DOI":"10.1007\/3-540-38424-3_27"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat, and A. Shamir, Zero-knowledge Proofs of Identity, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge based on a Single Random String, Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, Oct. 1990, pp. 308\u2013317.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, Proceedings 19th Annual ACM Symposium on Theory of Computing, New York, NY, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"3_CR12","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Johnson, and L. Stockmeyer, Some Simplified NP-complete Graph Problems, Theor. Comput. Sci., vol. 1, 1976, pp. 237\u2013267.","journal-title":"Theor. Comput. Sci."},{"key":"3_CR14","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, J. Computer System Sci., 28 (1984), pp. 270\u2013299.","journal-title":"J. Computer System Sci."},{"key":"3_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":"3_CR16","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":"3_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"R. Karp, Reducibility among combinatorial problems, in Miller and Thatcher (eds), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013103."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Y. Oren, On the Cunning Power of Cheating Verifiers, in Proceedings of 28th Annual Symposium on Foundations of Computer, 1987, pp. 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/18.50368","volume":"36","author":"A. Orlitsky","year":"1990","unstructured":"A. Orlitsky and A. El Gamal, Average and Ramdomized Communication Complexity, IEEE Trans. on Info. Theory, vol. 36, pp. 3\u201316 (1990).","journal-title":"IEEE Trans. on Info. Theory"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"L. Stockmeyer","year":"1973","unstructured":"L. Stockmeyer, Planar 3-colorability is NP-complete, SIGACT News, vol. 5, 19\u201325 (1973).","journal-title":"SIGACT News"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Proving Possession of Knowledge and Random Self Reducible Problems, in Proceedings of 28th Annual Symposium on Foundations of Computer, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55719-9_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:42:14Z","timestamp":1742593334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55719-9_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557197","9783540472780"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-55719-9_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}