The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The graph clustering problem has a perfect zero-knowledge interactive proof |
scientific article; zbMATH DE number 6594038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The graph clustering problem has a perfect zero-knowledge interactive proof |
scientific article; zbMATH DE number 6594038 |
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
