{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:10:21Z","timestamp":1737364221924,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551881"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_17","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"225-231","source":"Crossref","is-referenced-by-count":0,"title":["Interactive Proofs with Space Bounded Provers"],"prefix":"10.1007","author":[{"given":"Joe","family":"Kilian","sequence":"first","affiliation":[]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Babai, L., Fortnow, L., Lund, C., \u201cNon-Deterministic Exponential Time has Two-Prover Interactive Protocols\u201d, Technical Report 90-03, University of Chicago, Dept. of Computer Science. Also in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990."},{"key":"17_CR2","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A., \u201cEfficient Identification Schemes Using Two Prover Interactive Proofs\u201d, Advances in Cryptology \u2014 CRYPTO\u2019 89, Springer-Verlag."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A., \u201cMulti-Prover Interactive Proofs: How to Remove Intractability Assumptions\u201d, Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 113\u2013131.","DOI":"10.1145\/62212.62223"},{"key":"17_CR4","unstructured":"Blum, M., \u201cDesigning programs to check their work\u201d, Submitted to CACM."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S., \u201cProgram correctness checking... and the design of programs that check their work\u201d, Proc. 21st ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73015"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R., \u201cSelf-Testing\/Correcting Programs with Applications to Numerical Problems\u201d, Proc. 22nd ACM Symposium on Theory of Computing, 1990.","DOI":"10.1145\/100216.100225"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R., \u201cProgram Result Checking against Adaptive Programs and in Cryptographic Settings\u201d, Distributed Computing and Cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 2, 1991.","DOI":"10.1090\/dimacs\/002\/06"},{"key":"17_CR8","unstructured":"Feige, U., \u201cNEXPTIME has Two-Provers One-Round Proof Systems With Exponentially Small Error Probability\u201d, Manuscript."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Rompel, J., Sipser, M., \u201cOn the Power of Multi-Prover Interactive Protocols\u201d, Proc. 3rd Structure in Complexity Theory Conference, 1998, pp. 156\u2013161.","DOI":"10.1109\/SCT.1988.5275"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Wigderson, A., \u201cSelf-Testing\/Correcting for Polynomials and for Approximate Functions\u201d, Proceedings of 23rd ACM STOC, 1991.","DOI":"10.1145\/103418.103429"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C., The Knowledge Complexity of Interactive Proof Systems\u201d, SIAM J. Comput., 18(1), 1989, pp. 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N., \u201cAlgebraic Methods for Interactive Proof Systems\u201d, Proceedings of the 31st Annual Symposium on Foundations of Computer Science,, 1990.","DOI":"10.1109\/FSCS.1990.89518"},{"key":"17_CR13","unstructured":"Shamir, Adi, \u201cIP=PSPACE\u201d, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:28:32Z","timestamp":1737361712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_17","relation":{},"subject":[]}}