{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T19:43:41Z","timestamp":1774899821588,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":28,"publisher":"Springer New York","isbn-type":[{"value":"9780387971964","type":"print"},{"value":"9780387347998","type":"electronic"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990]]},"DOI":"10.1007\/0-387-34799-2_4","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:17:36Z","timestamp":1186363056000},"page":"37-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":106,"title":["Everything Provable is Provable in Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Michael","family":"Ben-Or","sequence":"first","affiliation":[]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., and M. Huang, \u201cRecognizing Primes in Random Polynomial Time,\u201d Proceedings of the 19th STOC, 1987, pp. 462\u2013469.","DOI":"10.1145\/28395.28445"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., \u201cTrading Group Theory for Randomness,\u201d Proceedings of the 17th STOC, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Barrington, D., \u201cBounded Width Polynomial Size Branching Programs Recognize Exactly Those Languages in NC 1,\u201d Proceedings of the 18th STOC, 1986, pp. 1\u20135.","DOI":"10.1145\/12130.12131"},{"key":"4_CR4","unstructured":"Babai, L. and S. Moran, \u201cArthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes,\u201d manuscript."},{"key":"4_CR5","unstructured":"Blum, M., \u201cCoin Flipping by Telephone,\u201d IEEE COMPCON, 1982, pp. 133\u2013137."},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"Ravi B. Boppana","year":"1987","unstructured":"Boppana, R., J. H\u00e5stad, and S. Zachos, \u201cDoes co-NP Have Short Interactive Proofs?\u201d, Information Processing Letters, 1987, pp. 127\u2013132.","journal-title":"Information Processing Letters"},{"key":"4_CR7","unstructured":"Brassard, G., personal communication, Augest 1988."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., I. Damg\u00e5rd, and J. van de Graaf, \u201cMultiparty Computations Ensuring Privacy of Each Party\u2019s Input and Correctness of the Result,\u201d Proceedings of Crypto-87, pp. 87\u2013119.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"4_CR9","unstructured":"Feldman, P., \u201cThe Optimum Prover Lives in PSPACE,\u201d manuscript."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Fortnow, L., \u201cThe Complexity of Perfect Zero-Knowledge,\u201d Proceedings of the 19th STOC, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"4_CR11","unstructured":"Goldreich, O., \u201cRandomness, Interactive Proofs and Zero-Knowledge (a survey),\u201d Technion Technical Report, 1987."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., and J. Kilian, \u201cAlmost All Primes Can Be Quickly Certified,\u201d Proceedings of the 18th STOC, 1986, pp. 316\u2013329.","DOI":"10.1145\/12130.12162"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser., S., and S. Micali, \u201cProbabilistic Encryption,\u201d Journal of Computer and System Sciences, Vol. 28, No. 2, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201cKnowledge Complexity of Interactive Proofs,\u201d Proceedings of the 17th STOC, 1985, pp. 291\u2013305","DOI":"10.1145\/22145.22178"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, M., Y. Mansour, and M. Sipser, \u201cInteractive Proof Systems: Provers that Never Fail and Random Selection,\u201d Proceedings of the 28th FOCS, 1987, pp. 449\u2013461.","DOI":"10.1109\/SFCS.1987.35"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \u201cProofs that Yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design,\u201d Proceedings of the 27th FOCS, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \u201cHow to Play Any Mental Game, or, A Completeness Theorem for Protocols with Honest Majority,\u201d Proceedings of the 19th STOC, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., and M. Sipser, \u201cArthur Merlin Games versus Interactive Proof Systems,\u201d Proceedings of the 18th STOC, 1986, pp. 59\u201368.","DOI":"10.1145\/12130.12137"},{"key":"4_CR19","unstructured":"Impagliazzo, R., personal communications, 1987."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., and M. Yung, \u201cDirect Minimum-Knowledge Computations,\u201d Proceedings of Crypto-87, pp. 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J., \u201cFounding Cryptography on Oblivious Transfer,\u201d Proceedings of the 20th STOC, 1988, pp. 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"4_CR22","unstructured":"Kilian, J., \u201cPrimality Testing and the Cryptographic Complexity of Noisy Communications Channels,\u201d MIT Ph.D. Thesis (in preparation), 1988."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Levin, L., \u201cOne-way Functions and Pseudorandom Generators,\u201d Proceedings of the 17th STOC, 1985, pp. 363\u2013368.","DOI":"10.1145\/22145.22185"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali, S., C. Rackoff and R. Sloan, \u201cThe Notion of Security for Probabilistic Cryptosystems,\u201d SIAM Journal of Computing, 17(2):412\u2013426, April 1988.","journal-title":"SIAM Journal of Computing"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Oren, Y., \u201cOn the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs,\u201d Proceedings of the 28th FOCS, 1987, pp. 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Tompa, M., and H. Woll, \u201cRandom Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,\u201d Proceedings of the 28th FOCS, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cTheory and Applications of Trapdoor Functions,\u201d Proceedings of the 23rd FOCS, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"4_CR28","unstructured":"Yung, M., personal communication, Augest 1988."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:18:26Z","timestamp":1737346706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}