The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A Complete Promise Problem for Statistical Zero-Knowledge
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.00 |
In this paper we classify several group-theoretic computational problems into the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to this, these problems were known to be in AM ∩ coAM. As PZK ⊆ SZK ⊆ AM ∩ coAM, we have a tighter upper bound for these problems.