Name
Abstract | ||
|---|---|---|
Quasi-Adaptive Non-Interactive Zero-Knowledge (QANIZK) proofs make possible efficient NIZK with short proofs by allowing the common reference string to depend on the language. The strongest notion of (computational) soundness for QANIZK is Unbounded Simulation-Soundness (USS). For USS, however, the language is completely beyond the adversary's control. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.tcs.2019.01.041 | Theoretical Computer Science |
Keywords | Field | DocType |
QANIZK proofs,Simulation-soundness,Digital signature,Linearly homomorphic structure-preserving signature | Homomorphic encryption,Discrete mathematics,Vector space,Linear subspace,Digital signature,Mathematical proof,Soundness,Modular design,Mathematics,Bilinear interpolation | Journal |
Volume | ISSN | Citations |
779 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuai Han | 1 | 7 | 10.28 |
| Shuai Han | 2 | 7 | 10.28 |
| Shengli Liu | 3 | 484 | 45.70 |
| Lin Lyu | 4 | 3 | 2.77 |