In this paper, we propose privacy-preserving fine-grained data retrieval schemes for mobile social networks (MSNs). The schemes enable users to retrieve data from other users who are interested in some topics related to a subject of interest. We define a subject to be a broad term that can cover many fine-grained topics, e.g., History can be a subject and World War I can be a topic. We consider centralized and decentralized network models. Our centralized scheme allows users to securely outsource data to a server such that the server matches the users who are interested in same topic(s) and have defined social attributes with privacy preservation. Searchable encryption scheme and a proposed cryptography construct are used to enable the server to match the topics and attributes without knowing any private information. By using the social attributes, users can prescribe the other users who can be connected to. We also propose a decentralized scheme that can be used when there is no connection to the server, i.e, shortage of Internet connectivity. The scheme leverages friends-of-friends relationship and transferable trust concept, where each user trusts his friends and the friends of friends. If a friend is not interested in the requested subject, he/she can link him/her to his/her friends without knowing the requested subject to preserve privacy. Our schemes use Bloom filters to store the topics of interest to reduce the storage and communication overhead. This is important because the number of fine-grained topics can be large. Different techniques to store the topics in the filter are proposed and investigated. Performance metrics are proposed and evaluated using real implementations. Our analysis and implementation results demonstrate that our schemes can preserve the privacy of the MSN users with high performance.

In this paper, we propose a trust-based and privacy-preserving fine-grained data retrieval scheme for mobile social networks (MSNs). The scheme enables users to create a log of trusted users who store (or are interested in) some topics related to a subject of interest. A subject is a broad term that can cover many fine-grained topics. In creating logs, we leverage friends-of-friends relationships and transferrable trust concept. Each user trusts its friends and the friends of friends. If a friend is not interested in a subject, he can help his friend in creating the log by linking the friend to his friends without knowing the subject to preserve privacy. In order to reduce the storage and computation overhead, we use Bloom filters to store the topics. A distinctive feature in our scheme is that it can query users who possess a fine-grained topic, rather than querying users who are interested in the broad subject but they may not have the specific topic of interest. We analyze the security and privacy of our scheme and evaluate the communication and computation overhead.