z-logo
open-access-imgOpen Access
ReDD: recommendation‐based data dissemination in privacy‐preserving mobile social networks
Author(s) -
Chen Le,
Lu Rongxing,
AlHarbi Khalid,
Lin Xiaodong,
Cao Zhenfu
Publication year - 2014
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.1082
Subject(s) - computer science , dissemination , computer security , network packet , authentication (law) , internet privacy , computer network , protocol (science) , social network (sociolinguistics) , confidentiality , quality (philosophy) , mobile phone , world wide web , social media , telecommunications , medicine , philosophy , alternative medicine , epistemology , pathology
Mobile social network (MSN), which is built upon popular smart phone devices and enables mobile users with similar interests to connect with one another, has received considerable attention in recent years. A common phenomenon that makes the MSN vivid today is mobile users often like to share attractive things to their friends in MSN. In this paper, based on this common phenomenon, we propose an efficient recommendation‐based data dissemination (ReDD) protocol for MSN, which can efficiently disseminate high‐quality messages in a privacy‐preserving way. Specifically, in the proposed ReDD protocol, each mobile user, based on both his or her own view and his or her friends' recommendations, will form his or her personal estimation on the quality of a message. Only if the estimation of quality reaches a threshold, the message will be disseminated. In this way, high‐quality messages can be widely spread in the network and occupy more network resources than low‐quality ones. In order to check the validity of friends' recommendations, ReDD also employs an efficient anonymous authentication technique, which ensures that only the friends of a user can verify recommendations made by the user. Detailed security analysis demonstrates that ReDD can effectively resist various attacks launched by attackers and ensure identity privacy of nodes, confidentiality of shared keys and integrity of data packets. In addition, extensive simulations are also conducted to evaluate the performance of ReDD in terms of the number of active nodes and the average active time, and the simulation results show that high‐quality messages can be disseminated widely and efficiently, while low‐quality ones will be eliminated shortly to avoid occupying network resources. Copyright © 2014 John Wiley & Sons, Ltd.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here