US 7,594,271 B2Grant
Method and system for real-time tamper evidence gathering for software
Issue Date:2009-09-22
•17 Claims
•6 Drawing Sheets
Abstract
A method and system are directed to differentiating between normal characteristics and abnormal characteristics within a software process, such that tampering of the software process may be identified programmatically. The identification of behavior that may be defined as normal may vary. Such behavior may include a sequence of selected system level calls that may access resources considered relevant, and the like. Data on the selected behavior is gathered, and when a sufficient amount of abnormal behavior has been detected, a signal may be provided such that an action may be performed. Samples of the gathered data are assigned a unique value. Statistical information is determined from the collected behavior, including trend data. Such trend data is compared to trends identified as normal for the software process, and a determination is made whether the sampled behavior is non-normal.
Metadata
Assignee
- Widevine Technologies, Inc.
Inventors
- Oscar V. Zhuk
- Vince M. Rohr
Application Information
Application Number:US 10/668,046
Filing Date:2003-09-22
Priority Date:2002-09-20
Art Unit:2432
Classifications
IPC:
G06F21/00
Patent Drawings (6 sheets)
Description
Related Applications
[0001] This application claims the benefit of U.S. Provisional Application No. 60/412,265 filed on Sep. 20, 2002, which is hereby claimed under 35 U.S.C. §119(e).
Field of the Invention
[0002] The present invention relates generally to verifying software functional or procedural integrity, and determining whether a software process is not functioning normally.
Background of the Invention
[0003] The software industry relies on virtually billions of lines of software to work as expected. Companies write code, sell code, and rely on processes embodied in the code that is distributed. Unfortunately, once the code leaves the control of the developing company, the code can often be changed or used outside of the context that it was intended.
[0004] For example, some software vendors distribute products for playing video or audio files on a user's computer. Some of these packages have internal protection mechanisms that allow video or audio to be protected when used in conjunction with this product. Unfortunately, if a user inserts their own code into the product, or runs another piece of software that captures the computer screen as a movie, they can obtain a copy of the content being played. This is not something that most vendors would like to see occur. Unfortunately, this action currently is outside the context of vendor's product and cannot be easily detected using available technology.
[0005] Thus, it is with respect to these considerations and others that the present invention has been made.
Brief Description of the Drawings
[0006] Non-limiting and non-exhaustive embodiments of the present invention are described with reference to the following drawings. In the drawings, like reference numerals refer to like parts throughout the various figures unless otherwise specified.
[0007] For a better understanding of the present invention, reference will be made to the following Detailed Description of the Preferred Embodiment, which is to be read in association with the accompanying drawings, wherein:
[0008] FIG. 1 illustrates an exemplary environment in which the present invention may be practiced;
[0009] FIG. 2 illustrates a flow diagram showing one embodiment for a process of determining real-time tamper evidence of a software process;
[0010] FIG. 3 illustrates an example of a general Chaos Game Representation (CGR) plot with a possible pattern for a consequence vector, Ap;
[0011] FIG. 4 illustrates an example of a possible pattern vector, Pp, where system calls frequencies are substantially equal; and
[0012] FIG. 5 illustrates one embodiment of a computer in which a tamper detector operates, in accordance with the present invention.
Detailed Description of the Preferred Embodiment
[0013] In the following detailed description of exemplary embodiments of the invention, reference is made to the accompanied drawings, which form a part hereof, and which is shown by way of illustration, specific exemplary embodiments of which the invention may be practiced. Each embodiment is described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the invention. The following detailed description is, therefore, not to be taken in a limiting sense.
[0014] Throughout the specification, the term “connected” means a direct connection between the things that are connected, without any intermediary devices or components. The term “coupled” means a direct connection either between the things that are connected, or an indirect connection through one or more passive or active intermediary devices or components. The meaning of “a,” “an,” and “the” include plural references. The meaning of “in” includes “in” and “on.”
[0015] The present invention is directed at providing a method and system for differentiating between normal operational characteristics and abnormal (also called non-normal) operational characteristics such that software product tampering may be identified programmatically. Additionally, the invention provides for a variance for identification of behavior that is defined to be within the realm of normal user behavior.
[0016] It has been determined that abnormal behavior may be considered that behavior that is not normal behavior. Detection of normal behavior provides for the ability to detect abnormal behavior. Data is gathered and when a sufficient amount of abnormal behavior has been detected, a signal may be provided such that any of a variety of actions may be performed. Such actions may include, but is not limited to, providing an alert message to a software provider, providing a warning message, shutting down a computing device, software process, and the like.
[0017] The invention obtains samples of predetermined traits needed to monitor the software for evidence of tampering. In most cases, this equates to a select number of system level calls that access resources that may be considered important, such as reading and writing to hard drives, memory, network resources, and the like.
[0018] Each predetermined trait is assigned a unique number. When a piece of software is running, it produces a stream of data identifying when predetermined traits that need to be monitored are utilized. Each predetermined trait is summarized from the data and statistical information about a trend associated with each trait may be produced.
[0019] The trends of the predetermined traits are compared to identified good trends to determine if they are normal. If there is not enough data to determine the trend of the traits exhibited, the result will be that the behavior is unknown. When there is enough data to make a determination, then the result may be normal or abnormal.
Operating Environment
[0020] FIG. 1 shows a schematic block diagram of an exemplary system-operating environment that benefits from the teachings of the present invention. The system includes a server 101, a client 103, and a network 102. The client 103 is coupled to the network, and the server is coupled to the network. The client 103 includes an example application 104 that the integrity is to be determined.
[0021] The client 103 may be a computing device, such as portable computer, desktop computer, personal digital assistant (PDAs), a media player, or other similar device that a software application may be exposed to tampering. One embodiment of client 103 is described in more detail below, in conjunction with FIG. 5 . Similarly, the server 101 may be any of a variety of similar devices that is arranged to communicate through the network 102 to the client 103.
[0022] The network 102 can employ any form of computer readable media for communicating information from one electronic device to another. Also, network 102 can include the Internet in addition to local area networks (LANs), wide area networks (WANs), direct connections, such as through a universal serial bus (USB) port, other forms of computer-readable media, or any combination thereof. On an interconnected set of LANs, including those based on differing architectures and protocols, a router acts as a link between LANs, enabling messages to be sent from one to another. Also, communication links within LANs typically include twisted wire pair or coaxial cable, while communication links between networks may utilize analog telephone lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, or other communications links known to those skilled in the art. Furthermore, remote computers and other related electronic devices can be remotely connected to either LANs or WANs via a modem and temporary telephone link. A remote computer may act in a number of ways, including as a WWW (content) server or a client with a browser application program.
[0023] In FIG. 1 , the client 103 is in communication with the network 102 and provides for transmitting application 104 user profiles, software process behavioral information, trait data, and the like, to the server 101. However, the present invention is not limited to network connectivity. For example, the verification of the integrity of application 104 may be performed by components on client 103 without requiring network connectivity.
[0024] Therefore, the operating environment shown in FIG. 1 is only one example of a suitable operating environment and is not intended to suggest any limitation as to the scope of use, or functionality of the invention. Other well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
[0025] FIG. 5 illustrates one embodiment of a computer in which a tamper detector operates according to one embodiment of the invention. Computer 500 illustrates one embodiment of client 103 shown in FIG. 1 . Computer 500 may also be employed to illustrate one embodiment of server 101 shown in FIG. 1 . Computer 500 may include many more components than those shown. The components shown, however, are sufficient to disclose an illustrative embodiment for practicing the invention.
[0026] Computer 500 includes processing unit 512, video display adapter 514, and a mass memory, all in communication with each other via bus 522. The mass memory generally includes RAM 516, ROM 532, and one or more permanent mass storage devices, such as hard disk drive 528, tape drive, optical drive, and/or floppy disk drive. The mass memory stores operating system 520 for controlling the operation of computer 500. Any general-purpose operating system may be employed. Basic input/output system (“BIOS”) 518 is also provided for controlling the low-level operation of computer 500.
[0027] As illustrated in FIG. 5 , computer 500 also can communicate with the Internet, or some other communications network, such as network 102 in FIG. 1 , via network interface unit 510, which is constructed for use with various communication protocols including the TCP/IP protocol. Network interface unit 510 is sometimes known as a transceiver or transceiving device.
[0028] The mass memory as described above illustrates another type of computer-readable media, namely computer storage media. Computer storage media may include volatile, nonvolatile, removable, and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. Examples of computer storage media include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computing device.
[0029] In one embodiment, the mass memory stores program code and data for implementing operating system 520. The mass memory may also store additional program code and data for performing the functions of computer 500, and tamper detector 502. One or more applications, such as application 104 when computer 500 is employed to illustrate client 103 of FIG. 1 , tamper detector 502, and the like, may be loaded into mass memory and run on operating system 520.
[0030] While computer 500 illustrates tamper detector 502 as a component, the present invention is not so limited. For example, tamper detector 502 may operate within a server, such as server 101 in FIG. 1 . Tamper detector 502 may also be decomposed into several components, some of which operate within a server, and other components may operate within a client, without departing from the scope of the present invention.
[0031] Computer 500 may also include an SMTP handler application for transmitting and receiving e-mail, an HTTP handler application for receiving and handing HTTP requests, and an HTTPS handler application for handling secure connections. The HTTPS handler application may initiate communication with an external application in a secure fashion.
[0032] Computer 500 also includes input/output interface 524 for communicating with external devices, such as a mouse, keyboard, scanner, or other input devices not shown in FIG. 5 . Likewise, computer 500 may further include additional mass storage facilities such as CD-ROM/DVD-ROM drive 526 and hard disk drive 528. Hard disk drive 528 is utilized by computer 500 to store, among other things, application programs, databases, and the like.
Generalized Operation
[0033] Described below is one embodiment of a process flow for employing graphical representations, such as chaos game representations, and the like, for evaluating evidence of tampering of software.
[0034] The process begins by determining the main components related to the application processes of interest.
[0035] Virtually every application process may be considered as a set of system calls, which include organized system sequences, and which may be ranked by a limited length. When comparing two different data sets, where one represents the pattern and the other data set represents a prototype, the process employs two major components of that data, Consequence and Frequency. Comparing the two different data sets includes a comparison of consequences and frequencies of certain system calls. However, the present invention is not limited to consequence and frequency, and other components of the data may be employed without departing from the scope of the invention.
[0036] The terms “pattern,” “pattern data,” and the like, refer to a set of data that represents a behavior that is determined to be normal for a given software process, application, and the like. The terms, “prototype,” “prototype data,” and the like refer to another set of data that represents a behavior of the given software process, application, and the like. Prototype data may be compared to the pattern data to determine whether the software process is considered to have been tampered with.
Creating a Fingerprint as a Consequence Pattern
[0037] The process begins by calculating consecutive data for a sequence of file system calls for what is considered to be an unhacked (normal) application process. Various approaches related to graphing representations, and the like, may be employed for analyzing the data. In one embodiment Chaos Game Representation (CGR) is employed to convert the calculated data to CGR dot-data. The obtained CGR dot-data is then converted to the radius-vector data as a fingerprint.
[0038] Vector analysis rules are employed for processing the data. Newly created radius vectors are substituted with just one as a pattern from the fingerprint. The pattern is then trained for better matching the real situation.
[0039] When the created vector becomes saturated or matured, the X and Y coordinates of the ending point of the created vector (the origin point of the created vector already has (0, 0) coordinates assigned by default) are retained. A general condition that may indicate that the vector is saturated and mature includes the event when a difference between two measurements of sequence errors, ER1 and ER2, for substantially the same pattern or prototype is equal to or less then a preliminary assigned value Val:
|ER1−ER2|<=Val
|ER1−ER2|<=Val
[0040] Next, the process verifies the vector stability through the next 50-100 new system calls. When the vector stability is verified, the number of system calls is assigned to one vector, and the process starts again at creating new dot-data until the new vector is generated. Once the stable vector has been processed, the statistics are reinitialized in preparation for the next vector. By continuing the process, a sequence of vectors is created, which represent all changes in the sequence of the data that have occurred.
Creating a Fingerprint as a Frequency Pattern
[0041] A fingerprint for the frequency pattern data may be obtained by calculating a sum of substantially every type of system call that appears in the data processing as well as the total number of system calls that are made.
[0042] A vector is created by adding up all of the average directional vectors. FIG. 3 illustrates an example of a general Chaos Game Representation (CGR) plot with a possible pattern for a consequence vector.
[0043] The maximal range of such determined values of system calls as Write, Read, Seek, or the like is obtained. These are retained as pattern values.
[0044] The process continues to create the new data until the next saturated and mature vector representing the consequence pattern appears. Continuing the process, the sequence of patterns is created, which represent substantially all changes of frequency in the data that happened virtually in real time to each kind of the system calls.
Creating Fingerprints in Real Time as the Prototypes to Consequence and Frequency Patterns
[0045] The process continues by calculating the consequence data of the file system calls and frequency numbers for the tested application virtually in real time. The process steps described above for the creating of consequence and frequency patterns are continued.
Decision-Making
[0046] The process next creates a way of analyzing and comparing the real time data to the pattern data. The process runs the decision engine to obtain the results. Each pattern, created as described above, is created separately for the applications of any known kinds and any known computer platforms the user might use and for which the integrity is sought.
[0047] FIG. 2 illustrates the stages for the four independent processes that are employed for obtaining the results.
Consequence Pattern and Prototype Creation
[0048] Initially, the Chaos Game Representation (CGR) scatter plot is determined. Next, the process creates the X and Y coordinates axis through the center of the circle. An assumption may be made that virtually every point is considered as a radius vector representative with the origin (0, 0) point.
[0049] The set of the created vectors is considered as a fingerprinting field for the patterns. To create a pattern-vector Ap and keep it in the unit circle range the process determines the average sum of all vectors.
[0050] Aj(j=1,N) created on the CGR:
[0051]
where N is a number of all points in the CGR.
where N is a number of all points in the CGR.
[0052] In coordinates form, the Ap vector is:
Ap{Xp,Yp}
Ap{Xp,Yp}
[0053]
[0054] The new obtained vector Ap inherits the information from each of the N vectors. The previously created vectors (or points) are substituted with one newly created vector Aj with Xp and Yp coordinates. The new vector, Ap, accumulates substantially all sets of behaviors represented by the CGR. Thus, only one radius vector coordinates are retained for each created pattern rather than thousand of points. This improves the efficiency of memory usage and software performance. The process of obtaining the pattern-vector requires fewer computer operations such as additions.
Frequency Pattern and Prototype Creation
[0055] The process for creating frequency patterns or prototypes is described above. The process calculates and cumulates the sum for virtually each type of happened system calls for each sample of given length.
[0056] A CGR is created employing the following process. Typically, the number of points K that are equal to or less than the number of possible or chosen system calls is employed. Virtually every new calculated point for virtually each kind of system call may be located on the line between center and a point on the circle surface that represent this kind of system call. Virtually every point represents the vector vertices at the given direction (same as an angle).
[0057] The length L1 of the newly created vector represents the frequency of its appearance and can be determined from the formula:
[0058]
where TNC is a total number of system calls, Pi is a single point, and M is a total number of calculated points for this type of system call.
where TNC is a total number of system calls, Pi is a single point, and M is a total number of calculated points for this type of system call.
[0059] Furthermore,
[0060]
[0061] In creating a pattern vector Pp (employing substantially the same approach for the prototype vector) an average sum of all vectors Pj (j=1, K) created on the CGR is determined:
[0062]
where K is a number of all system calls (vectors) in the CGR. In the coordinate form, the Pp vector substantially is:
Pp{Xp,Yp}
where K is a number of all system calls (vectors) in the CGR. In the coordinate form, the Pp vector substantially is:
Pp{Xp,Yp}
[0063]
[0064] The newly obtained vector Pp inherits the information from the K vectors. FIG. 4 illustrates an example of a possible pattern vector, Pp, where system calls frequencies are substantially equal. In the example shown in FIG. 4 , K=5.
Determining Normal from Non-Normal Behavior
[0065] When incoming data with real time points needs to be processed, the fingerprinting fields of the consequence vector-prototype and the frequency vector-prototype are produced. These are compared to the corresponding vectors-pattern. Analyzing the results, a final decision may be determined.
[0066] The process, which is virtually the same for all comparisons, is given below.
[0067] Two different vectors Ap and Bpr are compared by their norms and angle between the vectors. The formula for determining the angle between the two given vectors Ap and Bpr can be represented as the following:
[0068]
[0069] Consideration is typically given to the upper (nominator) part of the given fraction because it has practical influence on the preliminary results of analysis and more weight for the further decisions. For example, the following three situations may arise, where the nominators could be as the following:
X1*X2+Y1*Y2=0 1.
X1*X2+Y1*Y2<0 2.
X1*X2+Y1*Y2>0 3.
X1*X2+Y1*Y2=0 1.
X1*X2+Y1*Y2<0 2.
X1*X2+Y1*Y2>0 3.
[0070] Equation 1 above illustrates that an angle between vectors Ap and Bpr is 90 degrees and vectors are perpendicular.
[0071] Equation 2 above illustrates that vectors Ap and Bpr have an opposite direction.
[0072] Equations 1 and 2 thus illustrate that substantial abnormality, and as such are ready for a decision to be determined. Equation 3 above illustrates a final decision, and is explained below.
[0073] One approach for determining normal from non-normal behavior with respect to equation 3 above that enables reasonable and confident results is described next.
[0074] The approach begins by determining a norm N1 of vectors Ap and Bpr sum:
N1=|Ap+Bpr|=√{square root over ((X1+X2)2+(Y1+Y2)2)}{square root over ((X1+X2)2+(Y1+Y2)2)}.
N1=|Ap+Bpr|=√{square root over ((X1+X2)2+(Y1+Y2)2)}{square root over ((X1+X2)2+(Y1+Y2)2)}.
[0075] Next, a norm N2 of vectors Ap and Bpr difference is determined as:
N2=|Ap−Bpr|=√{square root over ((X1−X2)2+(Y1−Y2)2)}{square root over ((X1−X2)2+(Y1−Y2)2)}
N2=|Ap−Bpr|=√{square root over ((X1−X2)2+(Y1−Y2)2)}{square root over ((X1−X2)2+(Y1−Y2)2)}
[0076] It is then determined how vectors Ap and Bpr are similar by using their directions:
E1=1−(N1−N2)/N1=N2/N1.
E1=1−(N1−N2)/N1=N2/N1.
[0077] The norm Np and Npr of vectors Ap and Bpr are determined by:
Np=√{square root over (X12+Y12)}
Npr=√{square root over (X22+Y22)}.
Np=√{square root over (X12+Y12)}
Npr=√{square root over (X22+Y22)}.
[0078] Similarity of vectors Ap and Bpr may be determined by employing their lengths, using the following equation:
E2=|Np−Npr|/Np.
E2=|Np−Npr|/Np.
[0079] One way to determine a total difference, ER, between vectors Ap and Bpr may also be represented as:
ER=max(E1,E2).
ER=max(E1,E2).
[0080] The total difference may also be represented by a percentage measurement, as:
ER %=max(E1,E2)*100%.
ER %=max(E1,E2)*100%.
[0081] Next, a Confidence level, CL, or fitting Probability, FP, may be determined by:
CL=FP=1−ER.
CL=FP=1−ER.
[0082] Similarly, a percentage of the confidence level may be determined as:
CL %=FP %=100%−ER %.
CL %=FP %=100%−ER %.
[0083] Now, if the value for the confidence level shows that the maximum difference between vectors Ap and Bpr, and their direction, can be trusted, then a determination may be made as whether the process's behavior is normal or non-normal. For determining a final result, a comparison between one of a priori set values, mentioned above, and one of obtained set values during the newest calculation such as ER, or ER % or CL, or FP, or CL %, or FP %, may be performed.
[0084] A degree of trust may be obtained for the result based in part on the maximal error. Thus, for example, if the maximal error calculated is inside or on the border of the preliminary assigned error interval, the result may be determined to indicate normal behavior of the software process.
[0085] When the results of all comparisons (say 2×3=6) are obtained, then the process creates the procedure for the final decision.
[0086] While the above disclosure employed Chaos Game Representations, those skilled in the art will recognize that the invention is not limited to such implementation and other graphical representation schemes may be employed without departing from the scope or spirit of the invention.
[0087] The above specification, examples, and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.
Claims
We claim:
1. A method for verifying integrity of a computing process, comprising:
determining a trait associated with the computing process;
determining a pattern statistic associated with the trait based in part on an execution of the computing process in a normal condition, wherein determining the pattern statistic further comprises:
determining consecutive data associated with the trait;
employing a graphical representation to convert the consecutive data to a radius-vector;
if the radius-vector is mature, retaining an endpoint coordinate associated with the radius-vector;
determining a frequency pattern associated with the trait; and
employing the graphical representation in part to convert the frequency pattern to an average directional vector;
determining a prototype statistic associated with the trait based in part on another execution of the computing process in another condition;
comparing the pattern statistic to the prototype statistic; and
if the comparison indicates abnormal behavior the computing process, performing a predetermined action.
2. The method of claim 1, wherein performing the predetermined action further comprises performing at least one of sending an alert message, and disabling the computing process.
3. The method of claim 1, wherein the trait further comprises at least one system level call.
4. The method of claim 1, wherein determining the pattern statistic and the prototype statistic further comprises:
determining a trend associated with the trait during execution of the computing process in the normal condition; and
determining another trend associated with the trait during the other execution of the computing process in the other condition.
5. The method of claim 1, wherein comparing the pattern statistic to the prototype statistic further comprises comparing the frequency pattern and a consequence associated with the pattern statistic to another frequency pattern and another consequence associated with the prototype statistic.
6. The method of claim 1, wherein the mature radius-vector further comprises satisfying a condition wherein an absolute difference between a first sequence error and a second sequence error is less than or equal to a predetermined value.
7. The method of claim 1, wherein employing the graphical representation further comprises employing a chaos game representation (CGR) plot.
8. The method of claim 1, wherein comparing the pattern statistic to the prototype statistic further comprises comparing a vector norm and angle to another vector norm and another angle.
9. The method of claim 1, wherein comparing the pattern statistic to the prototype statistic further comprises:
determining a pattern vector associated with the pattern statistic, wherein the pattern vector includes a direction and length;
determining a prototype vector associated with the prototype statistic, wherein the prototype vector includes another direction and another length;
determining a total difference between the pattern vector and the prototype vector; and
if the total difference is outside a predetermined confidence level, indicating that the prototype statistic is associated with abnormal behavior.
10. An apparatus encoded with computer-executable components for determining tamper evidence of a client process, comprising:
a transceiver arranged to receive and forward data;
a processor, coupled to the transceiver, having instructions arranged to perform actions, including:
determining a trait associated with the client process;
receiving a first set of data associated with the trait based in part on execution of the client process in a normal condition;
receiving a second set of data associated with the trait based in part on another execution of the client process in another condition;
determining a pattern statistic associated with the first set of data, wherein determining the pattern statistic further comprises:
determining consecutive data associated with the trait;
employing a graphical representation to convert the consecutive data to a radius-vector;
if the radius-vector is mature, retaining an endpoint coordinate associated with the radius-vector;
determining a frequency pattern associated with the trait; and
employing the graphical representation to convert the frequency pattern to an average directional vector;
determining a prototype statistic associated with the second set of data;
comparing the pattern statistic to the prototype statistic; and
if the comparison indicates abnormal behavior of the client process, performing a predetermined action.
11. The apparatus of claim 10, wherein the computer-executable components reside in at least one of a server, and a client.
12. The apparatus of claim 10, wherein performing the predetermined action further comprises performing at least one of sending an alert message, and disabling the client process.
13. The apparatus of claim 10, wherein the trait further comprises at least one system level call.
14. The apparatus of claim 10, wherein determining the pattern statistic and the prototype statistic further comprises:
determining a trend associated with the trait during execution of the client process in the normal condition; and
determining another trend associated with the trait during the other execution of the client process in the other condition.
15. The apparatus of claim 10, wherein the mature radius-vector further comprises satisfying a condition wherein an absolute difference between a first sequence error and a second sequence error is less than or equal to a predetermined value.
16. The apparatus of claim 10, wherein employing the graphical representation further comprises a chaos game representation (CGR) plot.
17. The apparatus of claim 10, wherein comparing the pattern statistic to the prototype statistic further comprises:
determining a pattern vector associated with the pattern statistic;
determining a prototype vector associated with the prototype statistic;
determining a total difference between the pattern vector and the prototype vector; and
if the total difference is outside a predetermined confidence level, indicating that the prototype statistic is associated with abnormal behavior.
Patent Citations (104)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4535355(A) | 1985-08-01 | Arn et al. | Applicant |
| US4694489(A) | 1987-09-01 | Frederiksen | Applicant |
| US5067035(A) | 1991-11-01 | Kudelski et al. | Applicant |
| US5134656(A) | 1992-07-01 | Kudelski | Applicant |
| US5144663(A) | 1992-09-01 | Kudelski et al. | Applicant |
| US5375168(A) | 1994-12-01 | Kudelski | Applicant |
| US5539450(A) | 1996-07-01 | Handelman | Applicant |
| US5590200(A) | 1996-12-01 | Nachman et al. | Applicant |
| US5592212(A) | 1997-01-01 | Handelman | Applicant |
| US5621799(A) | 1997-04-01 | Katta et al. | Applicant |
| US5640546(A) | 1997-06-01 | Gopinath et al. | Applicant |
| US5666412(A) | 1997-09-01 | Handelman et al. | Applicant |
| US5684876(A) | 1997-11-01 | Pinder et al. | Applicant |
| US5758257(A) | 1998-05-01 | Herz et al. | Applicant |
| US5774527(A) | 1998-06-01 | Handelman et al. | Applicant |
| US5774546(A) | 1998-06-01 | Handelman et al. | Applicant |
| US5799089(A) | 1998-08-01 | Kuhn et al. | Applicant |
| US5805705(A) | 1998-09-01 | Gray et al. | Applicant |
| US5870474(A) | 1999-02-01 | Wasilewski et al. | Applicant |
| US5878134(A) | 1999-03-01 | Handelman et al. | Applicant |
| US5883957(A) | 1999-03-01 | Moline et al. | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5910987(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5915019(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5917912(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5920625(A) | 1999-07-01 | Davies | Applicant |
| US5920861(A) | 1999-07-01 | Hall et al. | Applicant |
| US5922208(A) | 1999-07-01 | Demmers | Applicant |
| US5923666(A) | 1999-07-01 | Gledhill et al. | Applicant |
| US5933498(A) | 1999-08-01 | Schneck et al. | Applicant |
| US5939975(A) | 1999-08-01 | Tsuria et al. | Applicant |
| US5943422(A) | 1999-08-01 | Van Wie et al. | Applicant |
| US5949876(A) | 1999-09-01 | Ginter et al. | Applicant |
| US5982891(A) | 1999-11-01 | Ginter et al. | Applicant |
| US5991399(A) | 1999-11-01 | Graunke et al. | Applicant |
| US6009116(A) | 1999-12-01 | Bednarek et al. | Applicant |
| US6009401(A) | 1999-12-01 | Horstmann | Applicant |
| US6009525(A) | 1999-12-01 | Horstmann | Applicant |
| US6021197(A) | 2000-02-01 | von Willich et al. | Applicant |
| US6035037(A) | 2000-03-01 | Chaney | Applicant |
| US6038433(A) | 2000-03-01 | Vegt | Applicant |
| US6049671(A) | 2000-04-01 | Slivka et al. | Applicant |
| US6055503(A) | 2000-04-01 | Horstmann | Applicant |
| US6073256(A) | 2000-06-01 | Sesma | Applicant |
| US6112181(A) | 2000-08-01 | Shear et al. | Applicant |
| US6138119(A) | 2000-10-01 | Hall et al. | Applicant |
| US6157721(A) | 2000-12-01 | Shear et al. | Applicant |
| US6178242(B1) | 2001-01-01 | Tsuria | Applicant |
| US6185683(B1) | 2001-02-01 | Ginter et al. | Applicant |
| US6189097(B1) | 2001-02-01 | Tycksen, Jr. et al. | Applicant |
| US6191782(B1) | 2001-02-01 | Mori et al. | Applicant |
| US6226794(B1) | 2001-05-01 | Anderson, Jr. et al. | Applicant |
| US6237786(B1) | 2001-05-01 | Ginter et al. | Applicant |
| US6240185(B1) | 2001-05-01 | Van Wie et al. | Applicant |
| US6247950(B1) | 2001-06-01 | Hallam et al. | Applicant |
| US6253193(B1) | 2001-06-01 | Ginter et al. | Applicant |
| US6256668(B1) | 2001-07-01 | Slivka et al. | Applicant |
| US6272636(B1) | 2001-08-01 | Neville et al. | Applicant |
| US6285985(B1) | 2001-09-01 | Horstmann | Applicant |
| US6292569(B1) | 2001-09-01 | Shear et al. | Applicant |
| US6298441(B1) | 2001-10-01 | Handelman et al. | Applicant |
| US6314409(B2) | 2001-11-01 | Schneck et al. | Applicant |
| US6314572(B1) | 2001-11-01 | LaRocca et al. | Applicant |
| US6334213(B1) | 2001-12-01 | Li | Applicant |
| US6363488(B1) | 2002-03-01 | Ginter et al. | Applicant |
| US6389402(B1) | 2002-05-01 | Ginter et al. | Applicant |
| US6405369(B1) | 2002-06-01 | Tsuria | Applicant |
| US6409080(B2) | 2002-06-01 | Kawagishi | Applicant |
| US6409089(B1) | 2002-06-01 | Eskicioglu | Applicant |
| US6415031(B1) | 2002-07-01 | Colligan et al. | Applicant |
| US6427140(B1) | 2002-07-01 | Ginter et al. | Applicant |
| US6449367(B2) | 2002-09-01 | Van Wie et al. | Applicant |
| US6449719(B1) | 2002-09-01 | Baker | Applicant |
| US6459427(B1) | 2002-10-01 | Mao et al. | Applicant |
| US6466670(B1) | 2002-10-01 | Tsuria et al. | Applicant |
| US6505299(B1) | 2003-01-01 | Zeng et al. | Applicant |
| US6587561(B1) | 2003-07-01 | Sered et al. | Applicant |
| US6618484(B1) | 2003-09-01 | Van Wie et al. | Applicant |
| US6629243(B1) | 2003-09-01 | Kleinman et al. | Applicant |
| US6634028(B2) | 2003-10-01 | Handelmann | Applicant |
| US6640304(B2) | 2003-10-01 | Ginter et al. | Applicant |
| US6651170(B1) | 2003-11-01 | Rix | Applicant |
| US6654420(B1) | 2003-11-01 | Snook | Applicant |
| US6654423(B2) | 2003-11-01 | Jeong et al. | Applicant |
| US6658568(B1) | 2003-12-01 | Ginter et al. | Applicant |
| US6668325(B1) | 2003-12-01 | Collberg et al. | Applicant |
| US7240196(B2) | 2007-07-01 | Cooper et al. | Applicant |
| US2002/0001385(A1) | 2002-01-01 | Kawada et al. | Applicant |
| US2002/0015498(A1) | 2002-02-01 | Houlberg et al. | Applicant |
| US2002/0021805(A1) | 2002-02-01 | Schumann et al. | Applicant |
| US2002/0089410(A1) | 2002-07-01 | Janiak et al. | Applicant |
| US2002/0104004(A1) | 2002-08-01 | Couillard | Applicant |
| US2002/0141582(A1) | 2002-10-01 | Kocher et al. | Applicant |
| US2003/0007568(A1) | 2003-01-01 | Hamery et al. | Applicant |
| EP658054(B1) | 1995-06-01 | Applicant | |
| EP714204(B1) | 1996-05-01 | Applicant | |
| EP886409 | 1998-12-01 | Applicant | |
| WO96/06504(A1) | 1996-02-01 | Applicant | |
| WO96/32702(A1) | 1996-10-01 | Applicant | |
| WO99/30499(A1) | 1999-06-01 | Applicant | |
| WO99/54453(A1) | 1999-10-01 | Applicant | |
| WO1/35571(A1) | 2001-05-01 | Applicant | |
| WO-01/93212(A2) | 2001-12-01 | Applicant | |
| WO2/21761(A2) | 2002-03-01 | Applicant |
Non-Patent Literature (18)
- Detecting intrusions using system calls: alternative data models Warrender, C.; Forrest, S.; Pearlmutter, B. Security and Privacy, 1999. Proceedings of the 1999 IEEE Symposium on May 9-12, 1999 pp. 133 -145.Examiner
- Intrusion detection using sequences of system calls. Hofmeyr, Steven A.; Forrest, Stephanie; Somayaji, Anil. Journal of Computer Security; 1998, vol. 6 Issue 3, p. 151-180.Examiner
- http://www.ntt.co.jp/news/news02e/0209/020927.html, Sep. 27, 2002.Applicant
- Coverage and Generalization in an Artificial Immune System, Balthrop, et al., 2002.Applicant
- Video Protection by Partial Content Corruption, C. Griwodz, Sep. 1998.Applicant
- An Overview of Multimedia Content Protection in Consumer Electronics Devices, Eskicioglu et al.,.Applicant
- Performance Study of a Selective Encryption Scheme for the Security of Networked, Real-Time Video, Spanos et al., 1995.Applicant
- Goonatilake, Suran, ed. et al., Intelligent Systems for Finance and Business, 1995, chapters 2-10, pp. 31-173.Applicant
- Irdeto Access and Optibase create Strategic Alliance—Dec. 14, 2000, http://www.irdetoaccess.com/press/0000041.htm.Applicant
- System Security, Streaming Media, S. Blumenfeld, Oct. 2001.Applicant
- http://www.cs.unm.edu/˜forest/projects.html, Dec. 2, 2003.Applicant
- Partial Encryption for Image and Video Communication, H. Cheng, 1998.Applicant
- A Review of Video Streaming Over the Internet, Hunter et al., Dec. 2, 2003.Applicant
- Standards Track, Schulzrinne, et al., Apr. 1998, pp. 1-86.Applicant
- http://www.optibase.com/html/news/December—14—2000.html, Dec. 14, 2004.Applicant
- Omneon Video Networks Product Announcement, Broadband Streaming, pp. 1-4.Applicant
- Yoshida, Kazuhiro, et al., “A Continuous-media Communication Method for Minimizing Playback Interruptions”, IS&T/SPIE Conference on Visual Communications and Immage Processing, Jan. 1999, San Jose, California, vol. 3653.Applicant
- Wu, Tsung-Li et al., “Selective Encryption and Watermarking of MPEG Video (Extended Abstract)”, Feb. 17, 1997, 10 pgs., International Conference on Image Science, Systems, and Technology.Applicant