Paper 2023/1857
A Simple and Efficient Framework of Proof Systems for NP
Abstract
In this work, we propose a simple framework of constructing efficient non-interactive zero-knowledge proof (NIZK) systems for all NP. Compared to the state-of-the-art construction by Groth, Ostrovsky, and Sahai (J. ACM, 2012), our resulting NIZK system reduces the proof size and proving and verification cost without any trade-off, i.e., neither increasing computation cost, CRS size nor resorting to stronger assumptions. Furthermore, we extend our framework to construct a batch argument (BARG) system for all NP. Our construction remarkably improves the efficiency of BARG by Waters and Wu (Crypto 2022) without any trade-off.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2023
- Keywords
- Non-interactive zero-knowledgebatch argumentNP languagepairing-based cryptography.
- Contact author(s)
-
wangyuyu @ uestc edu cn
chuanjie su @ hotmail com
jiaxin pan @ ntnu no
yuchen @ sdu edu cn - History
- 2023-12-06: approved
- 2023-12-04: received
- See all versions
- Short URL
- https://ia.cr/2023/1857
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1857, author = {Yuyu Wang and Chuanjie Su and Jiaxin Pan and Yu Chen}, title = {A Simple and Efficient Framework of Proof Systems for {NP}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1857}, year = {2023}, url = {https://eprint.iacr.org/2023/1857} }