Triply Adaptive UC NIZK
Lists
Only you see this
Abstract
Non-interactive zero knowledge (NIZK) enables proving the validity of NP statement without leaking anything else. We study multi-instance NIZKs in the common reference string (CRS) model, against an adversary that adaptively corrupts parties and chooses statements to be proven. We construct the first such triply adaptive NIZK that provides full adaptive soundness, as well as adaptive zero-knowledge, assuming either LWE or else LPN and DDH (previous constructions rely on non-falsifiable knowledge assumptions). In addition, our NIZKs are universally composable (UC). Along the way, we:
BibTeX
@article{canetti2020triply,
author = {Ran Canetti and Pratik Sarkar and Xiao Wang},
title = {{Triply Adaptive UC NIZK}},
journal = {IACR Cryptol. ePrint Arch.},
year = {2020},
url = {https://openreview.net/forum?id=I-3UBPb0W8},
}| Adaptive Security of Concurrent Non-Malleable Zero-Knowledge | IACR ePrint · 2011 |
| A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles | IACR ePrint · 2015 |
| Fiat-Shamir From Simpler Assumptions | IACR ePrint · 2018 |
| Robust Non-Interactive Zero-Knowledge Combiners | IACR ePrint · 2025 |
| Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability | IACR ePrint · 2011 |
| Witness-Succinct Universally-Composable SNARKs | IACR ePrint · 2022 |