The determination of whether an asset is infected can comprise: collecting NX domain names from at least one honeypot and at least one asset; using the honeypot NX domain names to create training vectors; using the real network NX domain names to create testing vectors; classifying the testing vectors as benign vectors or malicious vectors; and classifying the at least one asset in the at least one real network as infected if the NX testing vector created from the real network NX domain names is classified as a malicious vector. (It should be noted that the testing vectors can be classified using: simple internal assets infected with known malware; simple internal assets infected with unknown malware; or complex internal network assets; or any combination thereof.)
NX domain name information is useful because some malware takes advantage of existing domain name system (DNS) services such as free domain testing (e.g., determining whether a new domain name is available). Such malware can use a domain name generator that employs a seed, such as the date, together with an algorithm to generate a set of domain names. The command and control (C&C) can try to register the generated domain names until a registrable subset of domain lames has been identified. An infected computer can then use those daily-generated set of domain names in order to establish a new communication channel with the C&C. The victim computers will employ the same seed (i.e. date) and algorithm to generate the same set of domain names. The victim computers will then use the generated domain names in attempts to contact the C&C computer. Eventually, each victim computer will find a domain name that was registered for the C&C computer to enable daily communication between the C&C computer and the victim computers. By changing the domain name for the C&C computer (e.g., daily), it becomes difficult to statically black list the domain names or the IP addresses of the C&C computer(s).
Thus, malware which uses the above domain name resolution to establish communication with a C&C can produce many NX-Domains (NXs), which can be domain names that have not been registered with an authoritative DNS and can be observable at a recursive DNS server (“RDNS”). RDNS servers map domain names to IP addresses, also called “resolving DNS queries”. If such a mapping between a domain name and an IP address doesn't exist, the RNDS can send back to the initiator of the DNS query a “Non-Existence” response. The Non-Existence response can indicate that the domain name does not have an IP address, and is thus an NX-Domain (NX). Monitoring the NXs observable at a RDNS can provide the ability to collect all possible NXs generated from all computers connected to the RDNS.
The malware NXs can be collected so that a classifier can be trained in a controlled environment to recognize different categories of infected computers. For example,
In
Referring again to
The VMNET 34 computer in
Referring back to
Those of ordinary skill in the art will see that training vectors can be created in many other ways, in addition to collecting NXs from honeypots, as described above.
For example, an absolute timing sequence, which can list the domain names in the order that they are received, can be used to group together an example set of ten NX domain names (e.g., from a real network):
An example of various statistical values that can be computed for the set of NX domain names is illustrated in
The various statistical values for each set of 10 domain names from the real network NXs can be put in a vector. An example illustrating the domain names being transformed to statistical vectors, using the statistical values set forth in
The 17 statistical values corresponding to the statistical values found in
The NX application 105 can then utilize a meta-classifier to classify the testing vectors. The meta-classifier is a hybrid classifier and can comprise several generic classifiers. The various generic classifiers can be used (e.g., in parallel) to capture various different statistical properties which can potentially lower false positives (FP) and increase true positives (TP).
For example,
The majority voting can take the many classifications and determine which classification the majority of classifiers found. Thus, for the example above, conficker-B was the classification the majority of classifiers classified the malware as. The final class is the final classification based on the majority voting, which is conficker-B.
It should be noted that the meta-classifier can use any number and any type of known or unknown classifier, including, but not limited to, the above classifiers. The Naïve Bayes classifier can use estimator classes. Numeric estimator precision values can be chosen based on analysis of the training data. The LAD tree classifier can generate a multi-class alternating decision tree using a LogitBoost strategy. The Multi-Layer Perception Neural Network classifier can use back-propagation to classify instances. The Logistic Regression classifier can build linear logistic regression models. LogitBoost with simple regression can function as a base learner and can be used for fitting the logistic models. The IBK Lazy classifier can use normalized Euclidean distance to find the training instance closest o the given test instance, and can predict the same class as the training instance. If multiple instances have the same (smallest) distance to the test instance. the first one found can be used.
Additional information about all of the above classifiers can be found in Richard O. Duda et al., P
For example, each classifier in the meta-classifier can classify vector 710 as follows:
Using the classification of the vector by each classifier, if a confidence threshold is set to be >=0.9 (note that this value can be set by the use), the meta-classifier can classify the vector (or statistical instance) as follow:
Instance 1 Meta classification detection result: conficker-B with majority voting value: 4 with confidence (med/std): (0.985572986223/0.345308923709). This means that a majority of four (out of five) of the classifiers found the vector to be classified as conficker-B. The median confidence score is the median of all five of the confidence scores, divided by the standard deviation of all five of the classifiers. It should be noted that, because the confidence threshold is set to be >=0.9, this number is only meaningful if the median confidence score is >=0.9.
It should be noted that the meta-classifier can be independent from the manner in which the NXs are collected. It is only necessary to keep a mapping between the internal asset that the NXs originated from. The detection flow is satisfied as long as the monitoring system in the real network collects NXs from the same internal asset and groups them into sets of 10 using the absolute timing sequence. This is because the classifier can be trained to detect such behavior. Thus, the trained classifier can utilize domain names collected in the same way in real time.
It should be noted that if many NXs are classified as “unknown”, either a DNS issue causes such characterization, or the NXs are from malware where little or no information about the malware is known (e.g., a new worm). DNS issues can include a DNS outage or DNS misconfiguration. If a DNS issue is the cause of the high number of “unknown” classifications, the NXs can be classified as legitimate using for example, alexa.com, or a passive DNS feed. A passive DNS feed can be a technology which constructs zone replicas without cooperation from zone administrators, based on captured name server responses (see, e.g., F. Weimer, Passive DNS Replications, http://www.enyo.de/fw/software/dnslogger/2007, which is herein incorporated by reference). An example of a passive DNS feed is a DNSParse, which can be, for example, an implementation of the passive DNS technology by the University of Auckland in New Zealand (see, e.g., https://dnsparse.insec.auckland.ac.nz/dns/2007, which is herein incorporated by reference).
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example, and not limitation. It will be apparent to persons skilled in the relevant art(s) that various changes in form and detail can be made therein without departing from the spirit and scope of the present invention. Thus, the present invention should not be limited by any of the above-described exemplary embodiments.
In addition, it should be understood that the figures described above, which highlight the functionality and advantages of the present invention, are presented for example purposes only. The architecture of the present invention is sufficiently flexible and configurable, such that it may be utilized in ways other than that shown in the figures.
Further, the purpose of the Abstract of the Disclosure is to enable the U.S. Patent and Trademark Office and the public generally, and especially the scientists, engineers and practitioners in the art who are not familiar with patent or legal terms or phraseology, to determine quickly from a cursory inspection the nature and essence of the technical disclosure of the application. The Abstract of the Disclosure is not intended to be limiting as to the scope of the present invention in any way.
Finally, it is the applicant's intent that only claims that include the express language “means for” or “step for” be interpreted under 35 U.S.C. 112, paragraph 6. Claims that do not expressly include the phrase “means for” or “step for” are not to be interpreted under 35 U.S.C. 112, paragraph 6.
This application is a Continuation of U.S. patent application Ser. No. 12/985,140 filed Jan. 5, 2011. which claims benefit of U.S. Provisional Patent Application No. 61/292,592 filed Jan. 6, 2010, and U.S. Provisional Patent Application No. 61/295,060 filed Jan. 14, 2010, the contents of which are incorporated herein by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
4843540 | Stolfo | Jun 1989 | A |
4860201 | Stolfo et al. | Aug 1989 | A |
5363473 | Stolfo et al. | Nov 1994 | A |
5497486 | Stolfo et al. | Mar 1996 | A |
5563783 | Stolfo et al. | Oct 1996 | A |
5668897 | Stolfo | Sep 1997 | A |
5717915 | Stolfo et al. | Feb 1998 | A |
5748780 | Stolfo | May 1998 | A |
5920848 | Schutzer et al. | Jul 1999 | A |
6401118 | Thomas | Jun 2002 | B1 |
6983320 | Thomas et al. | Jan 2006 | B1 |
7013323 | Thomas et al. | Mar 2006 | B1 |
7039721 | Wu et al. | May 2006 | B1 |
7069249 | Stolfo et al. | Jun 2006 | B2 |
7093292 | Pantuso | Aug 2006 | B1 |
7136932 | Schneider | Nov 2006 | B1 |
7152242 | Douglas | Dec 2006 | B2 |
7162741 | Eskin et al. | Jan 2007 | B2 |
7225343 | Honig et al. | May 2007 | B1 |
7277961 | Smith et al. | Oct 2007 | B1 |
7278163 | Banzhof | Oct 2007 | B2 |
7331060 | Ricciulli | Feb 2008 | B1 |
7372809 | Chen et al. | May 2008 | B2 |
7383577 | Hrastar et al. | Jun 2008 | B2 |
7424619 | Fan et al. | Sep 2008 | B1 |
7426576 | Banga et al. | Sep 2008 | B1 |
7448084 | Apap et al. | Nov 2008 | B1 |
7483947 | Starbuck | Jan 2009 | B2 |
7487544 | Schultz et al. | Feb 2009 | B2 |
7536360 | Stolfo et al. | May 2009 | B2 |
7634808 | Szor | Dec 2009 | B1 |
7639714 | Stolfo et al. | Dec 2009 | B2 |
7657935 | Stolfo et al. | Feb 2010 | B2 |
7665131 | Goodman | Feb 2010 | B2 |
7698442 | Krishnamurthy | Apr 2010 | B1 |
7712134 | Nucci et al. | May 2010 | B1 |
7752125 | Kothari et al. | Jul 2010 | B1 |
7752665 | Robertson et al. | Jul 2010 | B1 |
7779463 | Stolfo et al. | Aug 2010 | B2 |
7784097 | Stolfo et al. | Aug 2010 | B1 |
7818797 | Fan et al. | Oct 2010 | B1 |
7882542 | Neystadt | Feb 2011 | B2 |
7890627 | Thomas | Feb 2011 | B1 |
7913306 | Apap et al. | Mar 2011 | B2 |
7930353 | Chickering | Apr 2011 | B2 |
7962798 | Locasto et al. | Jun 2011 | B2 |
7979907 | Schultz et al. | Jul 2011 | B2 |
7996288 | Stolfo | Aug 2011 | B1 |
8015414 | Mahone | Sep 2011 | B2 |
8019764 | Nucci | Sep 2011 | B1 |
8074115 | Stolfo et al. | Dec 2011 | B2 |
8161130 | Stokes | Apr 2012 | B2 |
8170966 | Musat et al. | May 2012 | B1 |
8200761 | Tevanian | Jun 2012 | B1 |
8224994 | Schneider | Jul 2012 | B1 |
8260914 | Ranjan | Sep 2012 | B1 |
8341745 | Chau | Dec 2012 | B1 |
8347394 | Lee | Jan 2013 | B1 |
8402543 | Ranjan et al. | Mar 2013 | B1 |
8418249 | Nucci et al. | Apr 2013 | B1 |
8484377 | Chen et al. | Jul 2013 | B1 |
8516585 | Cao et al. | Aug 2013 | B2 |
8527592 | Gabe | Sep 2013 | B2 |
8631489 | Antonakakis et al. | Jan 2014 | B2 |
8826438 | Perdisci et al. | Sep 2014 | B2 |
20010014093 | Yoda et al. | Aug 2001 | A1 |
20010044785 | Stolfo et al. | Nov 2001 | A1 |
20010052007 | Shigezumi | Dec 2001 | A1 |
20010052016 | Skene et al. | Dec 2001 | A1 |
20010055299 | Kelly | Dec 2001 | A1 |
20020021703 | Tsuchiya et al. | Feb 2002 | A1 |
20020066034 | Schlossberg et al. | May 2002 | A1 |
20020166063 | Lachman et al. | Nov 2002 | A1 |
20030065926 | Schultz et al. | Apr 2003 | A1 |
20030065943 | Geis et al. | Apr 2003 | A1 |
20030069992 | Ramig | Apr 2003 | A1 |
20030167402 | Stolfo et al. | Sep 2003 | A1 |
20030204621 | Poletto et al. | Oct 2003 | A1 |
20030236995 | Fretwell, Jr. | Dec 2003 | A1 |
20040002903 | Stolfo et al. | Jan 2004 | A1 |
20040088646 | Yeager | May 2004 | A1 |
20040111636 | Baffes et al. | Jun 2004 | A1 |
20040187032 | Gels et al. | Sep 2004 | A1 |
20040205474 | Eskin et al. | Oct 2004 | A1 |
20040215972 | Sung et al. | Oct 2004 | A1 |
20050021848 | Jorgenson | Jan 2005 | A1 |
20050039019 | Delany | Feb 2005 | A1 |
20050086523 | Zimmer et al. | Apr 2005 | A1 |
20050108407 | Johnson et al. | May 2005 | A1 |
20050108415 | Turk et al. | May 2005 | A1 |
20050257264 | Stolfo et al. | Nov 2005 | A1 |
20050261943 | Quarterman et al. | Nov 2005 | A1 |
20050265331 | Stolfo | Dec 2005 | A1 |
20050278540 | Cho | Dec 2005 | A1 |
20050281291 | Stolfo et al. | Dec 2005 | A1 |
20060015630 | Stolfo et al. | Jan 2006 | A1 |
20060031483 | Lund | Feb 2006 | A1 |
20060068806 | Nam | Mar 2006 | A1 |
20060075084 | Lyon | Apr 2006 | A1 |
20060143711 | Huang et al. | Jun 2006 | A1 |
20060146816 | Jain | Jul 2006 | A1 |
20060150249 | Gassen et al. | Jul 2006 | A1 |
20060156402 | Stone et al. | Jul 2006 | A1 |
20060168024 | Mehr | Jul 2006 | A1 |
20060178994 | Stolfo et al. | Aug 2006 | A1 |
20060200539 | Kappler et al. | Sep 2006 | A1 |
20060212925 | Shull | Sep 2006 | A1 |
20060224677 | Ishikawa et al. | Oct 2006 | A1 |
20060230039 | Shull | Oct 2006 | A1 |
20060247982 | Stolfo et al. | Nov 2006 | A1 |
20060253581 | Dixon | Nov 2006 | A1 |
20060253584 | Dixon | Nov 2006 | A1 |
20060259967 | Thomas et al. | Nov 2006 | A1 |
20060265436 | Edmond | Nov 2006 | A1 |
20070050708 | Gupta et al. | Mar 2007 | A1 |
20070056038 | Lok | Mar 2007 | A1 |
20070064617 | Reves | Mar 2007 | A1 |
20070076606 | Olesinski | Apr 2007 | A1 |
20070083931 | Spiegel | Apr 2007 | A1 |
20070118669 | Rand et al. | May 2007 | A1 |
20070136455 | Lee et al. | Jun 2007 | A1 |
20070162587 | Lund et al. | Jul 2007 | A1 |
20070209074 | Coffman | Sep 2007 | A1 |
20070239999 | Honig et al. | Oct 2007 | A1 |
20070274312 | Salmela et al. | Nov 2007 | A1 |
20070294419 | Ulevitch | Dec 2007 | A1 |
20080028073 | Trabe et al. | Jan 2008 | A1 |
20080028463 | Dagon | Jan 2008 | A1 |
20080060054 | Srivastava | Mar 2008 | A1 |
20080060071 | Hennan | Mar 2008 | A1 |
20080098476 | Syversen | Apr 2008 | A1 |
20080133300 | Jalinous | Jun 2008 | A1 |
20080155694 | Kwon et al. | Jun 2008 | A1 |
20080177736 | Spangler | Jul 2008 | A1 |
20080178293 | Keen et al. | Jul 2008 | A1 |
20080184371 | Moskovitch | Jul 2008 | A1 |
20080195369 | Duyanovich et al. | Aug 2008 | A1 |
20080222729 | Chen et al. | Sep 2008 | A1 |
20080229415 | Kapoor | Sep 2008 | A1 |
20080262985 | Cretu et al. | Oct 2008 | A1 |
20080263659 | Alme | Oct 2008 | A1 |
20080276111 | Jacoby et al. | Nov 2008 | A1 |
20090055929 | Lee et al. | Feb 2009 | A1 |
20090083855 | Apap et al. | Mar 2009 | A1 |
20090106304 | Song | Apr 2009 | A1 |
20090138590 | Lee et al. | May 2009 | A1 |
20090193293 | Stolfo et al. | Jul 2009 | A1 |
20090198997 | Yeap | Aug 2009 | A1 |
20090210417 | Bennett | Aug 2009 | A1 |
20090222922 | Sidiroglou et al. | Sep 2009 | A1 |
20090241190 | Todd et al. | Sep 2009 | A1 |
20090241191 | Keromytis et al. | Sep 2009 | A1 |
20090254658 | Kamikura et al. | Oct 2009 | A1 |
20090254989 | Achan et al. | Oct 2009 | A1 |
20090254992 | Schultz et al. | Oct 2009 | A1 |
20090265777 | Scott | Oct 2009 | A1 |
20090282479 | Smith et al. | Nov 2009 | A1 |
20090327487 | Olson et al. | Dec 2009 | A1 |
20100011243 | Locasto et al. | Jan 2010 | A1 |
20100011420 | Drako | Jan 2010 | A1 |
20100017487 | Patinkin | Jan 2010 | A1 |
20100023810 | Stolfo et al. | Jan 2010 | A1 |
20100031358 | Elovici et al. | Feb 2010 | A1 |
20100034109 | Shomura et al. | Feb 2010 | A1 |
20100037314 | Perdisci et al. | Feb 2010 | A1 |
20100054278 | Stolfo et al. | Mar 2010 | A1 |
20100064368 | Stolfo et al. | Mar 2010 | A1 |
20100064369 | Stolfo et al. | Mar 2010 | A1 |
20100077483 | Stolfo et al. | Mar 2010 | A1 |
20100138919 | Peng | Jun 2010 | A1 |
20100146615 | Locasto et al. | Jun 2010 | A1 |
20100153785 | Keromytis et al. | Jun 2010 | A1 |
20100169970 | Stolfo et al. | Jul 2010 | A1 |
20100235915 | Memon et al. | Sep 2010 | A1 |
20100269175 | Stolfo et al. | Oct 2010 | A1 |
20100274970 | Treuhaft et al. | Oct 2010 | A1 |
20100275263 | Bennett et al. | Oct 2010 | A1 |
20100281539 | Burns et al. | Nov 2010 | A1 |
20100281541 | Stolfo et al. | Nov 2010 | A1 |
20100281542 | Stolfo et al. | Nov 2010 | A1 |
20100319069 | Granstedt | Dec 2010 | A1 |
20100332680 | Anderson et al. | Dec 2010 | A1 |
20110041179 | Stahlberg | Feb 2011 | A1 |
20110067106 | Evans et al. | Mar 2011 | A1 |
20110167493 | Song et al. | Jul 2011 | A1 |
20110167494 | Bowen et al. | Jul 2011 | A1 |
20110167495 | Antonakakis et al. | Jul 2011 | A1 |
20110185423 | Sallam | Jul 2011 | A1 |
20110185428 | Sallam | Jul 2011 | A1 |
20110214161 | Stolfo et al. | Sep 2011 | A1 |
20110283361 | Perdisci et al. | Nov 2011 | A1 |
20120042381 | Antonakakis et al. | Feb 2012 | A1 |
20120079101 | Muppala et al. | Mar 2012 | A1 |
20120084860 | Cao et al. | Apr 2012 | A1 |
20120117641 | Holloway | May 2012 | A1 |
20120143650 | Crowley et al. | Jun 2012 | A1 |
20120198549 | Antonakakis | Aug 2012 | A1 |
20130191915 | Antonakakis et al. | Jul 2013 | A1 |
20130232574 | Carothers | Sep 2013 | A1 |
20140059216 | Jerrim | Feb 2014 | A1 |
20140068763 | Ward et al. | Mar 2014 | A1 |
20140068775 | Ward et al. | Mar 2014 | A1 |
20140075558 | Ward et al. | Mar 2014 | A1 |
20140090058 | Ward et al. | Mar 2014 | A1 |
20140101759 | Antonakakis et al. | Apr 2014 | A1 |
20140289854 | Mahvi | Sep 2014 | A1 |
Number | Date | Country |
---|---|---|
WO 0237730 | May 2002 | WO |
WO 02098100 | Dec 2002 | WO |
Entry |
---|
U.S. Appl. No. 14/015,611, filed Aug. 30, 2013, Pending. |
U.S. Appl. No. 14/096,803, filed Dec. 4, 2013, Pending. |
Manos Antonakakis et al., “Building a Dynamic Reputation System for DNS”, 19th USENIX Security Symposium, Aug. 11-13, 2010 (17 pages). |
Manos Antonakakis et al., “From Throw-Away Traffic to Bots: Detecting the rise of DGA-Based Malware”, In Proceedings of the 21st USENIX Conference on Security Symposium (Security'12), (2012) (16 pages). |
Yajin Zhou et al., “Dissecting Android Malware: Characterization and Evolution”, 2012 IEEE Symposium on Security and Privacy, pp. 95-109 (2012). |
File History of U.S. Appl. No. 11/538,212. |
File History of U.S. Appl. No. 12/538,612. |
File History of U.S. Appl. No. 12/985,140. |
File History of U.S. Appl. No. 13/008,257. |
File History of U.S. Appl. No. 13/205,928. |
File History of U.S. Appl. No. 13/309,202. |
File History of U.S. Appl. No. 13/358,303. |
File History of U.S. Appl. No. 13/749,205. |
File History of U.S. Appl. No. 14/010,016. |
File History of U.S. Appl. No. 14/015,582. |
File History of U.S. Appl. No. 14/015,621. |
File History of U.S. Appl. No. 14/015,663. |
File History of U.S. Appl. No. 14/015,704. |
File History of U.S. Appl. No. 14/015,661. |
File History of U.S. Appl. No. 14/096,803. |
File History of U.S. Appl. No. 14/194,076. |
File History of U.S. Appl. No. 14/305,998. |
File History of U.S. Appl. No. 14/317,785. |
File History of U.S. Appl. No. 14/304,015. |
File History of U.S. Appl. No. 14/616,387. |
File History of U.S. Appl. No. 14/668,329. |
File History of U.S. Appl. No. 12/538,612, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 13/205,928, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 13/749,205, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/015,582, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/015,663, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/015,704, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/015,661, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/096,803, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/305,998, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 14/317,785, electronically captured from PAIR on Feb. 12, 2016 for Nov. 19, 2015 to Feb. 12, 2016. |
File History of U.S. Appl. No. 15/019,272, electronically captured from PAIR on Feb. 12, 2016. |
File History of U.S. Appl. No. 12/538,612, electronically captured from PAIR on Apr. 4, 2016 for Feb. 12, 2016 to Apr. 4, 2016. |
File History of U.S. Appl. No. 13/205,928, electronically captured from PAIR on Apr. 4, 2016 for Feb. 12, 2016 to Apr. 4, 2016. |
File History of U.S. Appl. No. 13/309,202, electronically captured from PAIR on Apr. 4, 2016 for Nov. 19, 2015 to Apr. 4, 2016. |
File History of U.S. Appl. No. 14/015,582, electronically captured from PAIR on Apr. 4, 2016 for Feb. 12, 2016 to Apr. 4, 2016. |
File History of U.S. Appl. No. 14/015,704, electronically captured from PAIR on Apr. 4, 2016 for Feb. 12, 2016 to Apr. 4, 2016. |
File History of U.S. Appl. No. 14/194,076, electronically captured from PAIR on Apr. 4, 2016 for Nov. 19, 2015 to Apr. 4, 2016. |
File History of U.S. Appl. No. 14/305,998, electronically captured from PAIR on Apr. 4, 2016 for Feb. 12, 2016 to Apr. 4, 2016. |
Leo Breiman, “Bagging Predictors”, Machine Learning, vol. 24, pp. 123-140 (1996). |
David S. Anderson et al., “Spamscatter: Characterizing Internet Scam Hosting Infrastructure”, Proceedings of the USENIX Security Symposium (2007) (14 pages). |
Sujata Garera et al., “A Framework for Detection and Measurement of Phishing Attacks”, WORM'07, pp. 1-8, Nov. 2, 2007. |
Torsten Horthorn et al., “Double-Bagging: Combining Classifiers by Bootstrap Aggregation”, Pattern Recognition, vol. 36, pp. 1303-1309 (2003). |
Roberto Perdisci et al., “Detecting Malicious Flux Service Networks Through Passive Analysis of Recursive DNS Traces”, Proceedings of ACSAC, Honolulu, Hawaii, USA (2009) (10 pages). |
Shuang Hao et al., “Detecting Spammers with SNARE: Spatiotemporal Network-Level Automatic Reputation Engine”, 18th USENIX Security Symposium, pp. 101-117 (2009). |
Kazumichi Sato et al., “Extending Black Domain Name List by Using Co-Occurrence Relation Between DNS Queries”, Presentation in the Third USENIX LEET Workshop (2010) (22 pages). |
Sushant Sinha et al., “Shades of Grey: On the Effectiveness of Reputation-Based Blacklists”, In 3rd International Conference on MALWARE (2008) (8 pages). |
Zhiyun Qian et al., “On Network-Level Clusters for Spam Detection”, In Proceedings of the USENIX NDSS Symposium (2010) (17 pages). |
Bojan Zdrnja et al., “Passive Monitoring of DNS Anomalies”, In Proceedings of DIMVA Conference (2007) (11 pages). |
Jian Zhang et al., “Highly Predictive Blacklisting”, In Proceedings of the USENIX Security Symposium (2008) (16 pages). |
http://www.uribl.com/about.shtml, retrieved from Internet Archive on Mar. 16, 2016, Archived Jul. 22, 2010 (4 pages). |
http://www.spamhaus.org/zen/, retrieved from Internet Archive on Mar. 16, 2016, Archived Jul. 6, 2010 (3 pages). |
Mathew Sullivan, “Fighting Spam by Finding and Listing Exploitable Servers”, Apricot 2006 (26 pages). |
File History of U.S. Appl. No. 13/205,928, electronically captured from PAIR on Jul. 25, 2016 for Apr. 4, 2016 to Jul. 25, 2016. |
File History of U.S. Appl. No. 14/096,803, electronically captured from PAIR on Jul. 25, 2016 for Feb. 12, 2016 to Jul. 25, 2016. |
File History of U.S. Appl. No. 14/317,785, electronically captured from PAIR on Jul. 25, 2016 for Feb. 12, 2016 to Jul. 25, 2016. |
File History of U.S. Appl. No. 14/616,387, electronically captured from PAIR on Jul. 25, 2016 for Jun. 22, 2015 to Jul. 25, 2016. |
File History of U.S. Appl. No. 14/668,329, electronically captured from PAIR on Jul. 25, 2016 for Jun. 22, 2015 to Jul. 25, 2016. |
Mekky et al. (Detecting Malicious HTTP Redirections Using Trees of User Browser Activity, IEEE INFOCOM 2014, pp. 1159-1167). |
Number | Date | Country | |
---|---|---|---|
20140101759 A1 | Apr 2014 | US |
Number | Date | Country | |
---|---|---|---|
61292592 | Jan 2010 | US | |
61295060 | Jan 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12985140 | Jan 2011 | US |
Child | 14041796 | US |