On transformation of interactive proofs that preserve the prover's complexity (Q3191986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6347986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On transformation of interactive proofs that preserve the prover's complexity |
scientific article; zbMATH DE number 6347986 |
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
0.8294166326522827
0 references
0.8093416690826416
0 references
0.789394199848175
0 references
