Statistical zero-knowledge languages can be recognized in two rounds (Q808692): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Does co-NP have short interactive proofs ? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5750398 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal classes of hash functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The knowledge complexity of interactive proof-systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank | |||
Normal rank | |||
Latest revision as of 08:35, 24 June 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
