Advertisement

Efficient Zero-Knowledge Proofs for Some Practical Graph Problems

  • Yvo Desmedt
  • Yongge Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2576)

Abstract

From a cryptographic aspect zero-knowledge protocols for graph isomorphisms, graph non-isomorphisms, and graph-coloring are artificial problems, that received lots of attention. Due to recent work in network security in a broadcast setting, it seems important to design efficient zero-knowledge protocols for the following graph problems: independent set problem, neighbor independent set problem, and disjoint broadcast lines problem. In this paper, we will introduce a new concept of k-independent set problem which is a generalization of independent set and neighbor independent set problems, and we will present efficient zero-knowledge protocols for these problems. In the end of the paper we will give some cryptographic applications of k-independent set. Especially, we will point out the applications to the concept of “threshold” and appropriate access structures. Note that k-independent set also has applications outside cryptography, such as biology, methodology of scientific research, ethics, etc., which are beyond the scope of this paper.

Keywords

Zero-knowledge graph theory secret sharing key-escrow complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Blum. How to prove a theorem so no one else can claim it. Proc. of the International Congress of Mathematicians, pages 1444–1451, Berkeley, California, U.S.A., 1987.Google Scholar
  2. 2.
    C. Blundo, A. De Santis, D. Stinson, and U. Vaccaro. Graph decompositions and secret sharing schemes. In: Advances in Cryptology, Proc. of Eurocrypt’ 92, LNCS 658, pages 1–24, Springer Verlag, 1992.Google Scholar
  3. 3.
    A. De Santis, G. Di Crescenzo, O. Goldreich, G. Persiano. The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. Information Processing Letters 69(4): 201–206, 1999.CrossRefMathSciNetGoogle Scholar
  4. 4.
    Y. Desmedt and Y. Wang. Approximation hardness and secure communication in broadcast channels. In: Advances in Cryptology, Proc. Asiacrypt’ 99, LNCS 1716, pages 247–257, Springer Verlag, 1999.Google Scholar
  5. 5.
    D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14–30, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. of the ACM, 40(1):17–47, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    L. Fortnow. The complexity of perfect zero-knowledge. In: Proc. ACM STOC’ 87, pages 204–209, ACM Press, 1987.Google Scholar
  8. 8.
    M. Franklin and R. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13:9–30. 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    M. Franklin and M. Yung. Secure hypergraphs: privacy from partial broadcast. In: Proc. ACM STOC’ 95, pages 36–44, ACM Press, 1995.Google Scholar
  10. 10.
    M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman and Company, San Francisco, 1979.Google Scholar
  11. 11.
    O. Goldreich, S. Goldwasser, and N. Linial. Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2):506–544, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. of the ACM, 38(1):691–729, 1991.zbMATHMathSciNetGoogle Scholar
  13. 13.
    S. Goldwasser and S. Micali. Probabilistic encryption. J. of Comp. and Sys. Sci., 28(2):270–299,1984.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    S. Goldwasser, S. Micali, and C. Racko.. The knowledge complexity of interactive proof systems. SIAM J. Comp., 18(1):186–208, 1989.zbMATHCrossRefGoogle Scholar
  15. 15.
    J. Grossman and P. Ion. On a portion of the well-known collaboration graph. Congressus Numerantium, 108:129–131, 1995.zbMATHMathSciNetGoogle Scholar
  16. 16.
    V. Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.Google Scholar
  17. 17.
    M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In: Proc. IEEE Global Telecommunications Conf., Globecom’ 87, pages 99–102, IEEE Communications Soc. Press.Google Scholar
  18. 18.
    S. Micali. Fair public-key cryptosystem. In: Advances in Cryptology, Proc. of Crypto’ 92, LNCS 740, pages 113–138, Springer Verlag, 1992.Google Scholar
  19. 19.
    Y. Wang and Y. Desmedt. Secure communication in multicast channels. J. of Cryptology 14:121–135, 2001.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Yvo Desmedt
    • 1
  • Yongge Wang
    • 2
  1. 1.Computer Science, Florida State UniversityFloridaUSA
  2. 2.Department of Software and Information SystemsUniversity of North Carolina at CharlotteCharlotte

Personalised recommendations