Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds

Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Perfect zero-knowledge in constant rounds

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

The (true) complexity of statistical zero knowledge

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Public-randomness in public-key cryptography (extended abstract)

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)

Zero knowledge proofs of knowledge in two rounds

CRYPTO '89 Proceedings on Advances in cryptology

Interactive hashing simplifies zero-knowledge protocol design

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology

One-Way Group Actions

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology

A One-Round, Two-Prover, Zero-Knowledge Protocol for NP

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology