论文信息 - The Graph Clustering Problem has a Perfect Zero-Knowledge Proof

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof

The Graph Clustering Problem is parameterized by a sequence of positive integers, m 1 ; :::; m t. The input is a sequence of P t i=1 m i graphs, and the question is whether the equivalence classes under the graph isomorphism relation have sizes which match the sequence of parameters. In this note we show that this problem has a (perfect) zero-knowledge interactive proof system.

Giovanni Di Crescenzo | Oded Goldreich | Alfredo De Santis | Giuseppe Persiano

[1] Carsten Lund,et al. Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies , 1989, EUROCRYPT.

[2] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .

[3] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.

[4] Joel Friedman. Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables , 1986, SIAM J. Comput..

[5] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[6] Oded Goldreich,et al. Quantifying knowledge complexity , 1999, computational complexity.

[7] Martin Tompa,et al. Random self-reducibility and zero knowledge interactive proofs of possession of information , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.

[9] Giovanni Di Crescenzo,et al. On monotone formula closure of SZK , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[11] GoldreichOded,et al. Definitions and properties of zero-knowledge proof systems , 1994 .