Sciweavers

CSR
2006
Springer

SZK Proofs for Black-Box Group Problems

14 years 3 months ago
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:
Vikraman Arvind, Bireswar Das
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where CSR
Authors Vikraman Arvind, Bireswar Das
Comments (0)