###
工程科学与技术:2023,55(5):262-271
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
可同时求解最大最小值的安全保密计算协议
(西南交通大学 信息科学与技术学院,四川 成都 611756)
Efficient Secure Multiparty Computation of the Maximum and the Minimum
(School of Info. Sci. and Technol., Southwest Jiaotong Univ., Chengdu 611756, China)
摘要
图/表
参考文献
相似文献
附件
本文已被:浏览 365次   下载 214
投稿时间:2022-01-29    修订日期:2022-06-16
中文摘要: 安全多方计算因其具有去中心化、输入隐私性、公平性等特点,对于研究数据隐私保护问题具有重要的价值,其中一个最基本的问题就是保密计算多个数据的最值。本文针对现有方案不能一次性保密计算最大值和最小值、效率低下、计算结果由特定解密密钥持有者获取等问题,提出一种无需可信第三方的可同时求解最大值、最小值的安全高效保密计算方案。本文方案首先给出一个可同时求解最大值和最小值的编码方法,其基本思想是给定一个势为l的有序数全集(l ≥参与者个数n),各参与者据其所持数据在全集中的位置编码得到长度为l的数组(数值所在位置编为随机数,其他位置编为1),各数组按位相乘后的最左和最右非1数值所在位置即为最大值和最小值在全集中的位置。在上述基础上,结合ElGamal同态加密算法保证所有参与者数据的安全性,并利用最大门限解密使得每个参与者都持有部分解密密钥,进而解决保密计算结果由唯一的指定解密密钥持有者获取的安全性瓶颈问题。接着,基于理想-现实模拟范例方法证明所提方案在半诚实模型下的安全性,结果表明所提方案可以抵抗任意参与者的合谋攻击。最后,选取同类最大(小)值方案进行效率分析和性能对比。理论分析和仿真验证表明所提协议在满足更高安全性的前提下,计算复杂度和通信复杂度较已有方案具有一定的优势。
Abstract:Secure multiparty computation is valuable for studying data privacy protection issues due to its decentralization, input privacy, fairness, etc. One of the most fundamental problems is to confidentially compute the maximum and the minimum of multiple data. In this paper, an efficient secure multipart computation scheme that can compute the maximum and the minimum simultaneously without a trusted third party was proposed to address the problems of existing secure multi-party computation protocols, such as inability of computing the maximum and the minimum at one time, low efficiency, and security risks caused by unique designated decryption key holder. In the scheme, an encoding method that can simultaneously compute the maximum and the minimum was first provided, whose basic idea was to give a complete set of ordinal numbers with potential l (l ≥ the number of participants n), and each participant encodes its data into an array with length l where the location of the data in the complete set was coded as a random number and the other positions were coded as 1. The positions of the leftmost and rightmost non-1 values in the product array were the positions of the maximum and minimum in the whole set. Based on the proposed encoding method, the ElGamal homomorphic encryption algorithm was used to guarantee the confidentiality of all participants’ data, and the maximum threshold decryption was used to make each participant hold part of the decryption key, which avoids the security threats caused by centralized decryption of calculation result by designated key holder. The proposed scheme was proven to be resistant to collusive attacks by any participant under a semi-honest model based on an ideal-realistic simulation paradigm. Finally, the efficiency analysis and performance comparison with related maximum (minimum) computing schemes were given, which showed that the proposed protocol has advantages over existing schemes in terms of computational complexity and communication complexity under the premise of higher security.
文章编号:202200077     中图分类号:TP309    文献标志码:
基金项目:国家自然科学基金项目(61872302);四川省科技计划项目(2017SZYZF0002);四川省重点研发项目(2021YFQ0056)
作者简介:第一作者:张文芳(1978-),女,副教授,博士生导师.研究方向:信息安全与密码学.E-mail:wfzhang@swjtu.edu.cn
引用文本:
张文芳,张湾湾,王小敏.可同时求解最大最小值的安全保密计算协议[J].工程科学与技术,2023,55(5):262-271.
ZHANG Wenfang,ZHANG Wanwan,WANG Xiaomin.Efficient Secure Multiparty Computation of the Maximum and the Minimum[J].Advanced Engineering Sciences,2023,55(5):262-271.