Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR98-006 | 27th January 1998 00:00

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof

RSS-Feed

Abstract:


The input to the {\em Graph Clustering Problem}\/
consists of a sequence of integers $m_1,...,m_t$
and a sequence of $\sum_{i=1}^{t}m_i$ graphs.
The question is whether the equivalence classes,
under the graph isomorphism relation,
of the input graphs have sizes which match the input sequence of integers.
In this note we show that this problem has a (perfect) zero-knowledge
interactive proof system.

This result improves over ECCC TR96-054,
where a parametrized (by the sequence of integers)
version of the problem was studied.



ISSN 1433-8092 | Imprint