{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:53:56Z","timestamp":1725767636823},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781475752755"},{"type":"electronic","value":"9780387356082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-0-387-35608-2_28","type":"book-chapter","created":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T16:57:25Z","timestamp":1388336245000},"page":"337-351","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistically Checkable Proofs the Easy Way"],"prefix":"10.1007","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/SFCS.1992.267823","volume-title":"Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science","author":"S Arora","year":"1992","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof veri\u00acfication and intractability of approximation problems. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 14\u201323, 1992."},{"key":"28_CR2","first-page":"1","volume-title":"Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science","author":"S Arora","year":"1992","unstructured":"S. Arora and S. Safra. Probabilistic checkable proofs: A new characterization of NP. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 1\u201313, 1992."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minumum disclosure proofs of knowledge. Journal of Computer System Sciences, 37: 156\u2013189, 1988.","journal-title":"Journal of Computer System Sciences"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali. How to construct a random functions. Journal of the ACM, 33 (4): 792\u2013807, 1986.","journal-title":"Journal of the ACM"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(98)00116-1","volume":"67","author":"O Goldreich","year":"1998","unstructured":"O. Goldreich and J. H.stad. On the complexity of interactive proofs with bounded communication. Information Processing Letters, 67 (4): 205\u2013214, 1998.","journal-title":"Information Processing Letters"},{"key":"28_CR6","first-page":"25","volume-title":"Proceedings of :`he 21st ACM Symposium on Theory of Com\u00acputing","author":"O Goldreich","year":"1989","unstructured":"O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of:`he 21st ACM Symposium on Theory of Com\u00acputing, pages 25\u201332, 1989."},{"key":"28_CR7","unstructured":"O. Goldreich. Foundations of cryptography (fragments of a book), February 1993. ECCC Technical report, available at http:\/\/www.eccc.uni\u00actrier.de\/local\/ECCC-Books\/eccc-books.html."},{"key":"28_CR8","volume-title":"Springer Verlag","author":"O Goldreich","year":"1999","unstructured":"O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer Verlag, 1999."},{"key":"28_CR9","volume-title":"Proceedings of the 40th IEEE Symposium on Foundations of Computer Science","author":"R Gennaro","year":"2000","unstructured":"R. Gennaro and L. Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 2000."},{"key":"28_CR10","volume-title":"Available at","author":"O Goldreich","year":"2001","unstructured":"O. Goldreich, S. Vadhan, and A. Wigderson. On interactive proofs with a laconic prover, July 2001. ECCC Technical report TR01\u2013046, available at \n                      http:\/\/www.eccc.uni-trier.de\n                      \n                    \/eccc."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"J. H.stad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a pseudo-random generator from any one-way function. SIAM Journal on Computing, 28 (4), 1999.","DOI":"10.1137\/S0097539793244708"},{"key":"28_CR12","volume-title":"Manuscript","author":"R Impagliazzo","year":"1996","unstructured":"R. Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle. (manuscript), January 1996."},{"key":"28_CR13","volume-title":"Proceedings of the 24th ACM Symposium on Theory of Computing, pages 723-732. ACM Press","author":"J Kilian","year":"1992","unstructured":"J. Kilian. A note on efficient zero-knowledge proofs and arguments. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 723\u2013732. ACM Press, 1992."},{"key":"28_CR14","volume-title":"Advances in Cryptology \u2014 CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 218-238, Berlin, Germany \/ Heidel\u00acberg, Germany \/","author":"RC Merkle","year":"1990","unstructured":"R. C. Merkle. A certified digital signature scheme. In Gilles Brassard, editor, Advances in Cryptology \u2014 CRYPTO \u201889, volume 435 of Lecture Notes in Computer Science, pages 218\u2013238, Berlin, Germany \/ Heidel\u00acberg, Germany \/ London, UK \/ etc., 1990. Springer-Verlag."},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"S. Micali. Computationally sound proofs. SIAM Journal on Computing, 30 (4): 1253\u20131298, 2000.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Com puter and System Sciences, 49: 149\u2013167, 1994.","journal-title":"Journal of Com puter and System Sciences"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/346048.346049","volume":"31","author":"M Sudan","year":"2000","unstructured":"M. Sudan. List decoding: Algorithms and applications (a survey). Sigact News, 31 (1): 16\u201327, 2000.","journal-title":"Sigact News"},{"key":"28_CR18","unstructured":"M. Sudan. Probabilistically checkable proofs, July-August 2000. Lecture notes available at http:\/\/www.toc.lcs.mit.edu\/ madhu\/pcp\/course.html."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"L. Trevisan.\tInteractive and probabilistic proof-checking.\tAnnals of Pure and Applied Logic, 2000.\t(to appear; available at htt p: \/ \/www. cs. berkeley. edu \/ -Luca) .","DOI":"10.1016\/S0168-0072(00)00017-8"},{"key":"28_CR20","volume-title":"Workshop on Parallel Algorithms, May 1999, Atlanta (satelite workshop of FCRC99)","author":"M Zimand","year":"1999","unstructured":"M. Zimand. Sampling under adverse conditions with applications to distributed computing. In Workshop on Parallel Algorithms, May 1999, Atlanta (satelite workshop of FCRC\u201999), 1999."}],"container-title":["Foundations of Information Technology in the Era of Network and Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35608-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:42:58Z","timestamp":1557780178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35608-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781475752755","9780387356082"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35608-2_28","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}