3 research outputs found
Attacking Strategies and Temporal Analysis Involving Facebook Discussion Groups
Online social network (OSN) discussion groups are exerting significant
effects on political dialogue. In the absence of access control mechanisms, any
user can contribute to any OSN thread. Individuals can exploit this
characteristic to execute targeted attacks, which increases the potential for
subsequent malicious behaviors such as phishing and malware distribution. These
kinds of actions will also disrupt bridges among the media, politicians, and
their constituencies.
For the concern of Security Management, blending malicious cyberattacks with
online social interactions has introduced a brand new challenge. In this paper
we describe our proposal for a novel approach to studying and understanding the
strategies that attackers use to spread malicious URLs across Facebook
discussion groups. We define and analyze problems tied to predicting the
potential for attacks focused on threads created by news media organizations.
We use a mix of macro static features and the micro dynamic evolution of posts
and threads to identify likely targets with greater than 90% accuracy. One of
our secondary goals is to make such predictions within a short (10 minute) time
frame. It is our hope that the data and analyses presented in this paper will
support a better understanding of attacker strategies and footprints, thereby
developing new system management methodologies in handing cyber attacks on
social networks.Comment: 9 page
Globalness Detection in Online Social Network
Classification problems have made significant progress due to the maturity of
artificial intelligence (AI). However, differentiating items from categories
without noticeable boundaries is still a huge challenge for machines -- which
is also crucial for machines to be intelligent.
In order to study the fuzzy concept on classification, we define and propose
a globalness detection with the four-stage operational flow. We then
demonstrate our framework on Facebook public pages inter-like graph with their
geo-location. Our prediction algorithm achieves high precision (89%) and recall
(88%) of local pages. We evaluate the results on both states and countries
level, finding that the global node ratios are relatively high in those states
(NY, CA) having large and international cities. Several global nodes examples
have also been shown and studied in this paper.
It is our hope that our results unveil the perfect value from every
classification problem and provide a better understanding of global and local
nodes in Online Social Networks (OSNs).Comment: 6 pages, to be appeared in IEEE International Conference on Semantic
Computing (ICSC2019
More or Less? Predict the Social Influence of Malicious URLs on Social Media
Users of Online Social Networks (OSNs) interact with each other more than
ever. In the context of a public discussion group, people receive, read, and
write comments in response to articles and postings. In the absence of access
control mechanisms, OSNs are a great environment for attackers to influence
others, from spreading phishing URLs, to posting fake news. Moreover, OSN user
behavior can be predicted by social science concepts which include conformity
and the bandwagon effect. In this paper, we show how social recommendation
systems affect the occurrence of malicious URLs on Facebook. We exploit
temporal features to build a prediction framework, having greater than 75%
accuracy, to predict whether the following group users' behavior will increase
or not. Included in this work, we demarcate classes of URLs, including those
malicious URLs classified as creating critical damage, as well as those of a
lesser nature which only inflict light damage such as aggressive commercial
advertisements and spam content. It is our hope that the data and analyses in
this paper provide a better understanding of OSN user reactions to different
categories of malicious URLs, thereby providing a way to mitigate the influence
of these malicious URL attacks.Comment: 10 pages, 6 figure