PriMatch: Fairness-aware Secure Friend Discovery Protocol in Mobile Social Network
Mobile social networks are expected to substantially enrich interaction with ubiquitous computing environments by integrating social context information into local interactions. However, in mobile social networks, the mobile users may face the risk of leaking their personal information and their location privacy. In this paper, the authors first model the secure friend discovery process as a generalized privacy-preserving interest/profile matching problem. Then, they identify a new security threat arising from existing secure friend discovery protocols, coined as runaway attack, which is expected to introduce serious fairness issue. To address this new threat, they introduce a novel blind vector transformation technique, which could hide the correlation between the original vector and the transformed result.