Paper 2020/649
NIZK from SNARG
Fuyuki Kitagawa, Takahiro Matsuda, and Takashi Yamakawa
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
Note: (Mar. 2 2022) Improved the main result in regard to the required succinctness parameter for SNARGs. Fixed problems in the side result about zero-knowledge SNARGs. (See Appendix A.)
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in TCC 2020
- Keywords
- zero knowledgeNIZKSNARG
- Contact author(s)
- takashi yamakawa ga @ hco ntt co jp
- History
- 2022-03-02: last of 2 revisions
- 2020-06-03: received
- See all versions
- Short URL
- https://ia.cr/2020/649
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/649, author = {Fuyuki Kitagawa and Takahiro Matsuda and Takashi Yamakawa}, title = {{NIZK} from {SNARG}}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/649}, year = {2020}, url = {https://eprint.iacr.org/2020/649} }