TurboIKOS: Improved Non-interactive Zero Knowledge and Post-Quantum Signatures
TurboIKOS: Improved Non-interactive Zero Knowledge and Post-Quantum Signatures
复制标题
DOI：
10.1007/978-3-030-78375-4_15
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Yaron Gvili;Julie Ha;Sarah Scheffler;Mayank Varia;Ziling Yang;Xinyuan Zhang
中科院分区：
文献类型：
--
作者：
Yaron Gvili;Julie Ha;Sarah Scheffler;Mayank Varia;Ziling Yang;Xinyuan Zhang
在这项工作中，我们提出了一个零知识参数的一般算术电路，是公共硬币和常数轮，所以它可以成为非交互式和公开验证的菲亚特-沙米尔启发式。该构造基于MPC-在-头范例，其中证明者联合仿真所有MPC协议参与者，并且可以以海狸三元组的形式提供建议，其准确性必须由验证者检查。我们的构建遵循Baum和Nof [PKC 2020]使用的Beaver三重牺牲方法。我们的改进将每个乘法门的通信从4个字段元素减少到2个字段元素，与Katz，Kolesnikov和Wang [CCS 2018]采用的切割选择方法的性能相匹配，并且某些参数设置的附加开销较低。我们实现了我们的协议，并分析其成本Picnic风格的后量子数字签名的基础上的AES系列电路。
In this work, we present a zero knowledge argument for general arithmetic circuits that is public-coin and constant rounds, so it can be made non-interactive and publicly verifiable with the Fiat-Shamir heuristic. The construction is based on the MPC-in-the-head paradigm, in which the prover jointly emulates all MPC protocol participants and can provide advice in the form of Beaver triples whose accuracy must be checked by the verifier. Our construction follows the Beaver triple sacrificing approach used by Baum and Nof [PKC 2020]. Our improvements reduce the communication per multiplication gate from 4 to 2 field elements, matching the performance of the cut-and-choose approach taken by Katz, Kolesnikov, and Wang [CCS 2018] and with lower additive overhead for some parameter settings. We implement our protocol and analyze its cost on Picnic-style post-quantum digital signatures based on the AES family of circuits.