| 可同时求解最大最小值的安全保密计算协议 |
| |
| 引用本文： | 张文芳,张湾湾,王小敏.可同时求解最大最小值的安全保密计算协议[J].四川大学学报(工程科学版),2023,55(5):262-271. |
| |
| 作者姓名： | 张文芳 张湾湾 王小敏 |
| |
| 作者单位： | 西南交通大学 信息科学与技术学院,西南交通大学 |
| |
| 基金项目： | 国家自然科学基金(61872302),四川省科技计划项目(2017SZYZF0002) |
| |
| 摘 要： | 安全多方计算因其具有去中心化、输入隐私性、公平性等特点，对于研究数据隐私保护问题具有重要的价值，能够保护各个参与者的秘密信息。而安全多方计算中一个最基本的问题就是保密计算多个数据的最值，目前该问题只能通过多次调用子协议来分别求出最大值和最小值或者将该问题转化为排序问题来解决，但这种做法会大大增加计算复杂度甚至会泄露最大值和最小值之外的其他隐私信息。本文针对现有的安全多方计算协议存在的不能一次性保密计算最大值和最小值、效率低下、保密计算结果由唯一的指定解密密钥持有者获取等问题，提出一种新的隐私数据编码方法，在此基础上结合 ElGamal 同态加密算法以及最大门限解密构造了一种无需可信第三方的可同时求解最大值、最小值的安全高效保密计算协议，该协议能够根本抵抗合谋攻击。在此基础上，基于理想-现实模拟范例证明所提方案在半诚实模型下的安全性，最后选取同类方案进行效率分析和性能对比，理论分析和仿真验证表明所提协议在满足更高安全性的前提下，计算复杂度和通信复杂度也较已有方案具有一定的优势。
|
| 关 键 词： | 安全多方计算 最大值最小值 ElGamal同态加密 门限解密 模拟范例 |
| 收稿时间： | 2022/1/25 0:00:00 |
| 修稿时间： | 2022/6/16 0:00:00 |
Efficient Secure Multiparty Computation of the Maximum and the Minimum |
| |
| ZHANG Wenfang,ZHANG Wanwan,WANG Xiaomin.Efficient Secure Multiparty Computation of the Maximum and the Minimum[J].Journal of Sichuan University (Engineering Science Edition),2023,55(5):262-271. |
| |
| Authors: | ZHANG Wenfang ZHANG Wanwan WANG Xiaomin |
| |
| Affiliation: | School of Information Science and Technology,Southwest Jiaotong Univ,Southwest Jiaotong University |
| |
| Abstract: | Secure multi-party computation is of great value for studying data privacy and confidentiality because of its decentralization, input privacy; and fairness, which can protect the secret information of each participant. One of the most fundamental problems in secure multi-party computation is to confidentially compute the maximum and minimum values of multiple data. Currently, this problem can only be solved by invoking subprotocols multiple times to find the maximum and minimum values separately or by transforming the problem into a sorting problem. However the above approaches will greatly increase the computational complexity or even reveal some private information other than the maximum and minimum values. In this paper, we propose a new privacy data encoding method based on ElGamal homomorphic encryption algorithm and joint decryption to address the problems of existing secure multi-party computation protocols, such as inability to simultaneously compute maximum and minimum values confidentially, inefficiency, and unfairness of confidential computation results being revealed by a designative decryption key holder. This protocol is proved to be resistant to collusion attacks. Based on this, we prove the security of the proposed scheme under the semi-honest model based on ideal-realistic simulation example. Finally, we select similar schemes for efficiency analysis and performance comparison, and the theoretical analysis and simulation verification show that the proposed protocol has certain advantages over existing schemes in terms of computational complexity and communication complexity while satisfying higher security. |
| |
| Keywords: | secure multi-party computation maximum minimum ElGamal homomorphic encryption threshold decryption simulation paradigm |
|
| 点击此处可从《四川大学学报(工程科学版)》浏览原始摘要信息 |
|
点击此处可从《四川大学学报(工程科学版)》下载全文 |
