Advertisement

SZK Proofs for Black-Box Group Problems

  • V. Arvind
  • Bireswar Das
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3967)

Abstract

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.

Keywords

Polynomial Time Permutation Group Solvable Group Double Coset Group Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arvind, V., Kurur, P.P.: Graph Isomorphism is in SPP. IEEE Foundations of Computer Science, 743–750 (2002)Google Scholar
  2. 2.
    Babai, L.: Bounded Round Interactive Proofs in Finite Groups. SIAM J. Discrete Math. 5(1), 88–111 (1992)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Babai, L.: Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups STOC, pp. 164–174 (1991)Google Scholar
  4. 4.
    Babai, L., Goodman, A.J., Kantor, W.M., Luks, E.M., Pálfy, P.P.: Short presentations for finite groups. Journal of Algebra 194, 79–112 (1997)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Babai, L., Szemerédi, E.: On the Complexity of Matrix Group Problems I. IEEE Foundations of Computer Science, 229–240 (1984)Google Scholar
  6. 6.
    Goldreich, O.: Foundations of Cryptography, Basic Tools, vol. I. Cambridge University Press, Cambridge (2001)CrossRefMATHGoogle Scholar
  7. 7.
    Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM 38(3), 691–729 (1991)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Goldreich, O., Vadhan, S.: Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. In: IEEE Conference on Computational Complexity (1999)Google Scholar
  9. 9.
    Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal of Computing 18(1), 186–208 (1989)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Köbler, J., Schöning, U., Torán, J.: Graph Isomorphism is Low for PP. Computational Complexity 2, 301–330 (1992)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Luks, E.M.: Permutation groups and polynomial-time computation, in Groups and Computation. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139–175 (1993)Google Scholar
  12. 12.
    Micciancio, D., Vadhan, S.: Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 282–298. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Sahai, A., Vadhan, S.: A Complete Promise Problem for Statistical Zero-Knowledge. Foundations of Computer Science, 448–457 (1997)Google Scholar
  14. 14.
    Vadhan, S.: A Study of Statistical Zero-Knowledge Proofs, Ph.D Thesis, MIT, Revised 8/00 (1999), http://www.eecs.harvard.edu/~salil/papers/phdthesis.ps

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • V. Arvind
    • 1
  • Bireswar Das
    • 1
  1. 1.Institute of Mathematical SciencesChennaiIndia

Personalised recommendations