基于LWE的集合相交和相等的两方保密计算Secure-电子与信息学报.PDFVIP

第34 卷第2 期 电 子 与 信 息 学 报 Vol.34No.2 2012 年2 月 Journal of Electronics Information Technology Feb. 2012 基于LWE 的集合相交和相等的两方保密计算 夏 峰* 杨 波 张明武 马 莎 雷 涛 (华南农业大学信息学院 广州 510642) 摘 要：利用格上LWE (Leaning With Error)困难性假设，将保密地比较两个数是否相等转化为判断对随机串加 密后的解密是否正确，有效地解决了数和集合关系的判定、求集合交集和集合相等安全多方计算问题，并利用模拟 范例证明该协议在半诚实模型下是安全的。与传统的基于数论的协议相比，该方案由于不需要模指数运算，因而具 有较低的计算复杂度，同时因其基于格中困难问题，因而能抵抗量子攻击。 关键词：密码术；格；LWE (Leaning With Error)；安全多方计算；集合交集；集合相等 中图分类号：TP309 文献标识码： A 文章编号：1009-5896(2012)02-0462-06 DOI: 10.3724/SP.J.1146.2011.00541 Secure Two-party Computation for Set Intersection and Set Equality Problems Based on LWE Xia Feng Yang Bo Zhang Ming-wu Ma Sha Lei Tao (College of Informatics, South China Agricultural University, Guangzhou 510642, China) Abstract: Using Learning With Errors (LWE) in the lattice, the equation test is converted to a decryption ability of a random string. It solves the secure two-party computation such as the relationship of an element and a set, set intersection, and set equation etc. The simulations in the semi-honest model show that these two-party solutions are secure and efficient. Compared with protocols based on security assumptions in number theory, the proposed protocols not only have lower computational complexity without exponential operations but can also resist quantum attack because of the assumption on lattice problem. Key words: Cryptography; Lattice; Learning With Errors (LWE); Secure multiparty computation; Set intersection; Set equality 1 引言 [4,5] 的可交换加密和同态加密技术 。 安全多方计算(SMC)是