Statistical zero-knowledge languages can be recognized in two rounds (Q808692): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1083474 |
Changed an Item |
||
| Property / author | |||
| Property / author: Johan T. Håstad / rank | |||
Normal rank | |||
Revision as of 02:55, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Statistical zero-knowledge languages can be recognized in two rounds |
scientific article |
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
