排序问题的多方保密计算协议  

Secure Multi-Party Computation Protocol for Sorting Problem

作　　者：李顺东[1] 张选平[2] 

机构地区：[1]陕西师范大学计算机科学学院,西安710062 [2]西安交通大学计算机科学与技术系,西安710049

出　　处：《西安交通大学学报》2008年第2期231-233,255,共4页Journal of Xi'an Jiaotong University

基　　金：国家自然科学基金资助项目(60673065);国家高技术发展计划资助项目(2005AA114160)

摘　　要：为了解决多方参与的保密排序问题,提出了基于保密排序的隐私保护解决方案.该方案首先假设多方保密计算的参与者为半诚实的,即参与者在协议执行过程中将忠实地执行协议,但可能保留计算的中间结果,以试图推导出其他参与者的输入,然后给定参与者与数据的对应集合关系,并利用离散对数方法计算数据数组以获取其置换结果,从而使得参与者知道且只知道自己的数据在置换后的数组中的位置.模拟范例证明了所提方案具有一定保密性,且特别适用于解决计算机网络中的隐私保护问题.In order to solve multi-party participating secure sort problem, schemes based on privacy-preserving are proposed, in which that all participants of a secure computation are semi-honest is first assumed, i.e. each participant will execute the protocol loyally, but he （or she） keeps a record of all his （her） intermediate computing results and might try to derive other participant＇ s private inputs from the record. Afterwards, given a corresponding collective relation between participants and their data, and using the discrete logarithm method the array is calculated to obtain permutation result, such that a participant knows and only knows the position of his and her data in the permutation array. It is proved, by simulation paradigm, that the proposed schemes are secure, and particularly suitable for solving privacy preserving problems in network.

关 键 词：密码学 多方保密计算 隐私保护 协议 

分 类 号：TN918.2[电子电信—通信与信息系统]