Centrality prediction based on K-order Markov chain in Mobile Social Networks

2019 ◽  
Vol 12 (6) ◽  
pp. 1662-1672 ◽  
Author(s):  
Mengni Ruan ◽  
Xin Chen ◽  
Huan Zhou
Keyword(s):  
Social Networks ◽  
Markov Chain ◽  
Mobile Social Networks ◽  
Order Markov Chain

Community-based diffusion scheme using Markov chain and spectral clustering for mobile social networks

2017 ◽  
Vol 25 (2) ◽  
pp. 875-887 ◽  
Author(s):  
Jegwang Ryu ◽  
Jiho Park ◽  
Junyeop Lee ◽  
Sung-Bong Yang
Keyword(s):  
Social Networks ◽  
Markov Chain ◽  
Spectral Clustering ◽  
Mobile Social Networks ◽  
Community Based ◽  
Diffusion Scheme

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

Parallel first-order Markov chain for on-line anomaly detection in traffic video surveillance

2006 ◽  
Author(s):  
F. Archetti ◽  
C.E. Manfredotti ◽  
M. Matteuci ◽  
V. Messina ◽  
D.G. Sorrenti
Keyword(s):  
Markov Chain ◽  
Anomaly Detection ◽  
Video Surveillance ◽  
First Order ◽  
Order Markov Chain ◽  
On Line ◽  
Traffic Video

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.

scholarly journals Preserving Secrecy in Mobile Social Networks

2020 ◽  
Vol 5 (1) ◽  
pp. 1-29 ◽  
Author(s):  
Gabriela Suntaxi ◽  
Aboubakr Achraf El Ghazi ◽  
Klemens Böhm
Keyword(s):  
Social Networks ◽  
Mobile Social Networks

Morality-Driven Data Forwarding With Privacy Preservation in Mobile Social Networks

2012 ◽  
Vol 61 (7) ◽  
pp. 3209-3222 ◽  
Author(s):  
Xiaohui Liang ◽  
Xu Li ◽  
Tom H. Luan ◽  
Rongxing Lu ◽  
Xiaodong Lin ◽  
...  
Keyword(s):  
Social Networks ◽  
Privacy Preservation ◽  
Mobile Social Networks ◽  
Data Forwarding
Sign in / Sign up

Export Citation Format

Share Document