Impossibility of unconditionally secure scalar products
Data & Knowledge Engineering
Privacy-preserving DNS: analysis of broadcast, range queries and mix-based protection methods
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
ACM Transactions on Information and System Security (TISSEC)
| Hi-index | 0.00 |
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.