SZK Proofs for Black-Box Group Problems

In this paper we classify several algorithmic problems in group theory in 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. Specifically:

• Type: Conference
• Year: 2006
• Where: CSR
• Authors: Vikraman Arvind, Bireswar Das
• Keywords: CSR 2006, Permutation Groups, Problems, Theoretical Computer Science, Zero Knowledge Proofs