Name
Abstract | ||
|---|---|---|
We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input to the protocol (i.e. the statement to prove). We show in these models a non-interactive statistical zero-knowledge proof for every language that has (interactive) statistical zero-knowledge proof, and a computational zero-knowledge proof for every language in NP. We also show how to change the latter proof system to fit the model of non-interactive computational zero-knowledge with preprocessingto improve existing results in term of the number of bit commitments that are required for the protocol to work. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44448-3_33 | ASIACRYPT |
Keywords | Field | DocType |
statistical zero-knowledge proof,zero knowledge,computational zero-knowledge proof,bit commitment,non-interactive computational zero-knowledge,weaker model,non-interactive statistical zero-knowledge proof,non-interactive zero-knowledge proof systems,latter proof system,random string,zero knowledge proof | Negligible function,Computer science,Proof of knowledge,Communication complexity,Theoretical computer science,Non-interactive zero-knowledge proof,Proof complexity,Public-key cryptography,Zero-knowledge proof,Direct proof | Conference |
Volume | ISSN | ISBN |
1976 | 0302-9743 | 3-540-41404-5 |
Citations | PageRank | References |
4 | 0.42 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danny Gutfreund | 1 | 11 | 0.89 |
| Michael Ben-Or | 2 | 2008 | 420.97 |