Statistical zero-knowledge languages can be recognized in two rounds (Q808692): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56959192, #quickstatements; #temporary_batch_1705502051474 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56959192 / rank | |||
Normal rank | |||
Revision as of 15:35, 17 January 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
