US 7,293,290 B2Grant
Dynamic detection of computer worms
Issue Date:2007-11-06
•39 Claims
•4 Drawing Sheets
Abstract
Methods, apparati, and computer-readable media for detecting malicious computer code in a host computer (1). A method embodiment of the present invention comprises the steps of determining (32) whether data leaving the host computer (1) is addressed to exit a port (15) of the host computer (1) where outbound executable content normally does not appear; when the data is addressed to exit such a port (15), determining (33) whether a string (24) from a pre-established runtime database (9) of executable threads is present in said data; and when a string (24) from said runtime database (9) is present in said data, declaring (34) a suspicion of presence of malicious computer code in said data.
Metadata
Assignee
- Symantec Corporation
Inventor
- Peter Szor
Application Information
Application Number:US 10/360,381
Filing Date:2003-02-06
Priority Date:2003-02-06
Art Unit:2137
Classifications
IPC:
G06F11/00
Patent Drawings (4 sheets)
Description
Technical Field
[0001] This invention pertains to the field of preventing malicious attacks to computers, and, in particular, attacks by computer worms.
Background Art
[0002] As used herein, “malicious computer code” is any set of computer instructions that enters a computer without an authorized user's knowledge and/or without an authorized user's consent. Malicious computer code that propagates from one computer to another over a network, e.g., the Internet, is often referred to as a “worm”.
[0003] Network based intrusion detection systems have been constructed that examine inbound and outbound network packets that are entering and leaving a host computer. Such systems scan the contents of these packets to look for strings containing known malicious code. Some of these systems are capable of reconstructing a stream of data out of the packet fragments. However, the string data that is representative of malicious code is historical string data. The present invention goes beyond such systems in providing string data that is generated on a real time (runtime) basis, thus providing a truly dynamic malicious code detection system. This invention also is capable of filtering outgoing traffic on the packet level as well as on the stream level.
Disclosure of Invention
[0004] Methods, apparati, and computer-readable media for detecting malicious computer code in a host computer (1). A method embodiment of the present invention comprises the steps of determining (32) whether data leaving the host computer (1) is addressed to exit a port (15) of the host computer (1) where outbound executable content normally does not appear; when the data is addressed to exit such a port (15), determining (33) whether a string (24) from a pre-established runtime database (9) of executable threads is present in said data; and when a string (24) from said runtime database (9) is present in said data, declaring (34) a suspicion of presence of malicious computer code in said data.
Brief Description of the Drawings
[0005] These and other more detailed and specific objects and features of the present invention are more fully disclosed in the following specification, reference being had to the accompanying drawings, in which:
[0006] FIG. 1 is a block diagram of a system for implementing the present invention.
[0007] FIG. 2 is a data structure for a record 20 within runtime string database 9 of the present invention.
[0008] FIG. 3 is a flow diagram illustrating a method embodiment of the present invention.
Detailed Description of the Preferred Embodiments
[0009] FIG. 1 illustrates an architecture that is suitable for implementing the present invention. The various modules illustrated in FIG. 1 can be implemented in any combination of hardware, firmware, and/or software. Most of the modules are typically implemented in software. The software modules can be resident on any computer-readable medium, e.g., hard disk, floppy disk, CD, DVD, or other media now known or later developed.
[0010] Filter 6 is a module adapted to analyze data that is addressed to exit host computer 1. Data leaving computer 1 may adhere to Internet protocols such as TCP/IP, and therefore be packetized, or the data may be stream data. Packet filtering by itself could lead to potential misses of infections, because of packet fragmentation. By also filtering application level stream data, packet fragmentation does not need to be handled by rebuilding individual packets.
[0011] Filter 6 is designed such that data addressed to exit computer 1 via ports 15 where outbound executable content normally does not appear is selected for further analysis. An example of such a port 15 is port 80 in HTTP (HyperText Transfer Protocol), the standard port used to access the World Wide Web.
[0012] The reason for selecting data addressed via such ports is that executable content sent via such a port gives rise to a suspicion that a computer worm is present. Port 25, the e-mail port, is not suitable for this purpose, because it would yield too many false positives. This is because it is rather common for legitimate e-mail to contain executable attachments.
[0013] Runtime string database 9 contains a plurality of records 20 comprising strings 24 from threads 12 that have executed on computer 1 (see FIG. 2 ). For purposes of illustrating the present invention, it is assumed that the operating system (OS)5 running on computer 1 is a multi-threading (multi-tasking) OS. For example, OS 5 may be a Windows NT operating system manufactured by Microsoft Corporation of Redmond, Washington. Tracking module 4, which may be part of OS 5, is a software driver that hooks to the functionality of OS 5 and identifies threads 12. Examples of suitable drivers that can be used as tracking module 4 include tracker.sys; a driver that can provide system level hooking facility for intercepting function calls such as ZwCreateThread( ) in order to track the creation of new threads on the system; and filter.sys, which filters outbound network traffic.
[0014] Tracking module 4 typically tracks each thread 12 being executed on computer 1, unless list 3 instructs module 4 otherwise. List 3 is a storage area associated with host computer 1 that lists inclusions and exclusions that have been preselected by the system administrator or other human user of computer 1. Examples of items that may be included in the list of inclusions are specific ports 15 that should be observed by filter 6 and specific processes that should be analyzed by tracking module 4. An example of a process that could be specifically selected for tracking is inetinfo.exe, the Microsoft Internet Web service. The list 3 of inclusions may contain group lists, e.g., all network services, all processes, etc.
[0015] List 3 may also contain names of processes that do not have to be analyzed, because they are assumed to be free of malicious computer code. An example of such a process that could be automatically excluded is calc.exe. Another example is notepad.exe (unless a CreateRemoteThread( ) was used to create a thread inside that process). Having such a list of exclusions advantageously reduces overhead on host computer 1.
[0016] Thread analyzer 8 is a module coupled to tracking module 4 that analyzes the approved threads 12 and extracts relevant information therefrom, storing said information as a record 20 within runtime database 9. As used through this patent application, “coupled” means any type of coupling or connection, whether direct or indirect (i.e., via an intermediate module or device). FIG. 2 illustrates a typical format for such a record 20. Field 21 contains an identification of the thread 12. Field 24 contains a representative string from the thread 12. The string 24 usually has a preselected fixed length that is long enough to uniquely identify that particular thread 12. Field 22 contains a start address of the string 24, which may be the start address of the thread 12 containing the string 24. Alternative to the start address of the thread 12, field 22 may contain the start address of a point in the thread 12 following a jump instruction. The reason for looking at such a portion of a thread 12 is that malicious computer code often starts with a jump instruction. Optional field 23 contains a hash of string 24 calculated using a preselected hash function such as SHA-1 or MD5. The hash may be a hash of the entire string 24 or a hash of just a preselected portion of string 24, such as the beginning portion. Field 23 can be used to save time in the matching process, as will be described below.
[0017] Records 20 should not be duplicated within database 9. Thus, for example, thread analyzer 8 does not need to store a record 20 containing a hash 23 when said hash 23 already appears within database 9.
[0018] Matching module 10 is coupled to filter 6 and to database 9. Module 10 is configured to determine whether a string from database 9 is present in outgoing data which has been filtered by filter 6 to include just data that is addressed to exit via ports 15 where outbound executable content is not normally present. The presence of such a string within an outgoing packet/stream gives rise to a suspicion that malicious computer code is present within the packet/stream. The packet/stream may be addressed to a computer 13 external to host computer 1. When a suspicion of malicious code is unearthed, control is passed to post-detection module 11 for implementing steps 34, 35, and 36, as illustrated in FIG. 3 .
[0019] The outgoing data may be encoded by an encoding algorithm such as MIME (Multipurpose Internet Mail Extension) or UUencode. For this reason, a decoder 7 may be placed between filter 6 and matching module 10. Decoder 7 may be programmed to decode all data automatically, so as to make sure that encoded network traffic is decoded. Alternatively, decoder 7 may be programmed to search for encoded data by means of some algorithm, e.g., one that looks for a key word such as “MIME” in a header.
[0020] A garbage collector module 14 may be advantageously utilized to periodically purge runtime database 9 of extraneous information. In a first embodiment, module 14 is programmed to remove entries 20 corresponding to threads 12 upon the instructions of OS 5. OS 5 in turn may have received these instructions from an update to list 3. Module 14 may be instructed by OS 5 to execute periodically, e.g., once a day. In a second embodiment, module 14 is programmed to purge a record 20 when the corresponding thread 12 has not been executed for a preselected period of time. In a third embodiment, module 14 is programmed to purge records 20 when runtime database 9 exceeds a preselected size. This embodiment may be implemented without a separate module 14. For example, database 9 can be a fixed size storage area configured as a stack. When the stack gets full, a new record 20 fed into database 9 results in the oldest record 20 being discarded.
[0021] User interface module 2 provides a means by which the system administrator or other human user of computer 1 can communicate with the aforesaid modules. Tasks that can be performed by user interface 2 include:
-
- [0022] The user can be alerted to the suspicion of malicious computer code by post-detection module 11.
- [0023] The user can add to the list 3 of inclusions and exclusions.
- [0024] The user can instruct post-detection module 11 as to what to do in case of a suspicion of malicious computer code. For example, there can be two modes, a log mode and a block mode. “Log” means that the suspicious activity is logged with being blocked. “Block” means that it is also blocked.
[0025] A method embodiment for carrying out the present invention will now be described in conjunction with FIG. 3 . The method starts at step 30. At step 31, the next outgoing packet/stream is selected. (The first time the method is executed, the “next” outgoing packet/stream is the first.) At step 32, filter 6 determines whether the data contains an address 13 that will cause the data to exit a port 15 where outbound executable content is not normally present. If port 15 is not deemed to be suspicious according to this criterion, the method reverts to step 31. If port 15 is deemed to be suspicious, the method proceeds to step 33, where matching module 10 determines whether a string 24 from database 9 is present within the outgoing data. The matching can be performed by any conventional comparison algorithm. For example, the algorithm can compare each string 24 in database 9 with contents of the outgoing data. The algorithm can be expedited if all strings 24 have a predetermined fixed string length and a predetermined start point. As mentioned previously, the start point can be either the start address of the thread 12 containing the string, or an address following a jump instruction. The comparison can be further expedited by using hash 23. In this embodiment, hashes of strings within outgoing data are calculated, using the same hash algorithm that was used to calculate the hashes 23 in database 9. If and only if a hash 23 from database 9 matches a hash of a string within the outgoing data, the full strings are compared. If a string 24 from database 9 matches a string in the outgoing data, the method proceeds to step 34; otherwise, it reverts to step 31.
[0026] At step 34, post-detection module 11 typically sends a message to user interface 2 declaring a suspicion of presence of malicious computer code. Module 11 may also check for false positives and/or perform false positive mitigation steps at step 35. If malicious code is still suspected after the false positive procedures have been performed, the method proceeds to step 36; otherwise, it reverts to step 31. Examples of false positive procedures that can be performed at step 35 include the following:
-
- [0027] The packet/stream is subjected to further analysis, e.g., it is scanned by an antivirus module or is optionally sent (with the approval of the system administrator) to the headquarters of an antivirus software company such as Symantec Corporation of Cupertino, Calif.
- [0028] The packet/stream and/or corresponding string 24 and/or corresponding thread 12 and/or corresponding process are checked for the presence of a digital signature, and the digital signature is validated as having emanated from a trusted party.
- [0029] The string is from a process 12 such as calc.exe that has been pre-cleared as a process that can be safely sent out via exit port 15. This pre-clearance information may be contained in list 3.
[0030] At step 36, malicious code mitigation procedures are performed. Such procedures may include:
-
- [0031] Deleting from computer 1 the process containing the thread 12 represented by the string 24 that was found in the packet/stream.
- [0032] Quarantining the packet/stream, the string 24, the thread 12, and/or the process.
- [0033] Repairing the malicious code.
- [0034] Preventing the packet/stream, the string 24, the thread 12, and/or the process from leaving computer 1.
[0035] The method then reverts to step 31.
[0036] The above description is included to illustrate the operation of the preferred embodiments and is not meant to limit the scope of the invention. The scope of the invention is to be limited only by the following claims. From the above discussion, many variations will be apparent to one skilled in the art that would yet be encompassed by the spirit and scope of the present invention.
Claims
What is claimed is:
1. A method for detecting malicious computer code in a host computer, the method comprising the steps of:
identifying a port of a host computer from which executable content does not normally exit the host computer;
determining whether outbound executable content is addressed to exit the identified port;
calculating hashes of strings within the outbound executable content;
comparing the calculated hashes with prestored hashes of strings stored within a runtime database of executable threads,
when outbound executable content is addressed to exit the identified port, determining whether a calculated hash matches a prestored hash, and, when a calculated hash matches a prestored hash, determining whether a string from the runtime database is present in the outbound executable content, wherein said runtime database is generated in real time by a thread analyzer that analyzes threads being executed on the host computer; and
when a string from the runtime database is present in the outbound executable content, declaring a suspicion of presence of malicious computer code in the outbound executable content.
2. The method of claim 1 wherein the outbound executable content is in the form of packets.
3. The method of claim 1 wherein the outbound executable content is stream data.
4. The method of claim 1 wherein the identified port comprises an HTTP Internet port.
5. The method of claim 1 wherein the identified port comprises port 80.
6. The method of claim 1 wherein the thread analyzer:
takes a hash of each thread being executed on the host computer; and
for each hash, stores the hash and a corresponding string from the thread in the runtime database only if the hash is not already present in the runtime database.
7. The method of claim 1 wherein the thread analyzer is coupled to a tracking module associated with a multi-threading operating system resident on the host computer.
8. The method of claim 7 wherein the tracking module comprises one of: tracker.sys and filter.sys.
9. The method of claim 1 wherein the thread analyzer creates a record for each thread that executes on the host computer, each record comprising a thread identification, a string representative of the thread, and a start address of the string.
10. The method of claim 9 wherein each string in the runtime database has a pre-established fixed length.
11. The method of claim 9 wherein each record further comprises a start address of the string, a location from the group of locations comprising a start address of the thread, and a start address following a jump instruction within the thread.
12. The method of claim 9 wherein each record further comprises a hash of the string.
13. The method of claim 12 wherein just a portion of the string is hashed.
14. The method of claim 1 wherein a suspicion of presence of malicious code in the outbound executable content is flagged to a user of the host computer.
15. The method of claim 1 wherein outbound executable content suspected of containing malicious code is subjected to a false positive mitigation procedure.
16. The method of claim 15 wherein the false positive mitigation procedure comprises checking outbound executable content for the presence of a digital signature from a trusted party.
17. The method of claim 15 wherein the false positive mitigation procedure comprises subjecting the outbound executable content to further analysis.
18. The method of claim 15 wherein the false positive mitigation procedure comprises allowing a process from a list of pre-approved processes to access the port.
19. The method of claim 18 wherein the list comprises the process calc.exe.
20. The method of claim 1 farther comprising the step of: when a string from the runtime database of executable threads is not present in the outbound executable content, allowing the outbound executable content to exit the host computer.
21. A computer-readable medium containing computer program instructions for detecting malicious computer code in data leaving a host computer, said computer program instructions for performing the steps of:
determining whether data leaving the host computer is addressed to exit a port of the host computer where outbound executable content normally does not appear;
calculating hashes of strings within the outbound executable content;
comparing the calculated hashes with prestored hashes of strings stored within a runtime database of executable threads;
when the data is addressed to exit a port where outbound executable content normally does not appear, determining whether a calculated hash matches a prestored hash, and, when a calculated hash matches a prestored hash, determining whether a string from the runtime database of executable threads is present in said data, wherein said runtime database is generated in real time by a thread analyzer that analyzes threads being executed on said host computer; and
when a string from said runtime database is present in said data, declaring a suspicion of presence of malicious computer code in said data.
22. The computer readable medium of claim 21 further comprising instructions for, when a string from the runtime database is present in the outbound executable content, performing the step of quarantining the the outbound executable content.
23. The computer readable medium of claim 21 further comprising instructions for, when a string from the runtime database is present in the outbound executable content, performing the step of repairing the outbound executable content.
24. The computer readable medium of claim 21 further comprising instructions for, when a string from the runtime database is present in the outbound executable content, performing the step of deleting from the host computer a process corresponding to a string from the runtime database that has been found to be present in the outbound executable content.
25. The computer readable medium of claim 21 further comprising instructions for, when a string from the runtime database is present in the outbound executable content, performing the step of stopping the outbound executable content from exiting the host computer.
26. The computer readable medium of claim 21 further comprising instructions for, prior to said second determining step, performing the step of decoding the outbound executable content.
27. The computer readable medium of claim 21 further comprising instructions for, prior to said second determining step, the step of ascertaining whether the outbound executable content is encoded.
28. The computer readable medium of claim 21 further comprising instructions for performing the step of specifying threads that are to be represented in the runtime database.
29. The computer readable medium of claim 21 further comprising instructions for performing the step of eliminating excess information from the runtime database.
30. The computer readable medium of claim 29 wherein the eliminating step comprises removing a string from the runtime database upon the command of an operating system executing on the host computer.
31. The computer readable medium of claim 29 wherein the eliminating step comprises removing a string from the runtime database when a thread corresponding to said string has not executed on the host computer for a preselected period of time.
32. The computer readable medium of claim 29 wherein the eliminating step comprises deleting a string from the runtime database when contents of the database exceed a pre-determined size.
33. The computer readable medium of claim 21, further comprising instructions for, when a string from the runtime database of executable threads is not present in the outbound executable content, performing the step of allowing the outbound executable content to exit the host computer.
34. The computer readable medium of claim 21 further comprising instructions for flagging to a user of the host computer a suspicion of presence of malicious code in the outbound executable content.
35. The computer readable medium of claim 21 further comprising instructions for subjecting outbound executable content suspected of containing malicious code to a false positive mitigation procedure.
36. An apparatus for detecting malicious computer code in a host computer, said apparatus comprising:
a filter adapted to determine whether data leaving the host computer is addressed to exit a port of the host computer where outbound executable content normally does not appear;
a runtime database containing strings from threads that have executed on said host computer and prestored hashes of the strings, wherein said runtime database is generated in real time by a thread analyzer that analyzes threads being executed on said host computer; and
coupled to the filter and to the runtime database, a matching module for determining whether a string from the runtime database is present in said data and whether a calculated hash matches a prestored hash.
37. The apparatus of claim 36 further comprising a thread analyzer adapted to extract strings from threads executing on the host computer, and to place said strings into said runtime database.
38. The apparatus of claim 36 further comprising:
a tracking module adapted to identify threads executing on the host computer; and
a user interface coupled to the tracking module, said user interface adapted to permit a user of the host computer to instruct the tracking module as to threads that should be tracked by said tracking module.
39. The apparatus of claim 36 further comprising, coupled to the runtime database, a garbage collector module for periodically purging contents of said runtime database.
Patent Citations (91)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5398196(A) | 1995-03-01 | Chambers | Applicant |
| US5452442(A) | 1995-09-01 | Kephart | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5572590(A) | 1996-11-01 | Chess | Applicant |
| US5675710(A) | 1997-10-01 | Lewis | Applicant |
| US5694569(A) | 1997-12-01 | Fischer | Applicant |
| US5826249(A) | 1998-10-01 | Skeirik | Applicant |
| US5832208(A) | 1998-11-01 | Chen et al. | Applicant |
| US5832527(A) | 1998-11-01 | Kawaguchi | Applicant |
| US5854916(A) | 1998-12-01 | Nachenberg | Applicant |
| US5884033(A) | 1999-03-01 | Duvall et al. | Examiner |
| US5944821(A) | 1999-08-01 | Angelo | Applicant |
| US5974549(A) | 1999-10-01 | Golan | Applicant |
| US6006242(A) | 1999-12-01 | Poole et al. | Applicant |
| US6021510(A) | 2000-02-01 | Nachenberg | Applicant |
| US6023723(A) | 2000-02-01 | McCormick et al. | Applicant |
| US6052709(A) | 2000-04-01 | Paul | Applicant |
| US6072942(A) | 2000-06-01 | Stockwell et al. | Applicant |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6092194(A) | 2000-07-01 | Touboul | Applicant |
| US6094731(A) | 2000-07-01 | Waldin et al. | Applicant |
| US6119236(A) | 2000-09-01 | Shipley | Examiner |
| US6125459(A) | 2000-09-01 | Andoh et al. | Applicant |
| US6161130(A) | 2000-12-01 | Horvitz et al. | Applicant |
| US6167434(A) | 2000-12-01 | Pang | Applicant |
| US6253169(B1) | 2001-06-01 | Apte et al. | Applicant |
| US6298351(B1) | 2001-10-01 | Castelli et al. | Applicant |
| US6347310(B1) | 2002-02-01 | Passera | Applicant |
| US6370526(B1) | 2002-04-01 | Agrawal et al. | Applicant |
| US6397200(B1) | 2002-05-01 | Lynch et al. | Applicant |
| US6397215(B1) | 2002-05-01 | Kreulen et al. | Applicant |
| US6401122(B1) | 2002-06-01 | Matsui et al. | Applicant |
| US6421709(B1) | 2002-07-01 | McCormick et al. | Applicant |
| US6424960(B1) | 2002-07-01 | Lee et al. | Applicant |
| US6442606(B1) | 2002-08-01 | Subbaroyan et al. | Applicant |
| US6456991(B1) | 2002-09-01 | Srinivasa et al. | Applicant |
| US6493007(B1) | 2002-12-01 | Pang | Applicant |
| US6502082(B1) | 2002-12-01 | Toyama et al. | Applicant |
| US6505167(B1) | 2003-01-01 | Horvitz et al. | Applicant |
| US6546416(B1) | 2003-04-01 | Kirsch | Applicant |
| US6721721(B1) | 2004-04-01 | Bates et al. | Applicant |
| US6751789(B1) | 2004-06-01 | Berry et al. | Examiner |
| US6772346(B1) | 2004-08-01 | Chess et al. | Applicant |
| US6842861(B1) | 2005-01-01 | Cox et al. | Applicant |
| US6886099(B1) | 2005-04-01 | Smithson et al. | Applicant |
| US6931540(B1) | 2005-08-01 | Edwards et al. | Examiner |
| US6944555(B2) | 2005-09-01 | Blackett et al. | Examiner |
| US6952779(B1) | 2005-10-01 | Cohen et al. | Applicant |
| US6973578(B1) | 2005-12-01 | McIchionc | Applicant |
| US7024403(B2) | 2006-04-01 | Kyler | Applicant |
| US2002/0035693(A1) | 2002-03-01 | Eyres et al. | Applicant |
| US2002/0038308(A1) | 2002-03-01 | Cappi | Applicant |
| US2002/0046207(A1) | 2002-04-01 | Chino et al. | Applicant |
| US2002/0059078(A1) | 2002-05-01 | Valdes et al. | Examiner |
| US2002/0073046(A1) | 2002-06-01 | David | Applicant |
| US2002/0087649(A1) | 2002-07-01 | Horvitz | Applicant |
| US2002/0138525(A1) | 2002-09-01 | Karadimitriou et al. | Applicant |
| US2002/0144156(A1) | 2002-10-01 | Copeland, III | Examiner |
| US2002/0147694(A1) | 2002-10-01 | Dempsey et al. | Applicant |
| US2002/0147782(A1) | 2002-10-01 | Dimitrova et al. | Applicant |
| US2002/0178375(A1) | 2002-11-01 | Whittaker et al. | Applicant |
| US2002/0194488(A1) | 2002-12-01 | Cormack et al. | Applicant |
| US2002/0194489(A1) | 2002-12-01 | Almogy et al. | Applicant |
| US2002/0199186(A1) | 2002-12-01 | Ali et al. | Applicant |
| US2002/0199194(A1) | 2002-12-01 | Ali | Applicant |
| US2003/0023875(A1) | 2003-01-01 | Hursey et al. | Applicant |
| US2003/0033587(A1) | 2003-02-01 | Ferguson et al. | Applicant |
| US2003/0061287(A1) | 2003-03-01 | Yu et al. | Applicant |
| US2003/0065926(A1) | 2003-04-01 | Schultz et al. | Applicant |
| US2003/0110280(A1) | 2003-06-01 | Hinchliffe et al. | Applicant |
| US2003/0110393(A1) | 2003-06-01 | Brock et al. | Applicant |
| US2003/0110395(A1) | 2003-06-01 | Presotto et al. | Examiner |
| US2003/0115458(A1) | 2003-06-01 | Song | Applicant |
| US2003/0115479(A1) | 2003-06-01 | Edwards et al. | Applicant |
| US2003/0140049(A1) | 2003-07-01 | Radatti | Examiner |
| US2003/0145213(A1) | 2003-07-01 | Carbone | Examiner |
| US2003/0154394(A1) | 2003-08-01 | Levin | Applicant |
| US2003/0167402(A1) | 2003-09-01 | Stolfo et al. | Applicant |
| US2003/0233352(A1) | 2003-12-01 | Baker | Applicant |
| US2004/0015554(A1) | 2004-01-01 | Wilson | Applicant |
| US2004/0039921(A1) | 2004-02-01 | Chuang | Applicant |
| US2004/0103310(A1) | 2004-05-01 | Sobel et al. | Applicant |
| US2004/0117401(A1) | 2004-06-01 | Miyata et al. | Applicant |
| US2004/0117641(A1) | 2004-06-01 | Kennedy et al. | Examiner |
| US2004/0220975(A1) | 2004-11-01 | Carpentier et al. | Applicant |
| EP636977(A2) | 1995-02-01 | Applicant | |
| EP1408393(A2) | 2004-04-01 | Applicant | |
| WO93/25024(A1) | 1993-12-01 | Applicant | |
| WO99/15966(A1) | 1999-04-01 | Applicant | |
| WO/28420(A2) | 2000-05-01 | Applicant | |
| WO2/33525(A2) | 2002-04-01 | Applicant |
Non-Patent Literature (11)
- Nachenberg, Carey, “Behavior Blocking: The Next Step in Anti-Virus Protection,” Mar. 19, 2002, pp. 1-5.Examiner
- Burchell, Jonathan, “NetShield 1.5”, Virus Bulletin, Aug. 1994, pp. 21-23, XP 000617453.Applicant
- Morar, J. E. and Chess, D. M., “Can Cryptography Prevent Computer Viruses?”, Virus Bulletin Conference 2000, Sep. 2000, pp. 127-138, Virus Bulletin Ltd., Oxfordshire, England.Applicant
- Wikipedia.org web pages [online], Wikipedia, [retrieved Mar. 17, 2003] Retrieved from the Internet: <ULR: http://www.wikipedia.org/w/wiki.phintl?title=machine learning and printable=yes>.Applicant
- Outlook.spambully.com web pages [online] Spam Bully [retrieved Jan. 16, 2003] Copyright 2002, Retrieved from the Internet <URL: http://outlook.spambully.com/about.php>.Applicant
- “Enterprise Protection Strategy” [online] Trend Micro Inc. [retrieved Dec. 3, 2002] Retrieved from the Internet: <URL: http://www.trendmicro.com/en/products/eps/features/htm>.Applicant
- “How to Test Outbreak Commander”, :Trend Micro Inc., Aug. 2002, pp. 1-13, Cupertino, CA.Applicant
- Choi, Yang-Seo, et al., “A New Stack Buffer Overflow Hacking Defense Technique with Memory Address Confirmation”, Lecture Notes in Computer Science 2288, 2002, pp. 146-159, Springer Verlog, Berlin and Heidelsberg, Germany.Applicant
- Chew, Monica and Dawn Song, “Mitigating Buffer Overflows by Operating System Randomization”, Dec. 2000, pp. 1-9, U.C. Berkeley, CA USA.Applicant
- Bolosky, W., Corbin, S., Goebel, D., and Douceur, J., “Single Instance Storage in Windows 2000”, Microsoft Research, Balder Technology Group, Inc., [online] [retrieved Oct. 11, 2002] Retrieved from the Internet <URL: http://research.microsoft. com/sn/farsite/wss2000.pdf>.Applicant
- Bontchev, Vesselin, “Possible Macro Virus Attacks and How to Prevent Them”, Computer & Security, vol. 15, No. 7, pp. 595-626, 1996.Applicant