Statistical zero-knowledge languages can be recognized in two rounds (Q808692): Difference between revisions
From MaRDI portal
Import recommendations run Q6767936 |
Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 4211490 | ||
Latest revision as of 18:01, 8 July 2025
scientific article; zbMATH DE number 4211490
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
