Zero-Knowledge Proofs for Independent Set and Dominating Set Problems

  • Javad Mohajeri
Part of the Mathematics and Its Applications book series (MAIA, volume 329)


Independent set and dominating set problems are two NP-C problems in graph theory. In this paper we propose two zero-knowledge proofs for these problems.


Fair Coin Interactive Proof Combinatorics Advance Interactive Proof System Proper Node 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Burk and A. Pfitzmann; “Digital Payment systems enabling security and unobservability.” Computers and Security 9 (1989), 399–416.CrossRefGoogle Scholar
  2. [2]
    O. Goldreich, S. Micali, and A. Widgerson; “How to prove all NP- statements in Zero-Knowledge, and an methodology of Cryptographic protocol design”. Lecture Notes in Computer Science, Vol. 263. Springer, Berlin Heidelberg New York 1987, pp. 171–185.Google Scholar
  3. [3]
    S. Goldwasser, S. Micali, and C. Rackoff; “The Knowledge Complexity of interactive proof systems.” Proceeding of the 17th ACM Symposium on the theory of Computing. 1985, pp. 291–304.Google Scholar
  4. [4]
    A. Salomaa; “Public-Key Cryptography”, Springer-Verlage (1990).Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Javad Mohajeri
    • 1
  1. 1.Electronic Research CenterSharif University of TechnologyTehranIran

Personalised recommendations