Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TKDE.2008.167 | IEEE Trans. Knowl. Data Eng. |
Keywords | Field | DocType |
real application,vertically partitioned data,partitioned data,efficient secure protocol,additional information,fairplay system,rm th,proposed protocol,privacy-preserving kth element score,secure processing,large integer data,protocol,clustering algorithms,privacy,security,protocols,data security,data privacy,secure computation,testing,distributed databases,distributed database,data handling,helium,databases,terrorism,data mining,information security | Integer,Data mining,Data security,Computer science,Information security,Distributed database,Information privacy,Cluster analysis,Group method of data handling | Journal |
Volume | Issue | ISSN |
21 | 2 | 1041-4347 |
Citations | PageRank | References |
19 | 0.78 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaideep Vaidya | 1 | 2778 | 171.18 |
| Chris Clifton | 2 | 3327 | 544.44 |