Student Seminar in Computational Complexity and Theoretical Cryptography

Zero Knowledge

Note: Presentations related to "Zero Knowledge" are being organized by Yevgeniy Vahlis and Periklis Papakonstantinou.

Speaker: Periklis Papakonstantinou

Topic: Interactive proofs, Zero knowledge and Complexity classes

Date: October 1st and 9th, 2007

ABSTRACT
We get a bit of the track by skimming over complexity classes associated with interactive proof systems and zero knowledge in particular. We define IP, AM, MA, PZK,CZK,SZK and state some related main results and sketch the main points in their proofs. We give in detail a proof of IP=PSPACE.