RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2012
VO 9
IS
SP 641
TI Query Profile Obfuscation by Means of Optimal Query Exchange between Users
A1 Jordi Forné,
A1 David Rebollo-Monedero,
A1 Josep Domingo-Ferrer,
K1 Privacy
K1 Protocols
K1 IP networks
K1 Histograms
K1 Entropy
K1 Forgery
K1 Optimization
K1 information theory.
K1 Profile obfuscation
K1 private information retrieval
K1 privacy via user collaboration
K1 entropy
AB We address the problem of query profile obfuscation by means of partial query exchanges between two users, in order for their profiles of interest to appear distorted to the information provider (database, search engine, etc.). We illustrate a methodology to reach mutual privacy gain, that is, a situation where both users increase their own privacy protection through collaboration in query exchange. To this end, our approach starts with a mathematical formulation, involving the modeling of the users' apparent profiles as probability distributions over categories of interest, and the measure of their privacy as the corresponding Shannon entropy. The question of which query categories to exchange translates into finding optimization variables representing exchange policies, for various optimization objectives based on those entropies, possibly under exchange traffic constraints.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2012.16
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.16