On transformation of interactive proofs that preserve the prover's complexity (Q3191986)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On transformation of interactive proofs that preserve the prover's complexity |
scientific article |
Statements
On transformation of interactive proofs that preserve the prover's complexity (English)
0 references
26 September 2014
0 references
Arthur-Merlin games
0 references
interactive proof systems
0 references
pseudorandom permutations
0 references
zero-knowledge proofs
0 references
