An efficient noninteractive zero-knowledge proof system for NP with general assumptions (Q1382146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient noninteractive zero-knowledge proof system for NP with general assumptions |
scientific article; zbMATH DE number 1133024
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient noninteractive zero-knowledge proof system for NP with general assumptions |
scientific article; zbMATH DE number 1133024 |
Statements
An efficient noninteractive zero-knowledge proof system for NP with general assumptions (English)
0 references
14 September 2003
0 references
one-way permutations
0 references
efficient proofs
0 references
circuit satisfiability
0 references
noninteractive zero-knowledge proofs
0 references
shared random string model
0 references
hidden bit model
0 references
interactive proof systems
0 references
