摘要
安全多方排序问题是保护用户隐私的多方协作计算中最为重要的核心问题之一。为避免基于比较的排序方法,借鉴计数排序和桶排序的思想,把多方排序问题简化为多方求和问题。采用数据压缩及巧妙的编码方法,结合安全多方求和技术,发挥蒙特卡罗算法的优势,构造了一个安全实用的多方排序协议。该协议保证了解决安全多方排序问题的安全性、有效性、公平性。
Secure muhi-party sorting is one of the most fundamental and key problems in the muhi-party collaborative computation of protecting the privacy of the users. In this paper, we simplified multi-party sorting problem into multi- party sum problem by avoiding the sorting methods based on the comparison and following some good ideas from count sorting and bucket sorting. A secure and practical muhi-party sorting protocol was constructed by using data compression and ingenious encoding methods, combining the secure muhi-party summation technology and taking advantages of Monte Carlo algorithm. This protocol ensures the security, effectiveness and fairness of solving the secure multi-party sorting problem.
作者
王宁
顾昊旻
郑彤
Wang Ning;Gu Haomin;Zheng Tong(Information Communication Company,State Grid Henan Electric Power Company,Zhengzhou 450052,Henan,Chin;Basic Operation and Maintenance Division,Anhui Continued Software Co.,Ltd.,Hefei 230088,Anhui,China)
出处
《计算机应用与软件》
北大核心
2018年第10期305-311,共7页
Computer Applications and Software
基金
国家自然科学基金项目(61272025)
安徽省高等学校自然科学研究重大项目(KJ2015ZD04).
关键词
安全多方计算
安全多方排序
安全多方求和
计算排序
桶排序
Secure muhi-party computation
Secure muhi-party sorting
Secure muhi-party sum
Count sorting
Bucket sorting
