Secure Interdependent Networks for Peer-to-Peer and Online Social Network

Peer-to-peer (P2P) systems and online social network (OSN) both have achieved tremendous success. Recent studies suggest that the cooperation of P2P and OSN can achieve better efficiency and security. Unfortunately, novel security problems are emerging as the mutual cooperation and dependence contributes to forming the interdependent networks which are more vulnerable for malicious attack as well as rumor propagation. In this paper, we examined the security environment for P2P and OSN, respectively, and analyzed the security problem derived from the cooperation and interdependence of two networks. The spreader-ignorant-recaller-stifler (SICR) is leveraged to model the rumor spreading in the interdependent networks. In order to enhance the security, we proposed two security schemes named authentication intervening and splitting target and their performance summaries indicate to be effective, simple, and potentially transformative way to guarantee the security for interdependent networks of P2P and OSN.

[1]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[2]  Yuval Elovici,et al.  Online Social Networks: Threats and Solutions , 2013, IEEE Communications Surveys & Tutorials.

[3]  S. Havlin,et al.  Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. , 2010, Physical review letters.

[4]  Xuemin Shen,et al.  An Efficient Merkle-Tree-Based Authentication Scheme for Smart Grid , 2014, IEEE Systems Journal.

[5]  Akbar Ghaffarpour Rahbar,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[6]  Hans J. Herrmann,et al.  Towards designing robust coupled networks , 2011, Scientific Reports.

[7]  Ke Xu,et al.  Accelerating Peer-to-Peer File Sharing with Social Relations , 2013, IEEE Journal on Selected Areas in Communications.

[8]  Jiajia Wang,et al.  Rumor spreading model on social networks with consideration of remembering mechanism , 2013 .

[9]  Yi Yang,et al.  Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data , 2016, IEEE Transactions on Dependable and Secure Computing.

[10]  Feng Wu,et al.  SocialTrust: Enabling long-term social cooperation in peer-to-peer services , 2013, Peer-to-Peer Networking and Applications.

[11]  Xuemin Shen,et al.  Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage , 2015, IEEE Transactions on Emerging Topics in Computing.

[12]  Xiaohui Liang,et al.  EPPDR: An Efficient Privacy-Preserving Demand Response Scheme with Adaptive Key Evolution in Smart Grid , 2014, IEEE Transactions on Parallel and Distributed Systems.

[13]  Niklas Carlsson,et al.  A peer-to-peer agent community for digital oblivion in online social networks , 2013, 2013 Eleventh Annual Conference on Privacy, Security and Trust.

[14]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[15]  Wanlei Zhou,et al.  OST: A Transaction Based Online Social Trust Model for Social Network and File Sharing Security , 2010, 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[16]  Félix Gómez Mármol,et al.  Security threats scenarios in trust and reputation models for distributed systems , 2009, Comput. Secur..

[17]  Heng Zhang.  Peer to peer technologies in future LTE self-organizing networks , 2012, 2012 Computing, Communications and Applications Conference.