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. © Springer International Publishing 2013.
Author supplied keywords
Cite
CITATION STYLE
Fauzi, P., Lipmaa, H., & Zhang, B. (2013). Efficient modular NIZK arguments from shift and product. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8257 LNCS, pp. 92–121). Springer Verlag. https://doi.org/10.1007/978-3-319-02937-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
