Challenging epistemology: Interactive proofs and zero knowledge

Journal of Applied Logic - Tập 6 - Trang 490-501 - 2008
Justin Bledin1
1Group in Logic and the Methodology of Science, University of California, 910 Evans Hall #3840, Berkeley, CA 94720-3840, USA

Tài liệu tham khảo

Arkoudas, 2007, Computers, justification, and mathematical knowledge, Minds and Machines, 17, 185, 10.1007/s11023-007-9063-5 Avigad, 2006, Mathematical method and proof, Synthese, 153, 105, 10.1007/s11229-005-4064-5 Avigad, 2008, Computers in mathematical inquiry, 302 Avigad, 2008, Understanding proofs, 317 Colburn, 2000 Irit Dinur, The PCP theorem by gap amplification, Technical Report TR05-046, ECCC, 2005 Fallis, 1997, The epistemic status of probabilistic proof, Journal of Philosophy, 94, 165, 10.2307/2940964 2003 Goldreich Goldreich, 2008 Goldreich Goldreich Shafi Goldwasser, Silvio Micali, Charles Rackoff, The knowledge complexity of interactive proof-systems, in: Proceedings of the 17th ACM Symposium on the Theory of Computing, 1993, pp. 291–304 Hafner, 2008, Beyond unification, 151 Hardy Hodges, 1997 Lautemann, 1983, BPP and the polynomial hierarchy, Information Processing Letters, 17, 215, 10.1016/0020-0190(83)90044-3 2008 Mancosu, 2008, Mathematical explanation: Why it matters, 134 Adi Shamir, IP=PSPACE, in: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 11–15 Soare, 1987 Trevisan