The Community for Technology Leaders
Green Image
Issue No. 02 - February (2009 vol. 21)
ISSN: 1041-4347
pp: 253-258
Christopher W. Clifton , Purdue University, West Lafayette
Jaideep Vaidya , Rutgers University, Newark
Given a large integer data set shared vertically by two parties, we consider the problem of securely computing a score separating the k{\rm th} and the (k + 1){\rm th} element. An efficient secure protocol is developed to compute such a score while revealing little additional information. The proposed protocol is implemented using the Fairplay system and experimental results are reported. We show a real application of this protocol as a component used in the secure processing of top-k queries over vertically partitioned data.
Privacy, security, k{\rm th} element score, top-k queries.
Christopher W. Clifton, Jaideep Vaidya, "Privacy-Preserving Kth Element Score over Vertically Partitioned Data", IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 253-258, February 2009, doi:10.1109/TKDE.2008.167
104 ms
(Ver )