Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Click fraud
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Hit inflation attack=== A hit inflation attack is a kind of fraudulent method used by some advertisement publishers to earn unjustified revenue on the traffic they drive to the advertisers’ Web sites. It is more sophisticated and harder to detect than a simple inflation attack. This process involves the collaboration of two counterparts, a dishonest publisher, P, and a dishonest Web site, S. Web pages on S contain a script that redirects the customer to P's Web site, and this process is hidden from the customer. So, when user U retrieves a page on S, it would simulate a click or request to a page on P's site. P's site has two kinds of webpages: a manipulated version, and an original version. The manipulated version simulates a click or request to the advertisement, causing P to be credited for the click-through. P selectively determines whether to load the manipulated (and thus fraudulent) script to U's browser by checking if it was from S. This can be done through the [[HTTP referer|Referrer field]], which specifies the site from which the link to P was obtained. All requests from S will be loaded with the manipulated script, and thus the automatic and hidden request will be sent.<ref name="Anupam">{{cite web |url=http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf |author1=V. Anupam |author2=A. Mayer |author3=K. Nissim |author4=B. Pinkas |author5=M. Reiter |title=On the Security of Pay-Per-Click and Other Web Advertising Schemes. In Proceedings of the 8th WWW International World Wide Web Conference |pages=1091–1100 |year=1999 |publisher=Unizh.co |access-date=2014-03-11 |archive-url=https://web.archive.org/web/20171010023048/http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf |archive-date=2017-10-10 |url-status=dead }}</ref> This attack will silently convert every innocent visit to S to a click on the advertisement on P's page. Even worse, P can be in collaboration with several dishonest Web sites, each of which can be in collaboration with several dishonest publishers. If the advertisement commissioner visits the Web site of P, the non-fraudulent page will be displayed, and thus P cannot be accused of being fraudulent. Without a reason for suspecting that such collaboration exists, the advertisement commissioner has to inspect all the Internet sites to detect such attacks, which is infeasible.<ref name="Anupam" /> Another proposed method for detection of this type of fraud is through use of [[association rule]]s.<ref>{{cite web |url=http://www.cs.ucsb.edu/research/tech_reports/reports/2005-13.pdf |author1=A. Metwally |author2=D. Agrawal |author3=A. El Abbadi |title=Using Association Rules for Fraud Detection in Web Advertising Networks. In Proceedings of the 10th ICDT International Conference on Database Theory |pages=398–412 |year=2005 |access-date=2013-03-01 |archive-date=2020-07-31 |archive-url=https://web.archive.org/web/20200731205901/https://www.cs.ucsb.edu/research/tech_reports/reports/2005-13.pdf |url-status=dead }} An extended version appeared in a University of California, Santa Barbara, Department of Computer Science, technical report 2005-23.</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)