计算机应用 ›› 2013, Vol. 33 ›› Issue (12): 3527-3530.

• 信息安全 • 上一篇    下一篇

集合成员判定问题的安全多方计算解决方案

豆永丽1,2,王海春1,2,康剑1,2   

  1. 1. 成都信息工程学院 网络工程学院，成都 610225
    2. 成都信息工程学院 网络工程学院，成都 610225
  • 收稿日期:2013-07-01 修回日期:2013-08-22 出版日期:2013-12-01 发布日期:2013-12-31
  • 通讯作者: 豆永丽
  • 作者简介:豆永丽(1987-),女,河南周口人,硕士研究生,主要研究方向:混沌加密、物联网安全;
    王海春(1957-),男,四川成都人,教授,主要研究方向:混沌加密、物联网安全、实时软件工程;
    康剑(1987-),男,湖北孝感人,硕士,主要研究方向:混沌加密、物联网安全。
  • 基金资助:
    四川省科技基金资助项目

Secure multiparty computation solutions of collection member decision

DOU Yongli,WANG Haichun,KANG Jian   

  1. College of Network Engineering, Chengdu University of Information Technology, Chengdu Sichuan 610225, China
  • Received:2013-07-01 Revised:2013-08-22 Online:2013-12-31 Published:2013-12-01
  • Contact: DOU Yongli

PDF

摘要： 对可交换密钥解决方案与同态加密解决方案进行了分析，并指出了二者在计算复杂度上的不足。在此基础上，提出了另外两种解决方案，一种是基于混沌加密解决方案，另一种是引入不可信第三方参与的非对称加密解决方案，并分析证明了这两种方案的正确性、安全性和复杂性。将提出的新方案与现有的方案进行实验对比，结果证实了新方案能降低算法的复杂度，极大地提高了算法的执行效率。

关键词: 安全多方计算, 集合成员判定, 混沌加密, 可交换加密, 不可信第三方

Abstract: The exchangeable key solutions and homomorphic encryption solutions were analyzed. Meanwhile, the deficiencies of these two solutions on the computational complexity were pointed out. On the basis of that, two new solutions were put forward: one was based on chaotic encryption solution, and the other was asymmetric encryption solution which introduced the incredible third party. The correctness, security and complexity of them were analyzed and verified. The comparison between the proposed solutions and the existing ones was given. The experimental results show that the new solutions can reduce the complexity of the algorithm, and greatly improve the execution efficiency of algorithm.

Key words: secure multiparty computation, collection member decision, chaotic encrytion, exchangeable encryption, incredible third party

中图分类号: 

版权所有 © 2021 四川计算机应用杂志社有限公司
蜀ICP备 05010208 号-3　新出网证(川)字026号
技术支持：北京玛格泰克科技发展有限公司
访问总数：
今日访问：