Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships

Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
复制标题

不可延展的零知识：黑盒结构和定义关系

DOI：
--
复制
发表时间：
2014
期刊：
International Conference on Security and Cryptography for Networks
影响因子：
--
通讯作者：
Omkant Pandey
Omkant Pandey
中科院分区：
--
文献类型：
--
作者：
Abhishek Jain;Omkant Pandey

文献摘要

被引文献

相似文献

本文在一般假设的基础上，研究了（mathcal{NP}）的有效的非延展性零知识证明。我们给出了第一个基于单向函数黑盒使用的（mathcal{NP}）的模拟声音零知识（（mathcal{ZK}））协议的构造。自Dolev、Dwork和Naor的最初工作以来，构造这样一个证明系统一直是一个悬而未决的问题。除了可行性结果，我们的协议有一个恒定的轮数，这是渐近最优的。
This paper deals with efficient non-malleable zero-knowledge proofs for (mathcal{NP}), based on general assumptions. We give the first construction of a simulation-sound zero-knowledge ((mathcal{ZK})) protocol for (mathcal{NP}) based only on the black-box use of one-way functions. Constructing such a proof system has been an open question ever since the original work of Dolev, Dwork, and Naor [18]. In addition to the feasibility result, our protocol has a constant number of rounds, which is asymptotically optimal.