Measuring, fingerprinting and catching click-spam in ad networks
| dc.contributor.advisor | Zhang, Yin, doctor of computer science | |
| dc.creator | Dave, Vacha Rajendra | en |
| dc.date.accessioned | 2014-07-11T19:39:55Z | en |
| dc.date.issued | 2013-05 | en |
| dc.date.submitted | May 2013 | en |
| dc.date.updated | 2014-07-11T19:39:56Z | en |
| dc.description | text | en |
| dc.description.abstract | Advertising plays a vital role in supporting free websites and smart- phone apps. Click-spam, i.e., fraudulent or invalid clicks on online ads where the user has no actual interest in the advertiser's site, results in advertising revenue being misappropriated by Click-spammers. This revenue also funds malware authors through adware and malware crafted specifically for click-spammers. While some ad networks take active measures to block Click-spam today, the effectiveness of these measures is largely unknown, as they practice security-through-obscurity for fear of malicious parties reverse-engineering their systems. Moreover, advertisers and third parties have no way of independently estimating or defending against Click-spam. This work addresses the click-spam problem in three ways. It proposes the first methodology for advertisers to independently measure Click-spam rates on their ads. Using real world data collected from ten ad networks, it validates the method to identify and perform in-depth analysis on seven ongoing Click-spam attacks not currently caught by major ad networks, high- lighting the severity of Click-spam. Next, it exposes the state of Click-spam defenses by identifying twenty attack signatures that mimic Click-spam attacks in the wild (from Botnets, PTC sites, scripts) that can be easily detected by ad networks, and implements these attacks, and shows that none of the ad networks protect against all the attacks. This also shows that it's possible to reverse engineer click-fraud rules employed by ad networks in spite of the security-through-obscurity practices prominent today. Finally, it shows that it is not just possible, but also desirable to create Click-spam algorithms that do not rely on security-through-obscurity but instead on invariants that are hard for click-spammers to defeat, as such algorithms are inherently more robust and can catch a wide variety of click-fraud attacks. | en |
| dc.description.department | Computer Science | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/2152/25143 | en |
| dc.subject | Click-fraud | en |
| dc.subject | Click-spam | en |
| dc.subject | Advertising | en |
| dc.subject | Bots | en |
| dc.title | Measuring, fingerprinting and catching click-spam in ad networks | en |
| dc.type | Thesis | en |
| thesis.degree.department | Computer Sciences | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | The University of Texas at Austin | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |
Access full-text files
Original bundle
1 - 1 of 1