1. Field of the Invention
The present invention relates to reducing or preventing legitimate web site content from triggering matches to anti-phishing black lists.
2. Description of the Related Art
Phishing attacks are computerized ploys that are intended to steal consumers' personal identity data and financial account credentials. Examples of phishing schemes include using ‘spoofed’ e-mails to lead consumers to counterfeit websites designed to trick recipients into divulging financial data such as credit card numbers, account usernames, passwords and social security numbers. Hijacking of brand names of banks, e-retailers and credit card companies, are often used to convince recipients to respond.
Most phishing attacks today are done by the phisher placing the fake website content on a legitimate website. They do this by hacking into the site and placing the content in an area that they create and upload files to. They then send out the URL to the uploaded web content in a fraudulent email. The victim then clicks on the URL in the email which takes them to the area of the website created by the phisher.
As an example, take a legitimate site such as http://www.myfamilyphotos.com. The phisher will hack into the web server hosting www.myfamilyphotos.com and place the illegitimate content, such as fraudulent content in a location such that it can be referenced by a URL such as http://www.myfamilyphotos.com/subdir/hackedpage.asp. To a user, this URL may appear legitimate, as the illegitimate content is in fact actually present on the legitimate website server. Of course, the illegitimate content may be any sort of web application, file or content, not just an .asp page.
Many Anti-Phishing solutions block access to illegitimate sites by providing a black list. This black list includes a list of domains known to have illegitimate content on them. For example, myfamilyphotos.com would be one such domain. Also included in the black list is a list of search patterns or signatures for each listed domain, as there may be more than one illegitimate site on a domain. These search patterns are commonly in regular expression format, but don't have to be. A regular expression is a string that is used to describe or match a set of strings, according to certain syntax rules. To determine if a URL points to illegitimate phishing content, the domain part of the URL is extracted and then the list of search patterns is retrieved from the black list. These search patterns are then evaluated against the full URL. If the full URL matches one or more of the search patterns, the URL is determined to be a phishing site. These black lists are built by automatically and manually processing phishing samples.
A problem arises in trying to ensure that the search patterns do not match a legitimate part of a web site. Such a match is known as a false positive. False positives in phishing black lists are increasingly common as phishing attacks increase in number. False positives are undesirable as they will block access to legitimate web content. In order to reduce false positives, the black lists may be manually reviewed. However, due to the vast number of web sites in existence, black lists tend to be very large. Manual review of such black lists is very time consuming and expensive. A manual review step will also delay the availability of the new black list entry increasing the window of time that the solution does not protect against the illegitimate content.
A need arises for a technique that prevents false positives from occurring by reducing or preventing legitimate web site content from triggering matches to phishing black lists, but which provides time and cost savings over manual review of black lists.
The present invention provides prevents false positives from occurring by reducing or preventing legitimate web site content from triggering matches to phishing black lists, but provides time and cost savings over manual review of black lists. The ability to automatically check for false positives also allows black list listings times to be quicker and also allows the techniques and process that generate black list entries to be more aggressive and take more risk. Both of these advantages mean Anti-Phishing detection and coverage is improved. In the extreme case, brute-force generation of match criteria could be employed and executed against this algorithm. When a brute-force signature passes the algorithm without recording a false-positive it can be used as a signature.
A method implemented in a computer system for detecting false positives among a plurality of search patterns of web sites that include illegitimate content comprises accessing a first page of a legitimate web site, obtaining all links included in the first page, for each link included in the first page that points to a page on the web site, determining whether the link matches at least one of the plurality of search patterns, and for each link that matches the search pattern, indicating that the search pattern is a false positive. The search pattern may be included in a list of web sites that include illegitimate content. Each search pattern may be a regular expression. A search pattern that is a false positive may be indicated by including the search pattern in a list of false positives. A search pattern that is a false positive may be indicated in the list of web sites that include illegitimate content.
The method may further comprise, for each link that points to a page on the web site, recursively accessing a page pointed to by the link, obtaining all links in the page, for each link included in the page that points to a page on the web site, determining whether the link matches at least one of the plurality of search patterns, and for each link that matches the search pattern, indicating that the search pattern is a false positive.
The details of the present invention, both as to its structure and operation, can best be understood by referring to the accompanying drawings, in which like reference numbers and designations refer to like elements.
The present invention provides prevents false positives from occurring by reducing or preventing legitimate web site content from triggering matches to phishing black lists, but provides time and cost savings over manual review of black lists. The solution revolves around the fact that legitimate parts of a website are usually all linked together by hyperlinks and are accessible by following hyperlinks starting at the main page. An example of such a website 100 is shown in
For example, all legitimate parts of the family photos website discussed above are likely to be accessible from the home page at http://www.myfamilyphotos.com, but it is extremely unlikely for there to be a link to the phish page at http://www.myfamilyphotos.com/subdir/hackedpage.asp from the legitimate part of the website.
The present invention provides an automated way to build confidence that the black list entry search patterns or signatures will not detect false positives on legitimate content by checking that no legitimate part of the website links to the illegitimate part and that no part of the web site accessible from the home page matches the search pattern.
An example of an implementation of process 200 for detecting and indicating false positives is shown in
In step 210, each link that was checked in step 206 is accessed and for each resulting page, the process repeats at step 204. Thus, each level of website content is crawled and the checks on the links are repeated, until the whole site has been checked. As many links on websites are circularly referential or are dynamic, to prevent infinite recursion on circular references or on dynamic content, a maximum recursion depth is defined.
An exemplary block diagram of a system 300, in which the present invention may be implemented, is shown in
Input/output circuitry 310 provides the capability to input data to, or output data from, computer system 302. For example, input/output circuitry may include input devices, such as keyboards, mice, touchpads, trackballs, scanners, etc., output devices, such as video adapters, monitors, printers, etc., and input/output devices, such as, modems, etc. Network adapter 312 interfaces computer system 302 with Internet/intranet 304. Internet/intranet 304 may include one or more standard local area network (LAN) or wide area network (WAN), such as Ethernet, Token Ring, the Internet, or a private or proprietary LAN/WAN.
Memory 314 stores program instructions that are executed by, and data that are used and processed by, CPU 302 to perform the functions of computer system 302. Memory 304 may include electronic memory devices, such as random-access memory (RAM), read-only memory (ROM), programmable read-only memory (PROM), electrically erasable programmable read-only memory (EEPROM), flash memory, etc., and electro-mechanical memory, such as magnetic disk drives, tape drives, optical disk drives, etc., which may use an integrated drive electronics (IDE) interface, or a variation or enhancement thereof, such as enhanced IDE (EIDE) or ultra direct memory access (UDMA), or a small computer system interface (SCSI) based interface, or a variation or enhancement thereof, such as fast-SCSI, wide-SCSI, fast and wide-SCSI, etc, or a fiber channel-arbitrated loop (FC-AL) interface.
The contents of memory 314 varies depending upon the function that computer system 302 is programmed to perform. In the example shown in
Web servers 306A-N are computer systems and/or computer programs that are responsible for accepting HTTP requests from clients, such as web browsers, and serving them HTTP responses along with optional data contents, which usually are web pages such as HTML documents and linked objects (images, etc.). Each web server 306A-N includes content 324A-N, which typically includes web pages and links among web pages. The content 324A-N may include legitimate content, illegitimate content, or both legitimate and illegitimate content, as shown in
As shown in
It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions and a variety of forms and that the present invention applies equally regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include storage media, examples of which include, but are not limited to, floppy disks, hard disk drives, CD-ROMs, DVD-ROMs, RAM, and, flash memory, as well as transmission media, examples of which include, but are not limited to, digital and analog communications links.
Although specific embodiments of the present invention have been described, it will be understood by those of skill in the art that there are other embodiments that are equivalent to the described embodiments. Accordingly, it is to be understood that the invention is not to be limited by the specific illustrated embodiments, but only by the scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
6018724 | Arent | Jan 2000 | A |
6065055 | Hughes et al. | May 2000 | A |
6285999 | Page | Sep 2001 | B1 |
6356937 | Montville et al. | Mar 2002 | B1 |
6539430 | Humes | Mar 2003 | B1 |
6606659 | Hegli et al. | Aug 2003 | B1 |
6785732 | Bates et al. | Aug 2004 | B1 |
6856963 | Hurwitz | Feb 2005 | B1 |
6938003 | Harpale | Aug 2005 | B2 |
7024630 | Himmel et al. | Apr 2006 | B2 |
7096493 | Liu | Aug 2006 | B1 |
7114177 | Rosenberg et al. | Sep 2006 | B2 |
7143139 | Burbeck et al. | Nov 2006 | B2 |
7207480 | Geddes | Apr 2007 | B1 |
7216360 | Nakao et al. | May 2007 | B2 |
7231395 | Fain et al. | Jun 2007 | B2 |
7257549 | Karaoguz et al. | Aug 2007 | B2 |
7313691 | Bantz et al. | Dec 2007 | B2 |
7370188 | Rothman et al. | May 2008 | B2 |
7380267 | Arai et al. | May 2008 | B2 |
7765481 | Dixon et al. | Jul 2010 | B2 |
20010054152 | Nakao et al. | Dec 2001 | A1 |
20010056550 | Lee | Dec 2001 | A1 |
20020059364 | Coulthard et al. | May 2002 | A1 |
20020069129 | Akutsu et al. | Jun 2002 | A1 |
20020138402 | Zacharia et al. | Sep 2002 | A1 |
20020143885 | Ross | Oct 2002 | A1 |
20020178381 | Lee et al. | Nov 2002 | A1 |
20020180778 | Proudler | Dec 2002 | A1 |
20030018585 | Butler et al. | Jan 2003 | A1 |
20030023878 | Rosenberg et al. | Jan 2003 | A1 |
20030055737 | Pope et al. | Mar 2003 | A1 |
20030097591 | Pham et al. | May 2003 | A1 |
20030172166 | Judge et al. | Sep 2003 | A1 |
20030182421 | Faybishenko et al. | Sep 2003 | A1 |
20040107363 | Monteverde | Jun 2004 | A1 |
20040122926 | Moore et al. | Jun 2004 | A1 |
20040153414 | Khaishgi et al. | Aug 2004 | A1 |
20040167980 | Doyle et al. | Aug 2004 | A1 |
20040169678 | Oliver | Sep 2004 | A1 |
20040199606 | Brown et al. | Oct 2004 | A1 |
20040210602 | Hillis et al. | Oct 2004 | A1 |
20050015506 | Padborg | Jan 2005 | A1 |
20050033991 | Crane | Feb 2005 | A1 |
20050044423 | Mellmer et al. | Feb 2005 | A1 |
20050076222 | Olkin et al. | Apr 2005 | A1 |
20050165680 | Keeling et al. | Jul 2005 | A1 |
20050216300 | Appelman et al. | Sep 2005 | A1 |
20060009994 | Hogg et al. | Jan 2006 | A1 |
20060015722 | Rowan et al. | Jan 2006 | A1 |
20060095404 | Adelman et al. | May 2006 | A1 |
20060095586 | Adelman et al. | May 2006 | A1 |
20060117389 | Pool | Jun 2006 | A1 |
20060174343 | Duthie et al. | Aug 2006 | A1 |
20060212925 | Shull et al. | Sep 2006 | A1 |
20060235796 | Johnson et al. | Oct 2006 | A1 |
20060239430 | Gue et al. | Oct 2006 | A1 |
20060242026 | Crespo et al. | Oct 2006 | A1 |
20060265417 | Amato et al. | Nov 2006 | A1 |
20070028304 | Brennan | Feb 2007 | A1 |
20070039038 | Goodman et al. | Feb 2007 | A1 |
20070088652 | Firmage et al. | Apr 2007 | A1 |
20070130350 | Alperovitch et al. | Jun 2007 | A1 |
20080028029 | Hart | Jan 2008 | A1 |
20080250159 | Wang et al. | Oct 2008 | A1 |
Number | Date | Country | |
---|---|---|---|
20090089287 A1 | Apr 2009 | US |