Privacy-preserving computation of k~(th)-element for two-party
Yonghu Zhang · Journal of Fuyang Teachers College · 2014
A protocol is proposed for secure computing of the kth-element of two datasets which are not equal in length.Length of sequence was hidden through padding,and then it was translated into a median-solving problem,in which the result was achieved after comparing secretly the O( log k) times,using Divide-and-Conquer strategy. Furthermore,the correctness and the security of the protocol were proved. The analysis showed that the proposed protocol can be applied in more complicated security application situations as a basis protocol.