Privacy-preserving data search and sharing protocol for social networks through wireless applications

摘要

Data search and sharing are two important functionalities in social networks. The social network users canrnform a peer-to-peer group and securely and flexibly search and share cloud data through wireless applications.rnWhen the number of users increases, the communication, storage, and computational overheads willrnbe increased, and the quality of services such as searching and data sharing for clients could be affected.rnIn order to solve these problems, we formalize an ID-based multi-user searchable encryption (IDB-MUSE)rnand formally define its security model, where the security notions accommodate indistinguishability againstrninsider’s keyword guessing attack, indistinguishability against chosen keyword attack, and indistinguishabilityrnagainst insider’s identity guessing attack.We present an IDB-MUSE scheme, where the index and searchrntrapdoor are of constant size.We formally prove its security properties. To improve the search efficiency, werndivide the computation of the trapdoor into two phases, that is, the offline phase and the online phase. Therncomputation cost for the online phase trapdoor remains constant with respect to the number of users. Basedrnon the IDB-MUSE scheme, a privacy-preserving data search and sharing protocol is proposed, where onlyrnthe authorized user can access the shared group data. It captures the properties of source authenticity, datarnand search pattern privacy-preserving, anonymity, and request unlinkability. The experimental results showrnthat the protocol is practical for wireless applications.