题目： More Efficient Dishonest Majority Secure Computation over Z2k via Galois Rings

主讲人：袁晨

时间：2023年02月22日14:00-15:00

地址：腾讯会议ID：652-950-185

摘要：the context of honest majority MPC over ring of type module p^k, and to the best of our knowledge, our work constitutes the first study of the benefits of these tools in the dishonest majority setting. Reverse multiplication-friendly embeddings (RMFEs) have been used in the honest majority setting (e.g.~Cascudo et al, CRYPTO 2018), and more recently in the dishonest majority setting for computation over binary field (Cascudo and Gundersen, TCC 2020). We make use of the recent RMFEs over ring from (Cramer et al, CRYPTO 2021), together with adaptations of some RMFE optimizations introduced in (Abspoel et al, ASIACRYPT 2021) in the honest majority setting, to achieve an efficient protocol. We also instantiate the necessary offline phase using Oblivious Linear Evaluation (OLE) by generalizing the approach based on Oblivious Transfer (OT) proposed in MASCOT (Keller et al, CCS 2016). To this end, and as an additional contribution of potential independent interest, we present a novel technique using Multiplication-Friendly Embeddings (MFEs) to achieve OLE over Galois ring extensions using black-box access to an OLE protocol over the base ring without paying a quadratic cost in terms of the extension degree. This generalizes the approach in MASCOT based on Correlated OT Extension. This is a joint work with Daniel Escudero and Xing Chaoping.

主讲人简介： 2008年6月毕业于复旦大学数学科学学院，获数学学士学位。2013年6月毕业于复旦大学计算机学院，获计算机软件与理论博士学位，2017年6月毕业于新加坡南洋理工大学，获数学博士学位，博士论文获得新加坡数学协会优秀博士论文奖章。2018年至2020年期间，在荷兰国家数学计算机中心CWI密码组从事博士后研究，2021年1月加入上海交通大学网络空间安全学院。主要研究方向为安全多方计算，秘密分享，代数编码，局部可修复码，列表译码等。论文发表于Crypto，Eurocrypt，SODA，Asiacrypt，TCC，ICALP，RANDOM，IEEE transactions on Information Theory，Transactions of AMS等重要学术会议和期刊上。

邀请人：胡思煌

审核人：魏普文