A one-round, two-prover, zero-knowledge protocol for NP (Q1894702)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A one-round, two-prover, zero-knowledge protocol for NP |
scientific article |
Statements
A one-round, two-prover, zero-knowledge protocol for NP (English)
0 references
10 April 1996
0 references
extremal combinatorics
0 references
zero-knowledge
0 references
NP problems
0 references
extremal combinatorial problem
0 references
