Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
复制标题
DOI：
10.1007/978-3-662-46494-6_15
复制
发表时间：
2015-03
期刊：
影响因子：
--
通讯作者：
R. Ostrovsky;Alessandra Scafuro;Muthuramakrishnan Venkitasubramaniam
中科院分区：
文献类型：
--
作者：
R. Ostrovsky;Alessandra Scafuro;Muthuramakrishnan Venkitasubramaniam
我们构造了一个恒定的轮复位健全的零知识论点的知识的基础上黑盒使用任何单向函数。可重置可靠性是由Barak、Goldreich、Goldwasser和Lindell [FOCS 01]引入的，是对交互式证明中可靠性要求的加强，要求即使允许恶意证明者“重置”和“重启”验证者，可靠性也应该保持。在他们的工作中，他们表明，可复位的声音ZK参数需要非黑盒模拟技术，也提供了第一个基于巴拉克突破性模拟技术的建设[FOCS 01]。Barak的非黑盒技术的所有已知实现都需要非黑盒使用抗碰撞哈希函数（CRHF）。最近，Goyal，Ostrovsky，Scafuro和Visconti [STOC 14]展示了Barak的技术的实现，其仅需要黑盒访问抗碰撞哈希函数，同时仍然具有非黑盒模拟器。(Such构造被称为装配黑盒。由于Barak等人，将此实现插入编译器中。基于CRHF的黑盒使用，产生了第一个可重置声音ZK参数。然而，从Chung，Pass和Seth [STOC 13]以及Bitansky和Paneth [STOC 13]的工作中，我们知道可重置声音ZK参数可以从任何单向函数（OWF）的非黑盒使用中构造，这是ZK参数的最小假设。因此，一个自然的问题是，是否有可能仅从任何OWF的黑盒使用中构造可重置的零知识参数。在这项工作中，我们提供了一个肯定的答案，这个问题，从而关闭之间的差距，黑盒和非黑盒结构的可重置的声音ZK参数的差距。
We construct a constant round resettably-sound zero knowledge argument of knowledge based on black-box use of any one-way function. Resettable-soundness was introduced by Barak, Goldreich, Goldwasser and Lindell [FOCS 01] and is a strengthening of the soundness requirement in interactive proofs demanding that soundness should hold even if the malicious prover is allowed to “reset” and “restart” the verifier. In their work they show that resettably-sound ZK arguments require nonblack- box simulation techniques, and also provide the first construction based on the breakthrough simulation technique of Barak [FOCS 01]. All known implementations of Barak’s non-black-box technique required non-black-box use of a collision-resistance hash-function (CRHF).Very recently, Goyal, Ostrovsky, Scafuro and Visconti [STOC 14] showed an implementation of Barak’s technique that needs only blackbox access to a collision-resistant hash-function while still having a nonblack- box simulator. (Such a construction is referred to assemi blackbox.) Plugging this implementation in the compiler due to Barak et al. yields the first resettably-sound ZK arguments based on black-box use of CRHFs.However, from the work of Chung, Pass and Seth [STOC 13] and Bitansky and Paneth [STOC 13], we know that resettably-sound ZK arguments can be constructed from non-black-box use of any one-way function (OWF), which is theminimalassumption for ZK arguments.Hence, anatural question iswhether it ispossible to construct resettablysound zero-knowledge arguments from black-box use of any OWF only. In this work we provide a positive answer to this question thus closing the gap between black-box and non-black-box constructions for resettably-sound ZK arguments.