当前位置: X-MOL 学术Cybersecurity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds
Cybersecurity Pub Date : 2018-09-29 , DOI: 10.1186/s42400-018-0014-7
Zhenbin Yan , Yi Deng , Yiru Sun

Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting even when adversaries can simultaneously corrupt multiple provers and verifiers. As far as we know, the round complexity of all the constructions of CNMZK arguments for NP is at least ω(logn). In this paper, we provide the first construction of a constant-round concurrent non-malleable zero-knowledge argument for every language in NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations and indistinguishability obfuscators. As an additional contribution, we study the composition of two central notions in zero knowledge, the simultaneously resettable zero-knowledge and non-malleable zero-knowledge, which seemingly have stronger proved security guarantees. We give the first construction of a constant-round simultaneously-resettable non-malleable zero-knowledge. To the best of our knowledge, this is the first study to combine the two security concepts described above together in the zero-knowledge protocols.

中文翻译:

在恒定轮次中并发不可延展零知识和同时可重置不可延展零知识

并发不可延展零知识 (CNMZK) 考虑在设置中并发执行零知识协议,即使对手可以同时破坏多个证明者和验证者。据我们所知,NP 的 CNMZK 参数的所有构造的轮复杂度至少为 ω(logn)。在本文中,我们为 NP 中的每种语言提供了第一个恒定轮并发不可延展零知识论证的构造。我们的协议依赖于一系列抗碰撞散列函数、单向排列和不可区分混淆器的存在。作为额外的贡献,我们研究了零知识中两个中心概念的组合,即可同时重置的​​零知识和不可延展的零知识,它们似乎具有更强的已证明的安全保证。我们给出了一个恒定轮同时可重置的非延展性零知识的第一个构造。据我们所知,这是第一项将上述两个安全概念结合在零知识协议中的研究。
更新日期:2018-09-29
down
wechat
bug