The Complexity of Zero Knowledge

Abstract

We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right.

Aiello, W., Håstad, J.: Statistical zero-knowledge languages can be recognized in two rounds. Journal of Computer and System Sciences 42(3), 327–345 (1991) (Preliminary version in FOCS 1987)MathSciNetMATHCrossRefGoogle Scholar