Socialbots and its implication On ONLINE SOCIAL Networks Md Abdul Alim, Xiang Li and Tianyi Pan Group 18.

Slides:



Advertisements
Similar presentations
An analysis of Social Network-based Sybil defenses Bimal Viswanath § Ansley Post § Krishna Gummadi § Alan Mislove ¶ § MPI-SWS ¶ Northeastern University.
Advertisements

Making Data Mining Models Useful to Model Non-paying Customers of Exchange Carriers Wei Fan, IBM T.J.Watson Janek Mathuria, and Chang-tien Lu Virginia.
Thank you to IT Training at Indiana University Computer Malware.
Detecting Spam Zombies by Monitoring Outgoing Messages Zhenhai Duan Department of Computer Science Florida State University.
DECISION TREES. Decision trees  One possible representation for hypotheses.
Pete Bohman Adam Kunk.  Introduction  Related Work  System Overview  Indexing Scheme  Ranking  Evaluation  Conclusion.
SOCELLBOT: A New Botnet Design to Infect Smartphones via Online Social Networking th IEEE Canadian Conference on Electrical and Computer Engineering(CCECE)
Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang Tian He Yongdae Kim Department of Computer Science, University of Minnesota, Minneapolis.
Qiang Cao Duke University
Fighting Fire With Fire: Crowdsourcing Security Solutions on the Social Web Christo Wilson Northeastern University
Algorithms in Exponential Time. Outline Backtracking Local Search Randomization: Reducing to a Polynomial-Time Case Randomization: Permuting the Evaluation.
PageRank Identifying key users in social networks Student : Ivan Todorović, 3231/2014 Mentor : Prof. Dr Veljko Milutinović.
BotGraph: Large Scale Spamming Botnet Detection Yao Zhao Yinglian Xie *, Fang Yu *, Qifa Ke *, Yuan Yu *, Yan Chen and Eliot Gillum ‡ EECS Department,
Perceptions of Behavioral Advertising among CMU Community Ashwini Rao April 21, 2014.
Ensemble Learning (2), Tree and Forest
SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation Michael Sirivianos Telefonica Research Telefonica Research Joint work with Kyungbaek.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα
Models of Influence in Online Social Networks
School of Electronics Engineering and Computer Science Peking University Beijing, P.R. China Ziqi Wang, Yuwei Tan, Ming Zhang.
B OTNETS T HREATS A ND B OTNETS DETECTION Mona Aldakheel
Emerging Topic Detection on Twitter (Cataldi et al., MDMKDD 2010) Padmini Srinivasan Computer Science Department Department of Management Sciences
Adversarial Information Retrieval The Manipulation of Web Content.
Network and Systems Security By, Vigya Sharma (2011MCS2564) FaisalAlam(2011MCS2608) DETECTING SPAMMERS ON SOCIAL NETWORKS.
Modeling Relationship Strength in Online Social Networks Rongjing Xiang: Purdue University Jennifer Neville: Purdue University Monica Rogati: LinkedIn.
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Eric Horvitz, Michael Mahoney,
FaceTrust: Assessing the Credibility of Online Personas via Social Networks Michael Sirivianos, Kyungbaek Kim and Xiaowei Yang in collaboration with J.W.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
2012 4th International Conference on Cyber Conflict C. Czosseck, R. Ottis, K. Ziolkowski (Eds.) 2012 © NATO CCD COE Publications, Tallinn 朱祐呈.
 Two types of malware propagating through social networks, Cross Site Scripting (XSS) and Koobface worm.  How these two types of malware are propagated.
