Skip to main content
SpringerLink
Log in

SZK Proofs for Black-Box Group Problems

  • Conference paper
Computer Science – Theory and Applications (CSR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3967))

Included in the following conference series:

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.

Part of the work done was during visits to Berlin supported by a DST-DAAD project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind, V., Kurur, P.P.: Graph Isomorphism is in SPP. IEEE Foundations of Computer Science, 743–750 (2002)

    Google Scholar 

  2. Babai, L.: Bounded Round Interactive Proofs in Finite Groups. SIAM J. Discrete Math. 5(1), 88–111 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Babai, L.: Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups STOC, pp. 164–174 (1991)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Goldreich, O.: Foundations of Cryptography, Basic Tools, vol. I. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal of Computing 18(1), 186–208 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Köbler, J., Schöning, U., Torán, J.: Graph Isomorphism is Low for PP. Computational Complexity 2, 301–330 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  13. Sahai, A., Vadhan, S.: A Complete Promise Problem for Statistical Zero-Knowledge. Foundations of Computer Science, 448–457 (1997)

    Google Scholar 

  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

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematical Sciences, C.I.T Campus, Chennai, 600 113, India

    V. Arvind & Bireswar Das

Authors
  1. V. Arvind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bireswar Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRMAR, Université de Rennes, Campus de Beaulieu, 35042, Rennes Cedex, France

    Dima Grigoriev

  2. Intel Corporation, JF1-13, 2111 NE 25th Avenue, 97124, Hillsboro, OR, USA

    John Harrison

  3. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St., 191023, Petersburg, Russia

    Edward A. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, V., Das, B. (2006). SZK Proofs for Black-Box Group Problems. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_4

Download citation

  • DOI: https://doi.org/10.1007/11753728_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

  • Online ISBN: 978-3-540-34168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation