Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity concept
|
| gptkbp:application |
gptkb:complexity_theory
cryptographic protocols |
| gptkbp:complexity |
gptkb:IP
gptkb:MA gptkb:AM |
| gptkbp:defines |
A system where a prover and a verifier interact to decide membership in a language.
|
| gptkbp:field |
cryptography
theoretical computer science |
| gptkbp:generalizes |
gptkb:NP_(nondeterministic_polynomial_time)
|
| gptkbp:hasProperty |
completeness
soundness multiple rounds of communication randomized verification |
| https://www.w3.org/2000/01/rdf-schema#label |
interactive proof systems
|
| gptkbp:introduced |
gptkb:Shafi_Goldwasser
gptkb:Silvio_Micali gptkb:Charles_Rackoff |
| gptkbp:introducedIn |
1985
|
| gptkbp:relatedTo |
gptkb:Arthur-Merlin_protocol
gptkb:IP_(complexity_class) gptkb:probabilistically_checkable_proofs zero-knowledge proofs |
| gptkbp:variant |
gptkb:public-coin_interactive_proof
gptkb:zero-knowledge_interactive_proof private-coin interactive proof |
| gptkbp:bfsParent |
gptkb:complexity_theory
|
| gptkbp:bfsLayer |
4
|