Man vs. Machine: Adversarial Detection of Malicious Crowdsourcing Workers Gang Wang, Tianyi Wang, Haitao Zheng, Ben Y. Zhao, UC Santa Barbara, Usenix Security.
Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.
Combining multiple learners Usman Roshan. Bagging Randomly sample training data Determine classifier C i on sampled data Goto step 1 and repeat m times.
Leveraging Asset Reputation Systems to Detect and Prevent Fraud and Abuse at LinkedIn Jenelle Bray Staff Data Scientist Strata + Hadoop World New York,
By Gianluca Stringhini, Christopher Kruegel and Giovanni Vigna Presented By Awrad Mohammed Ali 1.
LANGUAGE MODELS FOR RELEVANCE FEEDBACK Lee Won Hee.
Professor Yashar Ganjali Department of Computer Science University of Toronto
Graph-based Text Classification: Learn from Your Neighbors Ralitsa Angelova , Gerhard Weikum : Max Planck Institute for Informatics Stuhlsatzenhausweg.
Finding Top-k Shortest Path Distance Changes in an Evolutionary Network SSTD th August 2011 Manish Gupta UIUC Charu Aggarwal IBM Jiawei Han UIUC.
Computer Science Department, Peking University
Vulnerability in Socially-informed Peer-to-Peer Systems Jeremy Blackburn Nicolas Kourtellis Adriana Iamnitchi University of South Florida.
Graph Algorithms: Classification William Cohen. Outline Last week: – PageRank – one algorithm on graphs edges and nodes in memory nodes in memory nothing.
The Koobface Botnet and the Rise of Social Malware Kurt Thomas David M. Nicol
SybilGuard: Defending Against Sybil Attacks via Social Networks.
Network Community Behavior to Infer Human Activities.
Authors: Yazan Boshmaf, Lldar Muslukhov, Konstantin Beznosov, Matei Ripeanu University of British Columbia Annual Computer Security Applications Conference.
CS 590 Term Project Epidemic model on Facebook
KAIST TS & IS Lab. CS710 Know your Neighbors: Web Spam Detection using the Web Topology SIGIR 2007, Carlos Castillo et al., Yahoo! 이 승 민.
Social Turing Tests: Crowdsourcing Sybil Detection Gang Wang, Manish Mohanlal, Christo Wilson, Xiao Wang Miriam Metzger, Haitao Zheng and Ben Y. Zhao Computer.
Don’t Follow me : Spam Detection in Twitter January 12, 2011 In-seok An SNU Internet Database Lab. Alex Hai Wang The Pensylvania State University International.
Machine Learning Recitation 8 Oct 21, 2009 Oznur Tastan.
Online Social Networks and Media Absorbing random walks Label Propagation Opinion Formation.
Pete Bohman Adam Kunk.  Introduction  Related Work  System Overview  Indexing Scheme  Ranking  Evaluation  Conclusion.
A Connectivity-Based Popularity Prediction Approach for Social Networks Huangmao Quan, Ana Milicic, Slobodan Vucetic, and Jie Wu Department of Computer.
SUPERVISED AND UNSUPERVISED LEARNING Presentation by Ege Saygıner CENG 784.
I NTEGRO : L EVERAGING V ICTIM P REDICTION FOR R OBUST F AKE A CCOUNT D ETECTION IN OSN S Authors Yazan Boshmaf, Dionysios Logothetis, Georgos Siganos,
Tree and Forest Classification and Regression Tree Bagging of trees Boosting trees Random Forest.
Antivirus Software Technology By Mitchell Zell. Intro  Computers are vulnerable to attack  Most common type of attack is Malware  Short for malicious.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Botnets A collection of compromised machines
Uncovering the Mystery of Trust in An Online Social Network
Decision Trees (suggested time: 30 min)
Botnets A collection of compromised machines
Dieudo Mulamba November 2017
iSRD Spam Review Detection with Imbalanced Data Distributions
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
GANG: Detecting Fraudulent Users in OSNs
Graph and Link Mining.
Presentation transcript:

Socialbots and its implication On ONLINE SOCIAL Networks Md Abdul Alim, Xiang Li and Tianyi Pan Group 18

Outline 2  Overview of socialbot  How socialbots spreads dangers  Impacts of socialbots  Infiltration mechanism: a case study  Socialbots Detection

Overview  A socialbot is a piece of software that controls a user account in an online social network and passes itself of as a human being 3

The dangers of socialbots  Harvest private user data  Socialbots can be used to collect organizational data  Online surveillance  Profiling  Data commoditization 4

Contd.  Spread misinformation  OSNs are attractive medium for abusive content and Socialbots take advantage of it  Propagate propaganda  Political astroturfing  Bias public opinion  Influence user perception 5

Contd.  Malware infection  Infect computers and use it for DDoS  Social spamming  Fraudulent activities 6

