Detectives: Detecting coalition hit inflation attacks in advertising networks streams

16th International World Wide Web Conference, WWW2007

Volumn , Issue , 2007, Pages 241-250

  Metwally, Ahmed ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

Approximate set similarity; Click spam detection; Cliques enumeration; Coalition fraud attacks; Real data experiments; Similarity sensitive sampling

Indexed keywords

APPROXIMATE SET SIMILARITY; CLICK SPAM DETECTION; CLIQUES ENUMERATION; COALITION FRAUD ATTACKS; REAL DATA EXPERIMENTS; SIMILARITY-SENSITIVE SAMPLING;

ELECTRONIC COMMERCE; ELECTRONIC PUBLISHING; MARKETING; MATHEMATICAL MODELS; SET THEORY;

COMPUTER NETWORKS;

EID: 35348835502     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242606     Document Type: Conference Paper

References (47)

1. J. Abello, M. Resende, and S. Sudarsky. Massive Quasi-Clique Detection. In Proceedings of the 5th LATIN Latin American Symposium on Theoretical Informatics, pages 598-612, 2002.
2. E. Akkoyunlu. The Enumeration of Maximal Cliques of Large Graphs. SIAM Journal on Computing, 2(1):1-6, 1973.
3. V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. Reiter. On the Security of Pay-Per-Click and Other Web Advertising Schemes. In Proceedings of the 8th WWW International Conference on World Wide Web, pages 1091-1100, 1999.
4. Burton H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422-426, 1970.
5. C. Blundo and S. Cimato. SAWM: A Tool for Secure and Authenticated Web Metering. In Proceedings of the 14th A CM SEKE International Conference on Software Engineering and Knowledge Engineering, pages 641-648, 2002.
6. T. Bohman, C. Cooper, and A. Frieze. Min-Wise Independent Linear Permutations. Electronic Journal of Combinatorics, 7:R26, 2000.
7. A. Bowker and G. Lieberman. Engineering Statistics, 2nd Edition. Prentice Hall, 1972.
8. U. Brandes, M. Gaertler, and D. Wagner. Experiments on Graph Clustering Algorithms. In Proceedings of the 11th ESA European Symposium on Algorithms, pages 568-579, 2003.
9. A. Broder. On the Resemblance and Containment of Documents. In Proceedings of the IEEE SEQ UENCES Compression and Complexity of Sequences, pages 21-29, 1997.
10. A. Broder. Identifying and Filtering Near-Duplicate Documents. In Proceedings of the 11th COM Symposium on Combinatorial Pattern Matching, pages 1-10, 2000.
11. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-Wise Independent Permutations (Extended Abstract). In Proceedings of the 30th ACM STOC Symposium on Theory Of Computing, pages 327-336, 1998.
12. A. Broder and U. Feige. Min-Wise versus Linear Independence (Extended Abstract). In Proceedings of the 11th ACM-SIAM SODA Symposium on Discrete Algorithms, pages 147-154, 2000.
13. A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proceedings of the 6th WWW International Conference on World Wide Web, pages 391-404, 1997.
14. C. Bron and J. Kerbosch. Algorithm 457: Finding All Cliques of an Undirected Graph. Communications of the ACM, 16(9):575-577, 1973.
15. CERT Coordination Center. CERT Advisory CA-1996-21 TCP SYN Flooding and IP Spoofing Attacks. http://www.cert.org/advisories/CA-1996-21.html, September 19 1996.
16. Moses S. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of the 34th ACM STOC Symposium on Theory Of Computing, pages 380-388, 2002.
17. S. Chaudhuri, R. Motwani, and V. Narasayya. On Random Sampling over Joins. In Proceedings of the 18th ACM SIGMOD International Conference on Management of Data, pages 263-274, 1999.
18. D. Cheng, S. Vempala, R. Kannan, and G. Wang. A Divide-and-Merge Methodology for Clustering. In Proceedings of the 24th ACM PODS Symposium on Principles of Database Systems, pages 196-205, 2005.
19. N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14(1):210-223, 1985.
20. L. Gerhards and W. Lindenberg. Clique Detection for Nondirected Graphs: Two New Algorithms. Computing, Volume 21(4):295-322, 1979.
21. D. Gibson, R. Kumar, and A. Tomkins. Discovering Large Dense Subgraphs in Massive Graphs. In Proceedings of the 31st VLDB International Conference on Very Large Data Bases, pages 721-732, 2005.
22. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and Congestion in Power Law Graphs. In Proceedings of the 22nd A CM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 148-159, 2003.
23. K. Holzapfel, S. Kosub, M. Maaß, and H. Täubig. The Complexity of Detecting Fixed-Density Clusters. In Proceedings of the 5th CIA C Italian Conference on Algorithms and Complexity, pages 201-212, 2003.
24. P. Indyk. A small Approximately Min-Wise Independent Family of Hash Functions. In Proceedings of the 10th ACM-SIAM SODA Symposium On Discrete Algorithms, pages 454-456, 1999.
25. M. Jakobsson, P. MacKenzie, and J. Stern. Secure and Lightweight Advertising on the Web. In Proceedings of the 8th WWW International Conference on World Wide Web, pages 1101-1109, 1999.
26. H. Johnston. Cliques of a Graph-Variations on the Bron-Kerbosch Algorithm. International Journal of Computer and Information Sciences, 5(3):209-238, 1976.
27. R. Kannan, S. Vempala, and A. Veta. On Clusterings: Good, Bad and Spectral. In Proceedings of the 41st IEEE FOCS Annual Symposium on Foundations of Computer Science, pages 367-377, 2000.
28. D. Klein. Defending Against the Wily Surfer-Web-based Attacks and Defenses. In Proceedings of the 1st USENIX ID Workshop on Intrusion Detection and Network Monitoring, pages 81-92, 1999.
29. M. Liedtke. Google to Pay $90M in 'Click Fraud' Case. Washington Post Magazine, March 9 2006.
30. M. Liedtke. Yahoo Settles 'Click Fraud' Lawsuit. MSNBC News, June 28 2006.
31. E. Loukakis. A New Backtracking Algorithm for Generating the Family of Maximal Independent Sets of a Graph. Computers & Mathematics with Applications, 9(4):583-589, 1983.
32. C. Mann. How Click Fraud Could Swallow the Internet. Wired Magazine, January 2006.
33. R. McGann. Study: Consumers Delete Cookies at Surprising Rate. ClickZ News, March 14 2005.
34. A. Metwally, D. Agrawal, and A. El Abbadi. Duplicate Detection in Click Streams. In Proceedings of the 14th WWW International World Wide Web Conference, pages 12-21, 2005.
35. A. Metwally, D. Agrawal, and A. El Abbadi. Using Association Rules for Fraud Detection in Web Advertising Networks. In Proceedings of the 31st VLDB International Conference on Very Large Data Bases, pages 169-180, 2005.
36. A. Metwally, D. Agrawal, and A. El Abbadi. Hide and Seek: Detecting Hit Inflation Fraud in Streams of Web Advertising Networks. Technical Report 2006-06, University of California, Santa Barbara, Department of Computer Science, 2006.
37. J. Moon and L. Moser. On cliques in graphs. Israel journal of Mathematics, 3:23-28, 1965.
38. M. Naor and B. Pinkas. Secure and Efficient Metering. In Proceedings EUROCRYPT International Conference on the Theory and Application of Cryptographic Techniques, pages 576-590, 1998.
39. S. Olsen. Click Fraud Roils Search Advertisers. CNET News, March 4 2005.
40. M. Reiter, V. Anupam, and A. Mayer. Detecting Hit-Shaving in Click-Through Payment Schemes. In Proceedings of the 3rd USENIX Workshop on Electronic Commerce, pages 155-166, 1998.
41. R. Shamir, R. Sharan, and D. Tsur. Cluster Graph Modification Problems. Discrete Applied Mathematics, 144(1-2):173-182, 2004.
42. J. Sima and S. Schaeffer. On the NP-Completeness of Some Graph Cluster Measures. In Proceedings of the 32nd SOFSEM Conference on Current Trends in Theory and Practice of Informatics, pages 530-537, 2006.
43. E. Tomita, A. Tanaka, and H. Takahashi. The Worst-Case Time Complexity for Generating All Maximal Cliques. In Proceedings of the 10th COCOON Annual International Conference on Computing and Combinatorics, pages 161-170, 2004.
44. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A New Algorithm for Generating All the Maximal Independent Sets. SIAM Journal on Computing, 6(3):505-517, 1977.
45. D. Vise. Clicking To Steal. Washington Post Magazine, page F01, April 17 2005.
46. J. Vitter. External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys, 33(2):209-271, 2001.
47. T. Zeller Jr. With Each Technology Advance, a Scourge. The New York Times, October 18 2004.