Paper 2020/1212
Triply Adaptive UC NIZK
Ran Canetti and Pratik Sarkar and Xiao Wang
Abstract
The only known non-interactive zero-knowledge (NIZK) protocol that is secure against adaptive corruption of the prover is based on that of Groth-Ostrovsky-Sahai (JACM'11) (GOS). However that protocol does not guarantee full adaptive soundness. Abe and Fehr (TCC'07) construct an adaptively sound variant of the GOS protocol under a knowledge-of-exponent assumption, but knowledge assumptions of this type are inherently incompatible with universally composable (UC) security. We show the first NIZK which is triply adaptive: it is a UC NIZK protocol in a multi-party, multi-instance setting, with adaptive corruptions and no data erasures. Furthermore, the protocol provides full adaptive soundness. Our construction is very different than that of GOS: it is based on the recent NIZK of Canetti et al (STOC'19), and can be based on a variety of assumptions (e.g. LWE, or LPN and DDH). We also show how to get a succinct reference string assuming LWE or DDH from GOS-like techniques.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Non-interactive Zero KnowledgeCorrelation IntractabilityAdaptive Security
- Contact author(s)
- canetti @ bu edu,pratik93 @ bu edu,wangxiao @ cs northwestern edu
- History
- 2024-02-10: last of 8 revisions
- 2020-10-06: received
- See all versions
- Short URL
- https://ia.cr/2020/1212
- License
-
CC BY