Round-optimal Black-box Commit-and-prove with Succinct Communication
Round-optimal Black-box Commit-and-prove with Succinct Communication
复制标题
通过简洁通信进行回合最优黑盒提交和证明
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Susumu Kiyoshima
中科院分区：
文献类型：
--
作者：
Susumu Kiyoshima
我们用简洁的通信给出了提交-证明协议的四轮黑箱构造。我们的构造为WI，稳健性误差恒定，通过Khurana等人（TCC 2018）的保轮变换，可以将其升级为ZK，稳健性误差可以忽略不计。我们的构造是通过将Ishai等人（SICOMP 2009）的MPC-in- head技术与Kalai等人（STOC 2014）的两轮简洁论证相结合获得的，主要的技术新颖之处在于对健全性的分析——我们表明，尽管Kalai等人的简洁论证不一定为（mathcal {NP}）语句提供健全性，但它可以用于MPC-in- head技术，以证明提交的MPC视图的一致性。我们的构造是基于亚指数级硬抗碰撞哈希函数、两轮pir和两轮OTs。
We give a four-round black-box construction of a commit-and-prove protocol with succinct communication. Our construction is WI and has constant soundness error, and it can be upgraded into a one that is ZK and has negligible soundness error by relying on a round-preserving transformation of Khurana et al. (TCC 2018). Our construction is obtained by combining the MPC-in-the-head technique of Ishai et al. (SICOMP 2009) with the two-round succinct argument of Kalai et al. (STOC 2014), and the main technical novelty lies in the analysis of the soundness—we show that, although the succinct argument of Kalai et al. does not necessarily provide soundness for (mathcal {NP}) statements, it can be used in the MPC-in-the-head technique for proving the consistency of committed MPC views. Our construction is based on sub-exponentially hard collision-resistant hash functions, two-round PIRs, and two-round OTs.
简洁的非交互式安全计算
DOI：
--
发表时间：
2020
期刊：
EUROCRYPT 2020: Advances in Cryptology – EUROCRYPT 2020
影响因子：
--
作者：
Andrew Morgan, Rafael Pass
通讯作者：
Andrew Morgan, Rafael Pass