The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph clustering problem has a perfect zero-knowledge interactive proof |
scientific article |
Statements
The graph clustering problem has a perfect zero-knowledge interactive proof (English)
0 references
16 June 2016
0 references
graph isomorphism
0 references
zero-knowledge interactive proofs
0 references
cryptography
0 references
computational complexity
0 references
0 references
0 references
0 references
