Combating Friend Spam Using Social Rejections

@article{Cao2015CombatingFS,
  title={Combating Friend Spam Using Social Rejections},
  author={Qiang Cao and Michael Sirivianos and Xiaowei Yang and Kamesh Munagala},
  journal={2015 IEEE 35th International Conference on Distributed Computing Systems},
  year={2015},
  pages={235-244}
}
Unwanted friend requests in online social networks (OSNs), also known as friend spam, are among the most evasive malicious activities. Friend spam can result in OSN links that do not correspond to social relationship among users, thus pollute the underlying social graph upon which core OSN functionalities are built, including social search engine, ad targeting, and OSN defense systems. To effectively detect the fake accounts that act as friend spammers, we propose a system called Rejecto. It… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Sybil Detection in Social-Activity Networks: Modeling, Algorithms and Evaluations

2018 IEEE 26th International Conference on Network Protocols (ICNP) • 2018

GeoPal: Friend Spam Detection in Social Networks Using Private Location Proofs

2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON) • 2016
View 2 Excerpts

Reputation based technique to distinguish posts in Facebook social network

2016 5th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO) • 2016
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Uncovering social network Sybils in the wild

TKDD • 2014
View 5 Excerpts
Highly Influenced

VoteTrust: Leveraging Friend Invitation Graph to Defend against Social Network Sybils

IEEE Transactions on Dependable and Secure Computing • 2013
View 20 Excerpts
Highly Influenced

An Efficient Heuristic Procedure for Partitioning Graphs

B. Kernighan, S. Lin
The Bell System Technical Journal, 49 • 1970
View 4 Excerpts
Highly Influenced

Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs

2010 IEEE 51st Annual Symposium on Foundations of Computer Science • 2010
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…