电子学报 ›› 2017, Vol. 45 ›› Issue (5): 1109-1116.DOI: 10.3969/j.issn.0372-2112.2017.05.013

• 学术论文 • 上一篇    下一篇

集合成员关系的安全多方计算及其应用

陈振华1, 李顺东2, 王道顺3, 黄琼4, 张卫国1   

  1. 1. 西安科技大学计算机科学与技术学院, 陕西西安 710054;
    2. 陕西师范大学计算机科学学院, 陕西西安 710062;
    3. 清华大学计算机科学与技术系, 北京 100084;
    4. 华南农业大学数学与信息学院, 广东广州 510642
  • 收稿日期:2015-11-02 修回日期:2016-05-12 出版日期:2017-05-25
    • 通讯作者:
    • 陈振华
    • 作者简介:
    • 李顺东 男,1963年生于河南,博士生导师,研究方向为安全多方计算;王道顺 男,1967年生于四川,硕士生导师,研究方向为分组密码的设计与分析;黄琼 男,1981年生于江西,硕士生导师,研究方向为数字水印,防伪技术;张卫国 男,1963年生于陕西,硕士生导师,研究方向为信息安全.
    • 基金资助:
    • 西安科技大学博士启动基金 (No.2015QDJ008); 信息安全国家重点实验室开放课题基金 (No.2016-MS-19)

Secure Multiparty Computation of Set Membership and Its Applications

CHEN Zhen-hua1, LI Shun-dong2, WANG Dao-shun3, HUANG Qiong4, ZHANG Wei-guo1   

  1. 1. School of Computer Science and Technology, Xi'an University of Science and Technology, Xi'an, Shaanxi 710054, China;
    2. School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China;
    3. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;
    4. College of Mathematics and Informatics, South China Agricultural University, Guangzhou, Guangdong 510642, China
  • Received:2015-11-02 Revised:2016-05-12 Online:2017-05-25 Published:2017-05-25
    • Supported by:
    • Doctoral Research Fund of Xi’an University of Science and Technology (No.2015QDJ008); Open Project Fund of State Key Laboratory of Information Security of Institute of Information Engineering,  CAS (No.2016-MS-19)

摘要:

集合成员关系的安全多方计算在保密数据挖掘和保密数据查询等方面有着重要的应用价值.针对以往方案在集合规模较大时的低效问题,本文将原问题转化成多项式一次性求值问题,在此基础上共设计了四个协议.利用同态加密设计了平凡协议1;利用离散对数设计了高效协议2,此协议非常简洁.最后,针对不同的应用场景又分别设计了云计算环境下外包用户计算的协议3和抗抵赖环境下可公开保密判定的协议4.通过分析和比较显示,我们的方案除了集合的势,其余任何信息都没有泄露,并且在集合规模较大时,相比以往方案高效而简洁.

关键词: 集合成员, 安全多方计算, 同态加密, 离散对数, 云计算, 抗抵赖

Abstract:

Secure multiparty computation of set membership is significant to privacy-preserving data mining,data query,etc.In this paper,we first transform the original problem into the one-time evaluation problem for polynomial,and then construct four protocols.We design the trivial protocol 1 using homomorphic encryption and construct the efficient protocol 2 using discrete logarithm instead of encryption,which is very concise.Lastly,according to the different application scenarios,we also propose protocol 3 and protocol 4:the former can be used to outsource computation in cloud computing environment;the latter can be used for public secure computation against repudiation.The analysis and comparison show that our protocols are more efficient and concise than previously known.

Key words: set membership, secure multi-party computation, homomorphic encryption, discrete logarithm, cloud computing, against repudiation

中图分类号: