publication . Preprint . Conference object . 2017

Stateless Puzzles for Real Time Online Fraud Preemption

Mizanur Rahman; Ruben Recabarren; Bogdan Carbunar; Dongwon Lee;
Open Access English
  • Published: 05 Jun 2017
Abstract
The profitability of fraud in online systems such as app markets and social networks marks the failure of existing defense mechanisms. In this paper, we propose FraudSys, a real-time fraud preemption approach that imposes Bitcoin-inspired computational puzzles on the devices that post online system activities, such as reviews and likes. We introduce and leverage several novel concepts that include (i) stateless, verifiable computational puzzles, that impose minimal performance overhead, but enable the efficient verification of their authenticity, (ii) a real-time, graph based solution to assign fraud scores to user activities, and (iii) mechanisms to dynamically...
Subjects
free text keywords: Computer Science - Social and Information Networks, Computer Science - Cryptography and Security, Computer science, Social network, business.industry, business, Stateless protocol, Preemption, Internet privacy, Profitability index, Verifiable secret sharing, Graph, Computer security, computer.software_genre, computer, Click fraud, Leverage (finance)
Funded by
NSF| TWC: Small: Collaborative: Cracking Down Online Deception Ecosystems
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1527153
,
NSF| Building a Big Data Analytics Workforce in iSchools
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1525601
,
NSF| SBE TWC: Small: Collaborative: Privacy Protection in Social Networks: Bridging the Gap Between User Perception and Privacy Enforcement
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1422215
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computer and Network Systems
,
NSF| EAGER: Digital Interventions for Reducing Social Networking Risks in Adolescents
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1450619
  • Funding stream: Directorate for Social, Behavioral & Economic Sciences | Division of Social and Economic Sciences
26 references, page 1 of 2

25000 50−60 3 4 www.youtube.com/watch?v=5Od2SuL2igA, 2013.

[2] L. Akoglu, H. Tong, and D. Koutra. Graph based anomaly detection and description: a survey. Data Mining and Knowledge Discovery, 29(3):626-688, 2015.

[3] M. Anderson and J. Magruder. Learning from the crowd: Regression discontinuity estimates of the e ects of an online review database. Economic Journal, 122(563), 2012.

[4] AppReviews. http://www.app-reviews.org, 2016.

[5] AppSuch. http://www.appsuch.com, 2016.

[6] AppsViral. http://www.appsviral.com/, 2016.

[7] Apptamin. Optimize Your Google Play Store App Details Page. http://www.apptamin.com/blog/optimize-play-store-app/, 2016.

[8] P. R. Badri Satya, K. Lee, D. Lee, T. Tran, and J. J. Zhang. Uncovering fake likers in online social networks. In Proceedings of the ACM CIKM, 2016.

[9] M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Proceedings of CRYPTO, 1996. [OpenAIRE]

[10] D. J. Bernstein. Syn cookies, 1996.

[11] N. Borisov. Computational puzzles as sybil defenses. In Proceedings of the IEEE P2P, 2006.

[12] C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In Proceedings of CRYPTO, 1992.

[13] S. Fortunato and D. Hric. Community detection in networks: A user guide. arXiv:1608.00163, 2016. [OpenAIRE]

[14] B. Hooi, H. A. Song, A. Beutel, N. Shah, K. Shin, and C. Faloutsos. Fraudar: Bounding graph fraud in the face of camou age. In Proceedings of ACM KDD, 2016. [OpenAIRE]

[15] A. Juels and J. Brainard. Client puzzles: A cryptographic counter-measure against connection depletion attacks. In Proceedings of ISOC NDSS, 1999.

26 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue