New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More
复制标题
统计 NIZK 的新结构:双模 DV-NIZK 等
DOI:
10.1007/978-3-030-45727-3_14
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Wu, D.J.
中科院分区:
文献类型:
--
作者:
Libert, B.;Passelègue, A.;Wee, H.;Wu, D.J.
Non-interactive zero-knowledge proofs (NIZKs) are important primitives in cryptography. A major challenge since the early works on NIZKs has been to construct NIZKs with astatisticalzero-knowledge guarantee against unbounded verifiers. In the common reference string (CRS) model, such “statistical NIZK arguments” are currently known fromin a pairing-group and from. In the (reusable) designated-verifier model (DV-NIZK), where a trusted setup algorithm generates a reusable verification key for checking proofs, we also have a construction from. If we relax our requirements tocomputationalzero-knowledge, we additionally have NIZKs from factoring andin a pairing group in the CRS model, and from nearlyallassumptions that imply public-key encryption (e.g.,,,) in the designated-verifier model. Thus, there still remains a gap in our understanding of statistical NIZKs in both the CRS and the designated-verifier models.In this work, we develop new techniques for constructing statistical NIZK arguments. First, we construct statistical DV-NIZK arguments from theassumption inpairing-freegroups, theassumption, and theassumption. These are the first constructions in pairing-free groups and fromthat satisfy statistical zero-knowledge. All of our constructions are secure even if the verification key is chosen maliciously (i.e., they are “malicious-designated-verifier” NIZKs), and moreover, they satisfy a “dual-mode” property where the CRS can be sampled from two computationally indistinguishable distributions: one distribution yieldsstatistical DV-NIZK argumentswhile the other yieldscomputational DV-NIZK proofs. We then show how to adapt ourconstruction in a pairing group to obtain newpublicly-verifiablestatistical NIZK arguments from pairings with aqualitatively weakerassumption than existing constructions of pairing-based statistical NIZKs.Our constructions follow the classic paradigm of Feige, Lapidot, and Shamir (FLS). While the FLS framework has traditionally been used to construct computational (DV)-NIZK proofs, we newly show that the same framework can be leveraged to construct dual-mode (DV)-NIZKs.
登录
查看更多内容
影响因子:
3.9
作者:
D. Hofheinz;B. Ursu
通讯作者:
B. Ursu
DOI:
--
发表时间:
2016
期刊:
Annual International Cryptology Conference
影响因子:
--
作者:
B. Hemenway;Zahra Jafargholi;R. Ostrovsky;Alessandra Scafuro;Daniel Wichs
通讯作者:
Daniel Wichs
DOI:
10.1007/0-387-23483-7_89
发表时间:
2005
期刊:
--
影响因子:
--
作者:
Friedrich L. Bauer
通讯作者:
Friedrich L. Bauer
DOI:
10.1007/978-3-030-26954-8_22
发表时间:
2019
期刊:
Graduate Studies in Mathematics
影响因子:
--
作者:
Alex Lombardi;Willy Quach;Ron D. Rothblum;Daniel Wichs;David J. Wu
通讯作者:
David J. Wu
DOI:
10.1007/978-3-030-03807-6_18
发表时间:
2018
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
R. Canetti;Amit Lichtenberg
通讯作者:
Amit Lichtenberg