Impact of socialbots  OSNs are growing source of income for advertisers, investors, developers  Inaccurate representation of actual users in OSNs severely impact the revenue of dependent businesses 7 Up to 15 million (1.2% of monthly active users) are fake [2014 Facebook earning report] Boshmaf et. al (2011) showed that Facebook can be infiltrated by socialbots sending friend requests. Average reported acceptance rate: 35.7% up to 80% depending on how many mutual friends the social bots had with the infiltrated users

Impact of socialbots (contd.) 8

Socialbots: a case study  Elyashar et al. (2013) performed a social study for infiltrating specific users in targeted organizations using socialbots  Technology oriented organizations were chosen to emphasize the vulnerability of users in OSNs  Employees of these organization should be more aware of the dangers of exposing private information  An infiltration is defined as accepting a Socialbot's friend request. Upon accepting a Socialbot's friend request, users unknowingly expose information about themselves and their workplace which leads to security compromise 9

Socialbot: infiltration mechanism  OSN: Facebook  Target Organization: 3 [selected by the authors, not disclosed]  Targeted users: 10  Socialbot: one socialbot per organization  Idea is to send friend requests to all specific users' mutual friends who worked or work in the same targeted organization. The rationale behind this idea was to gain as many mutual friends as possible and through this act increase the probability that our friend requests will be accepted by the targeted users. 10

Steps: infiltration mechanism 1.Step1: crawl on targeted organizations to gather public information regarding its employees who have a Facebook user account and declared that they work or worked in the targeted organizations 2.Step2: Choose 10 users randomly to be a target for infiltration 3.Step3: Increase credibility of the socialbot: Send friend request to random users each of them having more than 1000 friend regardless of organization. 4.Step4: After socialbot has 50 friends, send friend request to targeted users’ mutual friends 11

Algorithm: infiltration mechanism 12

Result of the study 13  Socialbot 1 in Organization 1 succeeded to accumulate 50% of the targeted users  Socialbot 2 in Organization 2 succeeded to accumulate 70% of the targeted users  Results for two organization How to detect the socialbots?

14 Socialbot Detection

Existing Detection Methods  Feature-based detection 15

Feature-based Detection 16  Relies on user-level activities and its account details  Uses machine learning techniques to classify accounts (fake or real)  For the attacker: relatively easy to circumvent  Mimic real users!  Only 20% of fake accounts are detected by this method. (Boshmaf et. al 2011)

Existing Detection Methods  Feature-based detection  Graph-based detection 17

Graph-based Detection 18  Rank nodes based on landing probability of short random walks, started from trusted nodes.

Graph-based Detection 19  Perform cut based on node ranking

Graph-based Detection  Assumption: social infiltration on a large scale is infeasible 20 Not always true! (Pic from Boshmaf et. al 2011)

Graph-based Detection 21

Solution: Integro (Boshmaf et. al 2015 )  Find potential victims  Machine learning method (random forests)  Assign each node a probability of being a victim  Create weighted graph & choose trusted nodes  Decide edge weights based on their incident nodes’ victim probability  The higher the probability, the lower the weight  Community based trusted nodes selection  Rank nodes based on short random walks in the weighted graph 22

Integro 23

Integro 24

Integro 25

Find Potential Victims  Random Forest Learning method  Decision tree based learning  Separate the dataset to subsets and use a decision tree for each dataset  Cross-validation method  Chop the dataset into 10 equally sized sets  RF method on 9 sets  Use the remaining one for testing 26

Create Weighted Graph & Choose Trusted Nodes  Assign weight based on victim probability  Choose trusted nodes  Detect communities by the Louvain method  Randomly pick a small set of nodes from each community  Manual verification of the selected nodes 27

Rank Nodes Based on Short Random Walks 28

Experiments  Datasets  Labeled feature vectors (for learning)  8.8K public Facebook profiles (32% victims)  60K full Tuenti profiles (50% victims)  Graph samples (for detection)  Snapshot of Tuenti’s daily active user graph on Feb

Feature Vector 30

Experiment Results  Precision (In Tuenti) 31

Experiment Results  Scalability (In small-world graphs) 32 RFRanking

What else can be done?  Stop fake accounts at the time they are created?  Fake accounts send random friend requests at the time they are created  It is abnormal when the friends of a real person all belong to different communities  Methods other than random walk to cut the graph?  Current random walk method is limited to undirected graphs 33

34 Questions?

35 Thank you!