Title :
Research on Secure Multi-party Ranking Problem and Secure Selection Problem
Author :
Cheng, Chao ; Luo, Yong-long ; Chen, Cai-xia ; Zhao, Xiao-kong
Author_Institution :
Dept. of Comput. Sci. & Technol., Anhui Normal Univ., Wuhu, China
Abstract :
In this paper, the problems of secure multi-party ranking and secure selection were studied. Two protocols were proposed. They were both based on Secure Sum protocol. Secure multi-party ranking problem is an extended problem from millionaires´ problem. It can be applied to many fields, such as auctions, commercial enterprises and so on. Secure Sum protocol was used to calculate the sum of vectors. The security and complexity were analyzed in the semi-honest model. In some cases this protocol is better. This paper also studied the problem of secure selection and proposed a protocol using the protocols of Secure Sum and 1-n oblivious transfer. We analyzed the worst case and the average case.
Keywords :
data privacy; protocols; security of data; 1-n oblivious transfer; millionaires problem; privacy; secure multiparty ranking problem; secure selection problem; secure sum protocol; semihonest model; Secure multi-party ranking; Secure selection; Semi-honest model;
Conference_Titel :
Web Information Systems and Mining (WISM), 2010 International Conference on
Conference_Location :
Sanya
Print_ISBN :
978-1-4244-8438-6
DOI :
10.1109/WISM.2010.119
