Reusable Two-Round MPC from DDH
Reusable Two-Round MPC from DDH
复制标题
DDH 可重复使用的两轮 MPC
DOI：
10.1007/978-3-030-64378-2_12
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Pratyay Mukherjee
中科院分区：
文献类型：
--
作者：
S. Badrinarayanan;James Bartusek;Sanjam Garg;Daniel Masny;Pratyay Mukherjee
Please try later.
. We present a reusable two-round multi-party computation (MPC) protocol from the Decisional Diffie Hellman assumption (DDH). In particular, we show how to upgrade any secure two-round MPC protocol to allow reusability of its first message across multiple computations, using Homomorphic Secret Sharing (HSS) and pseudorandom functions in NC 1 — each of which can be instantiated from DDH. In our construction, if the underlying two-round MPC protocol is secure against semi-honest adversaries (in the plain model) then so is our reusable two-round MPC protocol. Similarly, if the underlying two-round MPC protocol is secure against malicious adversaries (in the common random/reference string model) then so is our reusable two-round MPC protocol. Previously, such reusable two-round MPC protocols were only known under assumptions on lattices. At a technical level, we show how to upgrade any two-round MPC protocol to a first message succinct two-round MPC protocol, where the first message of the protocol is generated independently of the computed circuit (though it is not reusable). This step uses homomorphic secret sharing (HSS) and low-depth pseudorandom functions. Next, we show a generic transformation that upgrades any first message succinct two-round MPC to allow for reusability of its first message.
黑盒乱码RAM
DOI：
--
发表时间：
2015
期刊：
Annual Symposium on Foundations of Computer Science
影响因子：
--
作者：
Garg, Sanjam;Lu, Steve;Ostrovsky, Rafail
通讯作者：
Ostrovsky, Rafail
DOI：
10.1007/978-3-319-78375-8_17
发表时间：
2018-04
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Fabrice Benhamouda;Huijia Lin
通讯作者：
Fabrice Benhamouda;Huijia Lin