Efficient Zero-Knowledge Proofs for Some Practical Graph Problems
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.
KeywordsZero-knowledge graph theory secret sharing key-escrow complexity
Unable to display preview. Download preview PDF.
- 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.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
- 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
- 7.L. Fortnow. The complexity of perfect zero-knowledge. In: Proc. ACM STOC’ 87, pages 204–209, ACM Press, 1987.Google Scholar
- 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.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
- 16.V. Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.Google Scholar
- 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.S. Micali. Fair public-key cryptosystem. In: Advances in Cryptology, Proc. of Crypto’ 92, LNCS 740, pages 113–138, Springer Verlag, 1992.Google Scholar