Statistical zero-knowledge languages can be recognized in two rounds (Q808692)
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: Statistical zero-knowledge languages can be recognized in two rounds |
scientific article; zbMATH DE number 4211490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistical zero-knowledge languages can be recognized in two rounds |
scientific article; zbMATH DE number 4211490 |
Statements
Statistical zero-knowledge languages can be recognized in two rounds (English)
0 references
1991
0 references
hierarchy of probabilistic complexity classes
0 references
class IP
0 references
interactive prover-verifier pair
0 references
interactive proof
0 references
zero-knowledge proof
0 references
0.86690545
0 references
0.8640218
0 references
0.8505945
0 references
0.8434996
0 references
0.84349954
0 references
0 references
0.83955723
0 references
0.83899176
0 references
