Authors | P. Fauzi, H. Lipmaa and B. Zhang |
Editors | D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, P. C. Rangan, B. Steffen et al. |
Title | Efficient Modular NIZK Arguments from Shift and Product |
Afilliation | Cryptography |
Project(s) | No Simula project |
Status | Published |
Publication Type | Proceedings, refereed |
Year of Publication | 2013 |
Conference Name | Cryptology and Network Security (CANS 2013) |
Volume | 8257371918411522619174 |
Pagination | 92 - 121 |
Publisher | Springer International Publishing |
Place Published | Cham |
ISBN Number | 978-3-319-02936-8 |
ISSN Number | 0302-9743 |
Abstract | We propose a non-interactive product argument, that is more efficient than the one by Groth and Lipmaa, and a novel shift argument. We then use them to design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for NP-complete languages, Set-Partition, Subset-Sum and Decision-Knapsack, with constant communication, subquadratic prover’s computation and linear verifier’s computation. |
URL | https://link.springer.com/chapter/10.1007/978-3-319-02937-5_6 |
DOI | 10.1007/978-3-319-02937-510.1007/978-3-319-02937-5_6 |
Citation Key | 26616 |