Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
复制标题
来自单向排列的轮优化全黑盒零知识论证
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Muthuramakrishnan Venkitasubramaniam
中科院分区：
文献类型：
--
作者：
Carmit Hazay;Muthuramakrishnan Venkitasubramaniam
在本文中，我们重新审视了从最小假设出发通过黑盒构造设计零知识（ZK）论证的整体复杂性。我们的主要结果基于单向单向函数，为 \(\textsf {NP}\) 中的任何语言实现了 4 轮 ZK 参数，这使得黑盒使用底层函数。作为推论，我们还通过黑盒构造获得了基于无爪排列的 \(\textsf {NP}\) 的第一个 4 轮完美零知识论证，以及基于单射单向函数的 4 轮输入延迟提交和证明零知识论证。
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in \(\textsf {NP}\), based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for \(\textsf {NP}\) based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.