Privacy-Preserving Kth Element Score over Vertically Partitioned Data
Authors:
- 15 August 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 21 (2) , 253-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
This publication has 23 references indexed in Scilit:
- Secure set intersection cardinality with application to association rule miningJournal of Computer Security, 2005
- Privacy-preserving distributed mining of association rules on horizontally partitioned dataIEEE Transactions on Knowledge and Data Engineering, 2004
- Foundations of Cryptography2004
- Secure Computation of the k th -Ranked Element2004
- Information sharing across private databases2003
- An efficient protocol for Yao's millionaires' problem2003
- Privacy-Preserving Indexing of Documents on the Network2003
- Optimal aggregation algorithms for middleware2001
- LOF2000
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978