International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: NIZK from SNARG

Authors:
Fuyuki Kitagawa
Takahiro Matsuda
Takashi Yamakawa
Download:
Search ePrint
Search Google
Abstract: We give a construction of a non-interactive zero-knowledge (NIZK) argument for all NP languages based on a succinct non-interactive argument (SNARG) for all NP languages and a one-way function. The succinctness requirement for the SNARG is rather mild: We only require that the proof size be $|\pi|=\mathsf{poly}(\lambda)(|x|+|w|)^c$ for some constant $c<1/2$, where $|x|$ is the statement length, $|w|$ is the witness length, and $\lambda$ is the security parameter. Especially, we do not require anything about the efficiency of the verification. Based on this result, we also give a generic conversion from a SNARG to a zero-knowledge SNARG assuming the existence of CPA secure public-key encryption. For this conversion, we require a SNARG to have efficient verification, i.e., the computational complexity of the verification algorithm is $\mathsf{poly}(\lambda)(|x|+|w|)^{o(1)}$. Before this work, such a conversion was only known if we additionally assume the existence of a NIZK. Along the way of obtaining our result, we give a generic compiler to upgrade a NIZK for all NP languages with non-adaptive zero-knowledge to one with adaptive zero-knowledge. Though this can be shown by carefully combining known results, to the best of our knowledge, no explicit proof of this generic conversion has been presented.
Video from TCC 2020
BibTeX
@article{tcc-2020-30610,
  title={NIZK from SNARG},
  booktitle={Theory of Cryptography},
  publisher={Springer},
  author={Fuyuki Kitagawa and Takahiro Matsuda and Takashi Yamakawa},
  year=2020
}