Privacy preserving similarity detection for data analysis

Iraklis Leontiadis (1) , Melek Önen (1) , Refik Molva (1) , M.J. Chorley (2) , G.B. Colombo (2)

1 Eurecom [Sophia Antipolis]
2 School of Computer Sciences & Informatics [Cardiff]

Current applications tend to use personal sensitive information to achieve better quality with respect to their services. Since the third parties are not trusted the data must be protected such that individual data privacy is not compromised but at the same time operations on it would be compatible. A wide range of data analysis operations entails a similarity detection algorithm between user data. For instance clustering on big data groups together objects based on the heuristic that similar objects are likely to be put under the same cluster. Similarity decisions are important for numerous applications such as: online social networks, recommendations systems and behavioral advertisement. In this paper we propose a mechanism that protects user privacy and preserves data similarity results although encrypted. We analyze the security of the scheme and we further demonstrate its correctness and feasibility through a real life experiment where "personality traits" by users are collected for a 4square application.

Domaines: Cryptographie et sécurité [cs.CR]

Iraklis Leontiadis, Melek Önen, Refik Molva, M.J. Chorley, G.B. Colombo. Privacy preserving similarity detection for data analysis. In Proceedings Collective Social Awareness and Relevance Workshop 2013, Sep 2013, Karlsruhe, Germany. pp.Article No.: 3. ⟨hal-00868402⟩