Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup
复制标题
无需可信设置的跨域高效非交互式零知识证明
DOI：
10.1007/978-3-030-17253-4_10
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Pryvalov, Ivan.
中科院分区：
文献类型：
--
作者：
Backes, Michael;Hanzlik, Lucjan;Herzberg, Amir;Kate, Aniket;Pryvalov, Ivan.
随着最近出现的有效的零知识（ZK）证明一般电路，而有效的零知识证明的代数语句已经存在了几十年，一个自然的挑战出现了联合收割机代数和非代数语句。Chase等人（NATIOPTO 2016）提出了一个交互式ZK证明系统来解决这个跨域问题。作为一个用例，他们表明，他们的系统可以用来证明一个RSA/DSA签名的消息相对于一个公开的彼得森承诺的知识。他们的系统的一个缺点是它需要证明者和验证者之间的交互。这是由于在其构造中使用的乱码电路的交互性质。随后，Agrawal等人（NATIOPTO 2018）提出了一种基于SNARKs的跨域高效非交互式ZK（NIZK）证明系统，但需要可信设置假设。在本文中，我们提出了一种跨域NIZK证明系统，不需要可信设置，对证明者和验证者都有效。我们的系统由基于Schnorr的ZK证明和Giacomelli等人（USENIX 2016）针对一般电路的ZK证明组成。我们的系统的证明大小和运行时间与Chase等人的方法相当。与Bulletproofs（SP 2018）相比，Bulletproofs是一个最近的NIZK证明系统，我们的技术在证明器和验证器上实现了渐近更好的性能，从而在证明大小和运行时间之间呈现出不同的权衡。
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge arose to combine algebraic and non-algebraic statements. Chase et al. (CRYPTO 2016) proposed an interactive ZK proof system for this cross-domain problem. As a use case they show that their system can be used to prove knowledge of a RSA/DSA signature on a messagemwith respect to a publicly known Pedersen commitment. One drawback of their system is that it requires interaction between the prover and the verifier. This is due to the interactive nature of garbled circuits, which are used in their construction. Subsequently, Agrawal et al. (CRYPTO 2018) proposed an efficient non-interactive ZK (NIZK) proof system for cross-domains based on SNARKs, which however require a trusted setup assumption.In this paper, we propose a NIZK proof system for cross-domains that requires no trusted setup and is efficient both for the prover and the verifier. Our system constitutes a combination of Schnorr based ZK proofs and ZK proofs for general circuits by Giacomelli et al. (USENIX 2016). The proof size and the running time of our system are comparable to the approach by Chase et al. Compared to Bulletproofs (SP 2018), a recent NIZK proofs system on committed inputs, our techniques achieve asymptotically better performance on prover and verifier, thus presenting a different trade-off between the proof size and the running time.