All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (Q4036854)
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 177018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions |
scientific article; zbMATH DE number 177018 |
Statements
18 May 1993
0 references
zero-knowledge proof
0 references
SAT
0 references
probability encryption homomorphisms
0 references
graph isomorphism
0 references
0.8601774573326111
0 references
0.8290210366249084
0 references
All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (English)
0 references