{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:44:50Z","timestamp":1784738690237,"version":"3.55.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T00:00:00Z","timestamp":1270771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2010,4,9]]},"abstract":"<jats:p>Online advertising is currently the richest source of revenue for many Internet giants. The increased number of online businesses, specialized websites and modern profiling techniques have all contributed to an explosion of the income of ad brokers from online advertising. The single biggest threat to this growth, is however, click-fraud. Trained botnets and individuals are hired by click-fraud specialists in order to maximize the revenue of certain users from the ads they publish on their websites, or to launch an attack between competing businesses.<\/jats:p>\n          <jats:p>In this note we wish to raise the awareness of the networking research community on potential research areas within the online advertising field. As an example strategy, we present Bluff ads; a class of ads that join forces in order to increase the effort level for click-fraud spammers. Bluff ads are either targeted ads, with irrelevant display text, or highly relevant display text, with irrelevant targeting information. They act as a litmus test for the legitimacy of the individual clicking on the ads. Together with standard threshold-based methods, fake ads help to decrease click-fraud levels.<\/jats:p>","DOI":"10.1145\/1764873.1764877","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T18:13:20Z","timestamp":1271096000000},"page":"21-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":88,"title":["Fighting online click-fraud using bluff ads"],"prefix":"10.1145","volume":"40","author":[{"given":"Hamed","family":"Haddadi","sequence":"first","affiliation":[{"name":"University of London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,4,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00023-7"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_5"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1362903.1362905"},{"key":"e_1_2_1_4_1","unstructured":"C. Labovitz S. Iekel-Johnson D. McPherson F. J. J. Oberheide and M. Karir. ATLAS Internet Observatory 2009 Annual Report. NANOG47 http:\/\/tinyurl.com\/yz7xwvv June 2009.  C. Labovitz S. Iekel-Johnson D. McPherson F. J. J. Oberheide and M. Karir. ATLAS Internet Observatory 2009 Annual Report. NANOG47 http:\/\/tinyurl.com\/yz7xwvv June 2009."},{"key":"e_1_2_1_5_1","unstructured":"J. Stewart. FFSearcher Click Fraud Tro jan. http:\/\/secureworks.com\/research\/threats\/ffsearcher\/ June 2009.  J. Stewart. FFSearcher Click Fraud Tro jan. http:\/\/secureworks.com\/research\/threats\/ffsearcher\/ June 2009."},{"key":"e_1_2_1_6_1","unstructured":"A. Tuzhilin. The Lanes Gifts v. Google Report. http:\/\/googleblog.blogspot.com\/pdf\/Tuzhilin_Report.pdf.  A. Tuzhilin. The Lanes Gifts v. Google Report. http:\/\/googleblog.blogspot.com\/pdf\/Tuzhilin_Report.pdf."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1764873.1764877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1764873.1764877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:44Z","timestamp":1750246784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1764873.1764877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,9]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4,9]]}},"alternative-id":["10.1145\/1764873.1764877"],"URL":"https:\/\/doi.org\/10.1145\/1764873.1764877","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4,9]]},"assertion":[{"value":"2010-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}