DocumentCode
836189
Title
Privacy-Preserving Kth Element Score over Vertically Partitioned Data
Author
Vaidya, Jaideep ; Clifton, Christopher W.
Author_Institution
Manage. Sci. & Inf. Syst. Dept., Rutgers Univ., Newark, NJ
Volume
21
Issue
2
fYear
2009
Firstpage
253
Lastpage
258
Abstract
Given a large integer data set shared vertically by two parties, we consider the problem of securely computing a score separating the kth and the (k + 1) 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.
Keywords
data handling; data privacy; protocols; query processing; very large databases; fairplay system; integer data set; privacy-preserving Kth element score; protocol; secure processing; securely computing; top-k query; vertically partitioned data; Clustering algorithms; Costs; Data security; Databases; Information security; Privacy; Protocols; Terrorism; Testing; Data mining; Distributed databases; Privacy; Security; and protection; integrity; k{rm th} element score; security; top-k queries.;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/TKDE.2008.167
Filename
4599578
Link To Document