安全多方计算的平摊通信复杂度
Amortized communication complexity of secure multiparty computation
邢朝平   Chaoping Xing
报告人照片   邢朝平1990年获中国科学技术大学博士学位。现任新加坡南洋理工大学教授,长期从事编码、密码、数论研究。曾获新加坡科学技术奖,荷兰Leiden大学Kloosterman讲席教授。在国际重要会议期刊上发表100多篇论文, 如:STOC, CRYPTO, EUROCRYPT, SODA, CCC, ICALP, Advances in Mathematics, Trans. Of the American Mathematical Society, IEEE Transactions on Information Theory. 目前任《IEEE Trans. On Information Theory》, 《Finite Fields and Their Applications》, 《Bulletin of Korean Mathematical Society》多个学术期刊编委。
  A fundamental and widely-applied paradigm due to Franklin and Yung (STOC 1992) on Shamir-secret-sharing based general n-player MPC shows how one may trade the adversary threshold t against amortized communication complexity, by using a so-called packed version of Shamir’s scheme. For e.g. the BGW-protocol (with active security), this trade-off means that if t + 2k − 2 < n/3, then k parallel evaluations of the same arithmetic circuit on different inputs can be performed at the overall cost corresponding to a single BGW-execution.
In this talk we introduce a novel paradigm for amortized MPC that offers a different trade-off, namely with the size of the field of the circuit which is securely computed, instead of the adversary threshold. Thus, unlike the Franklin-Yung paradigm, this leaves the adversary threshold unchanged. Therefore, for instance, this paradigm may yield constructions enjoying the maximal adversary threshold floor {(n − 1)/3} in the BGW-model
This is a joint work with I. Cascudo, R. Cramer and C. Yuan
报告时间:2018年06月04日10时00分    报告地点:西区三教3A411
报名截止日期:2018年06月04日    可选人数:60