Detecting and characterizing social spam campaigns
The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Abstract
Online social networks (OSNs) are popular collaboration and communication tools for millions of users and their friends. Unfortunately, in the wrong hands, they are also effective tools for executing spam campaigns and spreading malware. Intuitively, a user is more likely to respond to a message from a Facebook friend than from a stranger, thus making social spam a more effective distribution mechanism than traditional email. In fact, existing evidence shows malicious entities are already attempting to compromise OSN account credentials to support these "high-return" spam campaigns. In this paper, we present an initial study to quantify and characterize spam campaigns launched using accounts on online social networks. We study a large anonymized dataset of asynchronous "wall" messages between Facebook users. We analyze all wall messages received by roughly 3.5 million Facebook users (more than 187 million messages in all), and use a set of automated techniques to detect and characterize coordinated spam campaigns. Our system detected roughly 200,000 malicious wall posts with embed- ded URLs, originating from more than 57,000 user accounts. We find that more than 70% of all malicious wall posts advertise phishing sites. We also study the characteristics of malicious accounts, and see that more than 97% are compromised accounts, rather than "fake" accounts created solely for the purpose of spamming. Finally, we observe that, when adjusted to the local time of the sender, spamming dominates actual wall post activity in the early morning hours, when normal users are asleep.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051 · cited 1×
“They confirm that OSNs obey approximately power-law scaling characteristics [16], and are small-world networks [12].”
BackgroundJagatic, T. N., Johnson, N. A., Jakobsson, M., & Menczer, F. (2007) · Communications of the ACM · doi:10.1145/1290958.1290968 · Cited by 1,156
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
Analysis of topological characteristics of huge online social networking services
Ahn, Y.-Y., Han, S., Kwak, H., Moon, S., & Jeong, H. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242685 · Cited by 937
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879 · cited 3×
“The broadness of benign accounts reflects how broadly each user actually interacts with its friends on Facebook, and the results match prior work from [41] that most users interact with a small portion of their friends.”
BackgroundSelf-citationCharacterizing user behavior in online social networks
Benevenuto, F., Rodrigues, T., Cha, M., & Almeida, V. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644900 · Cited by 795
Persona: an online social network with user-defined privacy
Baden, R., Bender, A., Spring, N., Bhattacharjee, B., & Starin, D. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592585 · Cited by 493
Cited by
Design and Evaluation of a Real-Time URL Spam Filtering Service
Thomas, K., Grier, C., Ma, J., Paxson, V., & Song, D. (2011) · 2011 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2011.25 · Cited by 468
Suspended accounts in retrospect: an analysis of twitter spam
Thomas, K., Grier, C., Song, D., & Paxson, V. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068840 · Cited by 439
Yang, C., Harkreader, R., Zhang, J., Shin, S., & Gu, G. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187847 · Cited by 299
Uncovering social network Sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556609 · Cited by 290
Self-citationFakeDetector: Effective Fake News Detection with Deep Diffusive Neural Network
Zhang, J., Dong, B., & Yu, P. S. (2020) · 2020 IEEE 36th International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00180 · Cited by 276
Die Free or Live Hard? Empirical Evaluation and New Design for Fighting Evolving Twitter Spammers
Yang, C., Harkreader, R. C., & Gu, G. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23644-0_17 · Cited by 235
A generic statistical approach for spam detection in Online Social Networks
Ahmed, F., & Abulaish, M. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.04.004 · Cited by 199
Serf and turf: crowdturfing for fun and profit
Wang, G., Wilson, C., Zhao, X., Zhu, Y., Mohanlal, M., Zheng, H., & Zhao, B. Y. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187928 · Cited by 197
Self-citationAutomating fake news detection system using multi-level voting model
Kaur, S., Kumar, P., & Kumaraguru, P. (2020) · Soft Computing · doi:10.1007/s00500-019-04436-y · Cited by 190
(2017) · doi:10.1145/3133956.3134067 · Cited by 187
Follow the green: growth and dynamics in twitter follower markets
Stringhini, G., Wang, G., Egele, M., Kruegel, C., Vigna, G., Zheng, H., & Zhao, B. Y. (2013) · Proceedings of the 2013 conference on Internet measurement conference · doi:10.1145/2504730.2504731 · Cited by 169
Self-citationUncovering social network sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068841 · Cited by 164
Self-citation(2012) · doi:10.1109/ecrime.2012.6489521 · Cited by 148
Detection of malicious social bots: A survey and a refined taxonomy
Latah, M. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113383 · Cited by 94
Paying for Likes?: Understanding Facebook Like Fraud Using Honeypots
De Cristofaro, E., Friedman, A., Jourjon, G., Kaafar, M. A., & Shafiq, M. Z. (2014) · Proceedings of the 2014 Conference on Internet Measurement Conference · doi:10.1145/2663716.2663729 · Cited by 88
LOBO: Evaluation of Generalization Deficiencies in Twitter Bot Classifiers
Echeverra, J., De Cristofaro, E., Kourtellis, N., Leontiadis, I., Stringhini, G., & Zhou, S. (2018) · Proceedings of the 34th Annual Computer Security Applications Conference · doi:10.1145/3274694.3274738 · Cited by 61
“[20] analyze spam campaigns on Facebook.”
Smoke Screener or Straight Shooter: Detecting Elite Sybil Attacks in User-Review Social Networks
Zheng, H., Xue, M., Lu, H., Hao, S., Zhu, H., Liang, X., & Ross, K. (2018) · Proceedings 2018 Network and Distributed System Security Symposium · doi:10.14722/ndss.2018.23009 · Cited by 61
Worth its Weight in Likes: Towards Detecting Fake Likes on Instagram
Sen, I., Aggarwal, A., Mian, S., Singh, S., Kumaraguru, P., & Datta, A. (2018) · Proceedings of the 10th ACM Conference on Web Science · doi:10.1145/3201064.3201105 · Cited by 52
Quit Playing Games with My Heart: Understanding Online Dating Scams
Huang, J., Stringhini, G., & Yong, P. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-20550-2_12 · Cited by 48
Measuring, Characterizing, and Detecting Facebook Like Farms
Ikram, M., Onwuzurike, L., Farooqi, S., Cristofaro, E. D., Friedman, A., Jourjon, G., Kaafar, M. A., & Shafiq, M. Z. (2017) · ACM Transactions on Privacy and Security · doi:10.1145/3121134 · Cited by 27
A socialbots analysis-driven graph-based approach for identifying coordinated campaigns in twitter
Fazil, M., & Abulaish, M. (2020) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-182895 · Cited by 14
(2015)
Metadata
- Authors
- Gao, H., Hu, J., Wilson, C., Li, Z., Chen, Y., & Zhao, B. Y.
- Venue
- Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
- Publisher
- ACM
- Published
- 2010-11
- Pages
- 35-47
- OpenAlex
- W1965586806
- Cited by
- 385
- References
- 29
- FWCI
- 18.89
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.