HMM Based Cache Pollution Attack Detection for Edge Computing Enabled Mobile Social Networks

2019 ◽  
Author(s):  
Qichao Xu ◽  
Zhou Su ◽  
Kuan Zhang
Keyword(s):  
Social Networks ◽  
Attack Detection ◽  
Edge Computing ◽  
Mobile Social Networks ◽  
Pollution Attack ◽  
Cache Pollution

scholarly journals A Fuzzy Collusive Attack Detection Mechanism for Reputation Aggregation in Mobile Social Networks: A Trust Relationship Based Perspective

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Bo Zhang ◽  
Qianqian Song ◽  
Tao Yang ◽  
Zhonghua Zheng ◽  
Huan Zhang
Keyword(s):  
Social Networks ◽  
Social Relationships ◽  
Attack Detection ◽  
Mobile Social Networks ◽  
Malicious Nodes ◽  
Detection Mechanism ◽  
Factor Node ◽  
Similar Factor ◽  
Collusive Attacks ◽  
Collusive Attack

While the mechanism of reputation aggregation proves to be an effective scheme for indicating an individual’s trustworthiness and further identifying malicious ones in mobile social networks, it is vulnerable to collusive attacks from malicious nodes of collaborative frauds. To conquer the challenge of detecting collusive attacks and then identifying colluders for the reputation system in mobile social networks, a fuzzy collusive attack detection mechanism (FCADM) is proposed based on nodes’ social relationships, which comprises three parts: trust schedule, malicious node selection, and detection traversing strategy. In the first part, the trust schedule provides the calculation method of interval valued fuzzy social relationships and reputation aggregation for nodes in mobile social networks; further, a set of fuzzy valued factors, that is, item judgment factor, node malicious factor, and node similar factor, is given for evaluating the probability of collusive fraud happening and identifying single malicious nodes in the second part; and moreover, a detection traversing strategy is given based on random walk algorithm under the perspectives of fuzzy valued nodes’ trust schedules and proposed malicious factors. Finally, our empirical results and analysis show that the proposed mechanism in this paper is feasible and effective.

Cooperative Contents Distribution in Mobile Social Networks

2014 ◽  
Vol 36 (3) ◽  
pp. 613-625 ◽  
Author(s):  
Hai-Yang HU ◽  
Zhong-Jin LI ◽  
Hua HU ◽  
Ge-Hua ZHAO
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

A Framework for Protecting Privacy on Mobile Social Networks

2021 ◽  
Author(s):  
Seyyed Mohammad Safi ◽  
Ali Movaghar ◽  
Komeil Safikhani Mahmoodzadeh
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

scholarly journals Privacy-Enhancing k-Nearest Neighbors Search over Mobile Social Networks

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 3994
Author(s):  
Yuxi Li ◽  
Fucai Zhou ◽  
Yue Ge ◽  
Zifeng Xu
Keyword(s):  
Social Networks ◽  
Access Control ◽  
Location Privacy ◽  
Nearest Neighbors ◽  
Search Pattern ◽  
Broadcast Encryption ◽  
Mobile Social Networks ◽  
K Nearest Neighbors ◽  
Fine Grained ◽  
Server Architecture

Focusing on the diversified demands of location privacy in mobile social networks (MSNs), we propose a privacy-enhancing k-nearest neighbors search scheme over MSNs. First, we construct a dual-server architecture that incorporates location privacy and fine-grained access control. Under the above architecture, we design a lightweight location encryption algorithm to achieve a minimal cost to the user. We also propose a location re-encryption protocol and an encrypted location search protocol based on secure multi-party computation and homomorphic encryption mechanism, which achieve accurate and secure k-nearest friends retrieval. Moreover, to satisfy fine-grained access control requirements, we propose a dynamic friends management mechanism based on public-key broadcast encryption. It enables users to grant/revoke others’ search right without updating their friends’ keys, realizing constant-time authentication. Security analysis shows that the proposed scheme satisfies adaptive L-semantic security and revocation security under a random oracle model. In terms of performance, compared with the related works with single server architecture, the proposed scheme reduces the leakage of the location information, search pattern and the user–server communication cost. Our results show that a decentralized and end-to-end encrypted k-nearest neighbors search over MSNs is not only possible in theory, but also feasible in real-world MSNs collaboration deployment with resource-constrained mobile devices and highly iterative location update demands.

Sign in / Sign up

Export Citation Format

Share Document