Privacy-Preserving Top-k Query Processing in Distributed Systems
Privacy-Preserving Top-k Query Processing in Distributed Systems
We consider a distributed system that stores user sensitive data across multiple nodes. In this context, we address the problem of privacy-preserving top-k query processing. We propose a novel system, called SD-TOPK, that is able to evaluate top-k queries over encrypted distributed data without needing to decrypt the data in the nodes where they are stored. We implemented and evaluated our system over synthetic and real databases. The results show excellent performance for SD-TOPK compared to baseline approaches.
Privacy Preserv..., Distributed Sys..., Top-k Query, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Privacy Preserv..., Distributed Sys..., Top-k Query, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!