This invention concerns keystroke analysis, and in particular the use and analysis of keystrokes made on a keyboard-like data input device for detecting the erroneous or fraudulent entry of data.
Online transactions frequently require a user to enter information using a keyboard or a keyboard-like device (hereinafter collectively referred to as “a keyboard”). An “online transaction” is any communication between an electronic communication location, for example, a website and a user or consumer. The communication can take a variety of forms, e.g., the entry by the consumer of information in a website's survey; an agreement to buy merchandise; a contest, sending a message via e-mail, etc. that is executed in whole or in part via a keyboard and electronically. A more specific example of an online transaction is an agreement to pay in exchange for the shipment of a product, i.e., a consumer's purchase. As used herein, a “product” can be goods and/or services. Another specific example of an online transaction is the completion of an online survey, e.g., the completion of a form provided through a web site over the Internet. The survey may be desired by the web site owner for a variety of reasons, e.g., marketing analysis, generation of a mailing list, effectiveness of marketing/advertising, etc. Sometimes, these surveys offer “rewards” or prizes to one, some or all of the entrants. Yet another example of an online transaction is the entry of personal profile information by a user using an interface device, like a keyboard, provided by a web site over the Internet. A keyboard can include any device used to enter alphanumeric information by a user.
Online transactions include the entry of information through an online form. The form can have certain fields that the user is required to complete. Examples of fields are a name field; an address field; a credit card number field; a credit card expiration date field; etc. When a user enters a survey, a contest, or is registered for a purchase by completing a form, the user may be presumed by a vendor or other online authority to be a legitimate party with which to engage in an online transaction.
A legitimate user engaged in an honest online transaction typically enters information into the required fields by pressing keys at varying locations on the keyboard that correspond to letters and/or numbers corresponding to the user's true name, address, telephone number, credit card number, etc. As used herein, a “keystroke” is a character produced by activating (e.g., depressing) a key of the keyboard. For example, the keystroke “a” results from pressing the “a” key on a keyboard in lowercase mode, while the keystroke “A” results from pressing the “a” key on a keyboard in the uppercase mode (ordinarily achieved by simultaneously depressing the “Shift” key and the “a” key of the keyboard). The “location of a keystroke” is the location of the key that is depressed or activated to generate the keystroke. For example, the location of the keystroke “a” corresponds to the location of the “a” key on a standard keyboard, which is typically next to the “s” key and under the “q” key on a standard QWERTY keyboard. Of course, the present invention can be adopted for other keyboard configurations. Likewise, the distance between keystrokes is deemed to be the shortest distance in keys, whether, vertical, horizontal or diagonal, between the keys that are depressed or activated to produce the keystrokes. This can be measured in any suitable fashion, such as the actual number of intervening spaces between keys or the actual linear distance in millimeters between keys, etc. For example, on a QWERTY keyboard, the distance between the “a” and “s” keystrokes is deemed 1 as there is a single intervening space between those keys. Thus, the distance between the “a” and the “d” keystrokes is deemed, for the purpose of the present invention, 2 keys, since there are two intervening key spaces between those individual keys, etc. The distance between an “f” and a “t” or between an “h” and a “t” is deemed 1, again, because there is one space between those keys of the standard QWERTY keyboard. Alternatively, the linear distance between the “a” and the “s” keystrokes on a QWERTY keyboard is about 2 centimeters; the distance between the “a” and the “d” keystrokes is about 4 centimeters (two spaces); etc. Of course, these concepts can apply to any keyboard, not just a QWERTY keyboard. For example, a cell phone has a keyboard, denominated a keypad with keys that correspond to numbers and letters. On a cell phone keypad, the keystrokes “a”, “b” and “c” all correspond to the “2” key, so the distance between those keystrokes is deemed zero. The distance between the “a” and “t” keystrokes can be 2 keys since the number of spaces between those two keys on a keypad numbers 2 or in linear dimension, about 0.8 centimeters (0.4 centimeters per space), etc.
A fraudulent user engaged in a dishonest online transaction is typically interested in filling in the fields required on an online form as quickly as possible. This allows access to information, provides for a fraudulent purchase, or multiple (and thus contrary to the rules) entries into a contest. Since the fraudulent user is not concerned with the accuracy of the information entered into the fields, the keystrokes need not be at substantially different locations on the keyboard.
An embodiment of the present invention can detect the entry of information that is likely to be part of a fraudulent online transaction based upon the relative locations of the keystrokes used to enter the information into one or more fields. For example, many online forms for contests only require that a field in a form not be left blank to accept an entry. A fraudulent user (a “fraudster”) realizes this, and often seeks to enter keystrokes as quickly as possible, without regard to their meaning. The quick entry of this fraudulent information may allow the fraudster to submit multiple contest entries, for example. The present invention seeks to determine the presence of fraudulent online transaction. To enter information quickly, then, a fraudulent user or fraudster will often enter data into the field(s) by placing one hand on the keyboard and randomly entering keystrokes that are located near to each other. An embodiment of the present invention capitalizes on this fact to detect actually or potentially fraudulent data entered by a user.
In an embodiment of the present invention, a numerical value is assigned to each keystroke. The numerical value of a second or succeeding keystroke is based upon the distance of the second or succeeding keystroke from the first or preceding keystroke, preferably the immediately previously entered keystroke. An arbitrary value can be assigned to the first keystroke. For example, if the first keystroke is “a”, then it can be assigned an integer value, such as 1. An integer is any of the positive and negative whole numbers and zero, i.e., [ . . . −2, −1, 0, 1, 2, . . . ] The second keystroke can be assigned a value equal to the number of keyspaces between the first and second keystrokes. Thus, if the second keystroke is a “d”, then the second keystroke can be assigned a value (“score”) of 2, because on the QWERTY keyboard, the “d” key is two key spaces away from the “a” key, i.e., a single key “s” is between the “a” key and the “d” key with that “s” key having a space on each of its sides to separate it from the “a” and “d” keys. If the third keystroke is also a “d”, it will be assigned a score of 0, because it is 0 keystrokes or spaces away from the second keystroke, which was also a “d.” If the fourth keystroke depressed by the user is an “s,” it will be assigned a score of 1, because the “s” key is one key space separated from the “d” key. If the fifth keystroke is an “e”, it will be assigned a value or score of 1, because it is one diagonal key space separated from the “s” key. This is how the present invention preferably assigns values to each keystroke entered by a user.
Of course, other methods of assigning values or scores to second and successive keystrokes can be employed without departing from the scope of the present invention. For example, a percentage difference from two keys next to each other can be employed, by capitalizing on the diagonal distance between depressed keys. For example, although an “a” and “s” are one key space apart from one another and the “a” and “w” are also one key space apart, the inventor further contemplates assigning a value of 1 to the “a” to “s” keyspace between the keys and a weighted value of 1.25, for example, for the “a” to “w” keyspace between those keys, because they appear on different rows of the keyboard. Other manners of valuing second and successive keystrokes from the first and following keystrokes are contemplated and all within the scope of the present invention.
The scores of all keystrokes used to enter information in a field of a form of an online transaction can be summed in accordance with the present invention. One or more keystrokes is called a “string”. The sum of the keystroke scores of a string is called a “string score”. The number of keystrokes or keys depressed by the user in a string is called its “length.” For the example above, the string “addse” has a string score of 1+2+0+1+1=5, and a length of 5 (since 5 separate keystrokes were depressed to form the string). A string score is “normalized” when its string score is divided by its length. So, in the example, the normalized string score for the string “addse” above is 5/5=1. This value for the normalized string score is typical for strings made of keystrokes entered by a fraudster. That is, strings made of essentially randomly entered keystrokes that are relatively close to each other have string scores that are approximately equal to the lengths of the strings. Another example is the string “dddddddddd”, which has a normalized string score of 0.1, since the first keystroke is assigned a value or score of 1 and all of the subsequent keystrokes are assigned the value or score of 0. The sum of the keystrokes, the string score, is then 1+0+0+0+0+0+0+0+0+0 or 1. The length of the string is 10. The normalized string score is 1 divided by 10 or 10/1=0.1. In other words, such nonsense or fraudster type strings typically have normalized string scores about equal to, or less than, one.
On the other hand, strings that are made from keystrokes that correspond to real information typically have larger score sums than their lengths, because successive keystrokes are often located at more mutually distant locations on the keyboard. In other words, the normalized string score for legitimate strings is often greater than 1. For example, the name ELLEN has a string score of 1+6+0+6+4=17 (based on the number of spaces between the keys), a length of 5 (based on the number of keys depressed to form the string) and thus a normalized string score of 17/5=3.4.
In accordance with an embodiment of the present invention, a string having a normalized string score sum less than or equal to about 1 can indicate an entry by a fraudulent user, while a score substantially above 1 can indicate a legitimate entry. In practice, it has been found that, generally, a normalized string score sum that is less than or about equal to 1.25 can indicate a likely fraudulent entry; a normalized string score sum greater than 1.25 yet less than or equal to about 1.5 can indicate a moderate likelihood (risk) of fraud; and a normalized string score sum greater than about 2 can indicate a smaller likelihood of a fraudulent or mistakenly entry into the data field. Thus, entries into fields can be categorized into high, medium and low risk levels of fraud or mistake.
The normalized string scores of two or more strings belonging to, say, the same online transaction can be aggregated to generate a high, medium or low level of risk that applies to the entire transaction. For example, the normalized string scores of some or all of a group of strings (e.g., the entries in a transaction (name, address, etc.)) can be summed to obtain a transactional score, and when divided by the number of entries (fields) in the sum to obtain a normalized transactional score. If this result is less than or equal to about 1, then the online transaction is likely a high risk of being fraudulent; if it is greater than 2, it is likely a low risk of being fraudulent; and, if otherwise, it can be “flagged” for further investigation. In this way, the entire online transaction can be rejected if a high risk level is shown in accordance with an embodiment of the present invention; accepted if a low risk is indicated; or the transaction can be flagged for further study if a moderate level of risk is detected. Likelihood (risk) of fraud can be determined in terms of a percentage measurement (e.g., 25% probability of fraud, 60% probability of fraud, etc.); risk levels (e.g., low, medium, high; acceptable, unacceptable; suspicious, etc.); or any other suitable way. These risk determinations can be associated with a single string or sets of strings and stored.
Strings entered in the course of an online transaction can advantageously be stored in a database. The strings associated with a single transaction can be stored as a single record. The string score and transactional score can be associated with the record corresponding to the strings and transactions to which the scores pertain. Thus, a risk level can be associated with a specific record. For example, a credit card number that is entered along with several strings with normalized scores equal to about 1 can be placed into a database of highly suspect information. The credit card number can be reported as possibly stolen, or other transactions that use that credit card number can be temporarily canceled or blocked until the legitimate holder of the credit card or the credit card company is first notified.
A single field with a normalized value of about 1 may not indicate fraud. For example, the legitimate name FRED can have a string score of 1+1+1+1=4, a string length of 4 and thus a normalized score of 4/4 or 1. Thus, the present invention encompasses setting various thresholds, as appropriate, for classifying a user as potentially suspect. For another example, a user can be classified as suspect when two or more; three or more; four or more, etc. fields have normalized string scores that fall between 0.5 and 1.5 (a gap of 1.0); or between 0.75 and 1.25 (gap of 0.5); or 0.9 and 1.1 (a gap of 0.2); etc. This can advantageously “tune” the sensitivity of the present invention. For example, requiring more fields to have normalized scores about equal to 1 for a user to be categorized as “suspect” can diminish the sensitivity of the fraud detection in accordance with an embodiment of the present invention. Narrowing the gap between the lower and upper normalized score values within which a normalized score must fall to be a suspect value can have the same effect. Requiring fewer fields to be determined as suspicious and/or widening the value of the gap can increase the method's sensitivity. Thus, an embodiment of the present invention can be advantageously adjusted to take into account the particular needs and policies of the authority seeking to detect fraud. An authority that is eager to avoid false positives (i.e., one where there is little financial risk of loss if the entry is fraudulent) can adjust the tolerance to a lower sensitivity, while an authority that wishes to rigorously prevent fraud because of the loss of large amounts of goods and/or money has a greater tolerance for false positives and may adjust the parameters to increase sensitivity. A “false positive” occurs when a legitimate user is incorrectly classified as a fraudulent user.
The present invention produces good results regardless of the starting position of the hand that types the information, and for either the right or left hand. For example, a user places his left hand in the conventional position for a QWERTY-style keyboard, with his left index finger resting on the “f” key, his second finger on the “d” key, his ring finger on the “s” key and his pinky on the “a” key, etc. Suppose the user is a fraudster, so he types a random string of letters convenient to the placement of his left hand, e.g., “wessf”. If the first keystroke is assigned an arbitrary value of 1, and if the distance between keystrokes is measured in spaces between keys, then the string score is 1+1+1+0+2 or 5. Since there are five keystrokes, the normalized string score is 5/5 or 1. If the fraudster types the same pattern but with a different hand position, the string score and normalized string score will be the same. For example, if the fraudster uses his right hand in the position where his right index finger rests on the “j” key, the second finger on the “k”, and the right hand pinky on the “;” key, the same typing pattern produces the string “uijjl”. This string also has a string score of 5 and a normalized string score of 1. So, an embodiment of the present invention advantageously detects key entries that may be fraudulent regardless of the position of the hand on the keyboard or which hand is used for the entry.
The present invention can advantageously take into account the fact that the use of the shift key for capitalization may indicate a reduced likelihood of fraud or error. A fraudster who simply wants to enter keystrokes simply to complete an entry or field of a form typically does not bother depressing the shift key for a single keystroke, while a legitimate user may wish to capitalize the first letter of a name, use a shift character (e.g., the “!” on the “1” key, the “@” on the “2” key, etc.). A keystroke made while the shift key is depressed (or locked) is denoted shift+keystroke, e.g., shift+a. A keystroke made while the shift key is depressed or locked can also be denoted by the character it produces. For example, shift+a=A, shift+1=1, etc. A shift+keystroke can be called a “shifted keystroke.”
An embodiment of the present invention takes the shift key into account by adding an extra amount to the value of a shifted keystroke. This extra amount is added to the value assigned to a keystroke based upon its distance from the previous keystroke. For example, in a string, “d” as the first letter or keystroke is assigned a value of 1, and since “a” is two key spaces away from “d”, i.e., separated by a single key with spaces on its sides, “a” is assigned a value of 2, just as before described. Likewise, the next keystroke “q” is assigned a value of 1, because it is one key space distance from “a”. Thus, the string value for “daq” is 1+2+1=4. The string length is 3. The normalized string value is 4/3=1.33. For the string “Daq” (i.e., shift+d,a, and q) an extra value of 1 is added to the shifted keystroke “D” because the shift key was used. The string score for Daq is therefore 2+2+1=5, the string length remains as 3 and the normalized string score is 5/3=1.67. Since the normalized score is greater for “Daq” than “daq,” it appropriately indicates that the risk of fraud or error for “Daq” is smaller than that for “daq.” The enhanced value added to the score of a keystroke because it is shifted can be an integer (e.g., 1, 2, 3, etc.) or any other real number (e.g., 1.43, 4.6, etc.).
The scoring rule(s) for keystrokes involving the shift key can be further refined by taking into account a locked shift key, or multiple shifted keystrokes that may not indicate a lesser likelihood of fraud or error than a string score based exclusively on distance from the previous keystroke. For example, if all of the keystrokes in a string are shifted, e.g., “DAQ,” then no additional value is added to the distance-based keystroke values. So “DAQ” can have the same string score as “daq.” Likewise, indications that a shift key is being randomly depressed can also be taken into account. A rule can be implemented such that no additional value is added to a shifted keystroke if at least one (or at least two, two of three, or at least three, etc.) contiguous keystrokes in the string are also shifted. In other words, an extra value can be added to the “D” in “Daq,” but no extra value will be added to either “D” or “Q” in the string “DaQ,” or “DAQ” because a rule is implemented that no enhanced value will be attributed to any shifted key that is part of a contiguous set of two of three or three or more consecutive shifted keys in the string. In another example, the “D” and “A” have the value 1 added to each of the D and the A for totaling keystroke scores in the string DAqui, but the shifted keys D and A and Q will not have any value added to them in the string DAQui, because a rule is implemented that no enhanced value will be added to any shifted keystroke that is part of a contiguous set of three or more shifted keystrokes. Other rules can be envisioned that take into account the shift key. For example, a string with more than a predetermined fraction of its keystrokes shifted may be valued without adding enhanced values to the shifted keystrokes; a string that includes more than a predetermined number of shifted keystrokes or a percentage of the overall keystrokes may be valued without adding enhanced values to the shifted keystrokes; etc.
An embodiment of the present invention can be embodied in software adapted to be executed by a processor. A processor may be coupled to a memory, storing keystroke fraud instructions that are adapted to be executed by the processor to perform the method in accordance with an embodiment of the present invention. Although the instructions are termed “fraud instructions,” they can also detect the risk of an erroneous entry of keystrokes. The processor can be a general purpose microprocessor, such as the Pentium IV processor manufactured by the Intel Corporation of Santa Clara, Calif., or an Application Specific Integrated Circuit (ASIC) that embodies at least part of the method in accordance with an embodiment of the present invention in hardware and/or firmware. An example of an ASIC is a digital signal processor. Memory can be any device that can store computer-readable information, such as Random Access Memory (RAM); Read Only Memory (ROM); a hard disk; a CD-ROM; flash memory; etc. Keystroke fraud instructions can also be carried on a medium, which can include memory and/or a telecommunications channel.
In one embodiment of the present invention, the keystroke fraud instructions are executed on a client machine to which the entries made on a remote keyboard are coupled. Upon execution, the instructions examine strings of keystrokes entered by a user and sets a “flag” indicating a likelihood of fraud or mistake associated with a string or set of strings. In another embodiment, a string or set of strings is analyzed by the processor at the user's end and only after it is determined as not likely to be fraudulent are the field entries sent to the web site. The keystroke fraud server sends a message to the web site server indicating a likelihood of fraud associated with the string or set of strings. In yet another embodiment, numerous strings are stored on a medium (e.g., a database on a hard disk; carried over a telecommunications channel and stored on a memory; etc.) and are analyzed by a computer having a processor executing the keystroke fraud instructions. This can occur shortly after or some time after the strings have been entered by one or more users. The strings and sets of strings are analyzed, and the likelihood of fraud associated with each string and/or set of strings can be recorded.
The above description is meant to illustrate, and not to limit, the scope of the present invention. One skilled in the art will readily appreciate that other embodiments of the present invention can be used, instead of those described above. For example, the distance between keys can be characterized in different ways than the shortest number of jumps needed to get from one key to another or the linear distance. A value should be assigned to a keystroke such that the absolute magnitude of the value is larger when the space, linear or keyboard distance between the given keystroke and a previously entered keystroke such that the greater distance corresponds to a greater value for the keystroke, and smaller when the distance is smaller, summing the values of several keystrokes; and normalizing the resulting sum to that longer set of keystrokes with the same relative positions as smaller sets of keystrokes produce about the same normalized value. Also, the value assigned to a keystroke need not be based upon the distance of the keystroke from an immediately previous keystroke. A value of a keystroke can also be based upon the distance of a subsequently typed keystroke from a predetermined positioned keystroke, e.g., all distances are determined from the third keystroke, ignoring the first two. Further, the value assigned to a keystroke need not always be based upon the distance of the keystroke from a consecutive (preceding or following) keystroke. In some cases, the value can be based upon the distance from the keystroke to another keystroke entered some keystrokes prior or subsequent. Further, scores of keystrokes can be manipulated such that a larger normalized string score indicates a lower likelihood of fraud than a smaller normalized string score. For example, a normalized string score can be inverted.
The present invention can also detect entries that have been entered in an erroneous fashion, and transactions that contain erroneous entries. Also, the present invention can be used to detect and ignore keyboard entries made accidentally to a wireless device while it is carried in a user's pocket or purse. When another object near the wireless device presses on the keypad, nearby keys can often be depressed, sometimes repeatedly. A number can unintentionally be dialed on the wireless device, or data can be inadvertently entered. The present invention can advantageously detect entries of keystrokes near to each other, and selectively ignore them. For example, a rule can be implemented to the effect that a string of nearby keystrokes should be ignored, unless they appear on an exception list stored at or accessible to the wireless device. In another embodiment, the rule can be to ignore a string of nearby keystrokes that do not begin with one or more predetermined strings, such as an access digit (such as “1”) and a recognized, stored or preauthorized area code.
These and other embodiments would be understood by one of ordinary skill in the art to be encompassed by the present invention.
This application is a continuation of pending U.S. application Ser. No. 10/612,375, filed Jul. 1, 2003, which is hereby incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4805222 | Young | Feb 1989 | A |
4912761 | Tan et al. | Mar 1990 | A |
4924387 | Jeppesen | May 1990 | A |
5184849 | Taylor | Feb 1993 | A |
5491735 | Hsieh | Feb 1996 | A |
5519827 | Mizushima | May 1996 | A |
5521907 | Ennis, Jr. | May 1996 | A |
5557686 | Brown et al. | Sep 1996 | A |
5627886 | Bowman | May 1997 | A |
5679940 | Templeton et al. | Oct 1997 | A |
5721765 | Smith | Feb 1998 | A |
5724424 | Giffor | Mar 1998 | A |
5748740 | Curry et al. | May 1998 | A |
5748780 | Stolfo et al. | May 1998 | A |
5764275 | Lappington et al. | Jun 1998 | A |
5802156 | Felger | Sep 1998 | A |
5819226 | Gopinathan et al. | Oct 1998 | A |
5864620 | Pettitt | Jan 1999 | A |
5884289 | Anderson et al. | Mar 1999 | A |
5886334 | D'Entremont | Mar 1999 | A |
5892900 | Ginter et al. | Apr 1999 | A |
5894510 | Felger | Apr 1999 | A |
5899980 | Wilf et al. | May 1999 | A |
5903721 | Sixtus | May 1999 | A |
5933480 | Felger | Aug 1999 | A |
5960069 | Felger | Sep 1999 | A |
6009523 | Owaki et al. | Dec 1999 | A |
6029154 | Pettitt | Feb 2000 | A |
6029159 | Zorba et al. | Feb 2000 | A |
6062474 | Kroll | May 2000 | A |
6078907 | Lamm | Jun 2000 | A |
6092053 | Boesch et al. | Jul 2000 | A |
6094643 | Anderson et al. | Jul 2000 | A |
6105012 | Chang et al. | Aug 2000 | A |
6112240 | Pogue et al. | Aug 2000 | A |
6148407 | Aucsmith | Nov 2000 | A |
6151593 | Cho et al. | Nov 2000 | A |
6163604 | Baulier et al. | Dec 2000 | A |
6163771 | Walker et al. | Dec 2000 | A |
6164528 | Hills et al. | Dec 2000 | A |
6205436 | Rosenberg et al. | Mar 2001 | B1 |
6209104 | Jalili | Mar 2001 | B1 |
6216153 | Vortriede | Apr 2001 | B1 |
6223289 | Wall et al. | Apr 2001 | B1 |
6282276 | Felger | Aug 2001 | B1 |
6295605 | Dockter et al. | Sep 2001 | B1 |
6327384 | Hirao et al. | Dec 2001 | B1 |
6330546 | Gopinathan et al. | Dec 2001 | B1 |
6405922 | Kroll | Jun 2002 | B1 |
6442529 | Krishan et al. | Aug 2002 | B1 |
6442692 | Zilberman | Aug 2002 | B1 |
6457021 | Berkowitz et al. | Sep 2002 | B1 |
6480710 | Laybourn et al. | Nov 2002 | B1 |
6509847 | Anderson | Jan 2003 | B1 |
6523019 | Borthwick | Feb 2003 | B1 |
6546493 | Magdych et al. | Apr 2003 | B1 |
6553108 | Felger | Apr 2003 | B1 |
6560455 | Amin et al. | May 2003 | B2 |
6567099 | Dawson | May 2003 | B1 |
6597775 | Lawyer et al. | Jul 2003 | B2 |
6646765 | Barker et al. | Nov 2003 | B1 |
6678666 | Boulware | Jan 2004 | B1 |
6687390 | Avni et al. | Feb 2004 | B2 |
6687696 | Hofmann et al. | Feb 2004 | B2 |
6689055 | Mullen et al. | Feb 2004 | B1 |
6718363 | Ponte | Apr 2004 | B1 |
6745333 | Thomsen | Jun 2004 | B1 |
6803920 | Gossett et al. | Oct 2004 | B2 |
6804624 | Silverman | Oct 2004 | B2 |
6850606 | Lawyer et al. | Feb 2005 | B2 |
6892307 | Wood et al. | May 2005 | B1 |
6895507 | Tepler | May 2005 | B1 |
6895514 | Kermani | May 2005 | B1 |
6898709 | Teppler | May 2005 | B1 |
6908030 | Rajasekaran et al. | Jun 2005 | B2 |
6937569 | Sarkar et al. | Aug 2005 | B1 |
6947978 | Huffman | Sep 2005 | B2 |
6954532 | Handley et al. | Oct 2005 | B1 |
6957185 | Labaton | Oct 2005 | B1 |
6957339 | Shinzaki | Oct 2005 | B2 |
7002712 | Barker et al. | Feb 2006 | B2 |
7003670 | Heaven et al. | Feb 2006 | B2 |
7007174 | Wheeler et al. | Feb 2006 | B2 |
7013001 | Felger | Mar 2006 | B1 |
7027800 | Haumont et al. | Apr 2006 | B2 |
7039505 | Southard et al. | May 2006 | B1 |
7039699 | Narin et al. | May 2006 | B1 |
7043640 | Pritchard et al. | May 2006 | B2 |
7089310 | Ellerman et al. | Aug 2006 | B1 |
7089585 | Dharmarajan | Aug 2006 | B1 |
7096192 | Pettitt | Aug 2006 | B1 |
7100049 | Gasparini et al. | Aug 2006 | B2 |
7103570 | Morea et al. | Sep 2006 | B1 |
7120590 | Eisen et al. | Oct 2006 | B1 |
7130858 | Ciaramitaro et al. | Oct 2006 | B2 |
7143095 | Barrett et al. | Nov 2006 | B2 |
7158622 | Lawyer et al. | Jan 2007 | B2 |
7165051 | Ronning et al. | Jan 2007 | B2 |
7174454 | Roskind | Feb 2007 | B2 |
7191467 | Dujari et al. | Mar 2007 | B1 |
7197646 | Fritz et al. | Mar 2007 | B2 |
7221949 | Clough | May 2007 | B2 |
7225974 | Yamauchi | Jun 2007 | B2 |
7237717 | Rao et al. | Jul 2007 | B1 |
7249093 | King | Jul 2007 | B1 |
7251624 | Lee et al. | Jul 2007 | B1 |
7260837 | Abraham et al. | Aug 2007 | B2 |
7263492 | Suresh et al. | Aug 2007 | B1 |
7263506 | Lee et al. | Aug 2007 | B2 |
7272610 | Torres | Sep 2007 | B2 |
7272728 | Pierson et al. | Sep 2007 | B2 |
7292723 | Tedesco et al. | Nov 2007 | B2 |
7293096 | Foltak et al. | Nov 2007 | B1 |
7296088 | Padmanabhan et al. | Nov 2007 | B1 |
7328216 | Hofmann et al. | Feb 2008 | B2 |
7330824 | Kanojia et al. | Feb 2008 | B1 |
7330871 | Barber | Feb 2008 | B2 |
7340045 | Felger | Mar 2008 | B2 |
7346551 | Pe Jimenez et al. | Mar 2008 | B2 |
7346775 | Gasparinl et al. | Mar 2008 | B2 |
7349955 | Korb et al. | Mar 2008 | B1 |
7359962 | Willebeek-LeMair et al. | Apr 2008 | B2 |
7363170 | Seul et al. | Apr 2008 | B2 |
7373669 | Eisen | May 2008 | B2 |
7376618 | Anderson et al. | May 2008 | B1 |
7379891 | Donner et al. | May 2008 | B1 |
7404087 | Teunen | Jun 2008 | B2 |
7401082 | Keene et al. | Jul 2008 | B2 |
7403922 | Lewis et al. | Jul 2008 | B1 |
7406441 | Kimura et al. | Jul 2008 | B2 |
7428587 | Rowland et al. | Sep 2008 | B2 |
7436780 | Stephens | Oct 2008 | B2 |
7438226 | Helsper et al. | Oct 2008 | B2 |
7447494 | Law et al. | Nov 2008 | B2 |
7451487 | Oliver et al. | Nov 2008 | B2 |
7457401 | Lawyer et al. | Nov 2008 | B2 |
7457823 | Shraim et al. | Nov 2008 | B2 |
7475242 | Baird et al. | Jan 2009 | B2 |
7478182 | Schweig | Jan 2009 | B2 |
7487350 | Utin | Feb 2009 | B2 |
7496752 | Yamaguchi et al. | Feb 2009 | B2 |
7497374 | Helsper et al. | Mar 2009 | B2 |
7502610 | Maher | Mar 2009 | B2 |
7502933 | Jakobsson et al. | Mar 2009 | B2 |
7526796 | Lulich et al. | Apr 2009 | B2 |
7543740 | Greene et al. | Jun 2009 | B2 |
7552090 | Barber | Jun 2009 | B1 |
7555458 | Felger | Jun 2009 | B1 |
7562221 | Nyström et al. | Jul 2009 | B2 |
7577620 | Donner | Aug 2009 | B1 |
7581112 | Brown et al. | Aug 2009 | B2 |
7606560 | Labrou et al. | Oct 2009 | B2 |
7657626 | Zwicky | Feb 2010 | B1 |
7660902 | Graham et al. | Feb 2010 | B2 |
7665140 | Oliver et al. | Feb 2010 | B2 |
7665658 | Fields | Feb 2010 | B2 |
7673793 | Greene et al. | Mar 2010 | B2 |
7685629 | White et al. | Mar 2010 | B1 |
7698743 | Ohmori et al. | Apr 2010 | B2 |
7708200 | Helsper et al. | May 2010 | B2 |
7711846 | Padmanabhan et al. | May 2010 | B2 |
7735141 | Noel et al. | Jun 2010 | B1 |
7739402 | Reese et al. | Jun 2010 | B2 |
7739512 | Hawkes | Jun 2010 | B2 |
7743409 | Gonzalez et al. | Jun 2010 | B2 |
7752084 | Pettitt | Jul 2010 | B2 |
7756783 | Crooks | Jul 2010 | B2 |
7761379 | Zoldi et al. | Jul 2010 | B2 |
7778846 | Suresh et al. | Aug 2010 | B2 |
7813937 | Pathria et al. | Oct 2010 | B1 |
7813944 | Luk et al. | Oct 2010 | B1 |
7849029 | Crooks et al. | Dec 2010 | B2 |
7849307 | Roskind | Dec 2010 | B2 |
7853526 | Milana | Dec 2010 | B2 |
7853533 | Eisen | Dec 2010 | B2 |
7856372 | Ullah | Dec 2010 | B2 |
7860783 | Yang et al. | Dec 2010 | B2 |
7861260 | Shkedi | Dec 2010 | B2 |
7865427 | Wright et al. | Jan 2011 | B2 |
7882217 | Katzir | Feb 2011 | B2 |
7908223 | Klein et al. | Mar 2011 | B2 |
7908645 | Varghese et al. | Mar 2011 | B2 |
7930285 | Abraham et al. | Apr 2011 | B2 |
7933984 | Smith et al. | Apr 2011 | B1 |
7937467 | Barber | May 2011 | B2 |
7940929 | Sengupta | May 2011 | B1 |
7945494 | Williams | May 2011 | B2 |
7945515 | Zoldi et al. | May 2011 | B2 |
7949564 | Hughes et al. | May 2011 | B1 |
7958029 | Bobich et al. | Jun 2011 | B1 |
7958246 | Barber | Jun 2011 | B2 |
7961857 | Zoldi et al. | Jun 2011 | B2 |
7970701 | Lewis et al. | Jun 2011 | B2 |
7983691 | Wong et al. | Jul 2011 | B1 |
7991716 | Crooks et al. | Aug 2011 | B2 |
7995996 | Link, II et al. | Aug 2011 | B2 |
8001376 | Utin | Aug 2011 | B2 |
8001597 | Crooks | Aug 2011 | B2 |
8015614 | Matsuzaki et al. | Sep 2011 | B2 |
8015921 | Leppanen et al. | Sep 2011 | B2 |
8019678 | Wright et al. | Sep 2011 | B2 |
8020763 | Kowalchyk et al. | Sep 2011 | B1 |
8024266 | Barber | Sep 2011 | B1 |
8025220 | Zoldi et al. | Sep 2011 | B2 |
8027439 | Zoldi et al. | Sep 2011 | B2 |
8032448 | Anderson et al. | Oct 2011 | B2 |
8037097 | Guo et al. | Oct 2011 | B2 |
8037511 | Lundy et al. | Oct 2011 | B1 |
8041597 | Li et al. | Oct 2011 | B2 |
8042164 | Sheynblat et al. | Oct 2011 | B2 |
8046271 | Jimenez et al. | Oct 2011 | B2 |
8060922 | Crichton et al. | Nov 2011 | B2 |
8065233 | Lee et al. | Nov 2011 | B2 |
8090648 | Zoldi et al. | Jan 2012 | B2 |
8108378 | Ott, IV et al. | Jan 2012 | B2 |
8121962 | Vaiciulis et al. | Feb 2012 | B2 |
8122082 | Klein | Feb 2012 | B2 |
8126816 | Mu et al. | Feb 2012 | B2 |
8131615 | Diev et al. | Mar 2012 | B2 |
8140689 | Barber | Mar 2012 | B2 |
8141148 | Thomas et al. | Mar 2012 | B2 |
8145560 | Kulkarni et al. | Mar 2012 | B2 |
8145762 | Barber | Mar 2012 | B2 |
8150968 | Barber | Apr 2012 | B2 |
8151327 | Eisen | Apr 2012 | B2 |
8166068 | Stevens | Apr 2012 | B2 |
8175897 | Lee et al. | May 2012 | B2 |
8176178 | Thomas et al. | May 2012 | B2 |
8180686 | Ryu et al. | May 2012 | B2 |
8181015 | Roskind | May 2012 | B2 |
8185953 | Rothstein et al. | May 2012 | B2 |
8190513 | Felger | May 2012 | B2 |
8190529 | Abe et al. | May 2012 | B2 |
8191148 | Oliver et al. | May 2012 | B2 |
8201099 | Osbourn et al. | Jun 2012 | B1 |
8204833 | Mu et al. | Jun 2012 | B2 |
8209744 | Zhu et al. | Jun 2012 | B2 |
8209760 | Hardman | Jun 2012 | B1 |
8213898 | Choti et al. | Jul 2012 | B2 |
8214232 | Tyler et al. | Jul 2012 | B2 |
8214285 | Hu et al. | Jul 2012 | B2 |
8219415 | Tyler et al. | Jul 2012 | B2 |
8224348 | Bolon et al. | Jul 2012 | B2 |
8229844 | Felger | Jul 2012 | B2 |
8250631 | Iyengar et al. | Aug 2012 | B2 |
8266295 | Klein et al. | Sep 2012 | B2 |
8271891 | Osbourn et al. | Sep 2012 | B1 |
8280833 | Miltonberger | Oct 2012 | B2 |
8290838 | Thakur et al. | Oct 2012 | B1 |
8295898 | Ashfield et al. | Oct 2012 | B2 |
8296228 | Kloor | Oct 2012 | B1 |
8296229 | Yellin et al. | Oct 2012 | B1 |
8296245 | Barber et al. | Oct 2012 | B2 |
8296250 | Crooks et al. | Oct 2012 | B2 |
8306933 | Kawai et al. | Nov 2012 | B2 |
8307430 | Chen et al. | Nov 2012 | B1 |
8311907 | Klein et al. | Nov 2012 | B2 |
8321269 | Linden et al. | Nov 2012 | B2 |
8326759 | Hammad | Dec 2012 | B2 |
8326760 | Ma et al. | Dec 2012 | B2 |
8326763 | Zuili | Dec 2012 | B2 |
8332338 | Vaiciulis et al. | Dec 2012 | B2 |
8332522 | Barber | Dec 2012 | B2 |
8370253 | Grossman et al. | Feb 2013 | B1 |
8370638 | Duane et al. | Feb 2013 | B2 |
8380831 | Barber | Feb 2013 | B2 |
8392987 | Sasamura et al. | Mar 2013 | B2 |
8407112 | Walter | Mar 2013 | B2 |
8407798 | Lotem et al. | Mar 2013 | B1 |
8417587 | Jimenez et al. | Apr 2013 | B2 |
8423458 | Barber | Apr 2013 | B2 |
8424061 | Rosenor | Apr 2013 | B2 |
8429070 | Hu et al. | Apr 2013 | B2 |
8443202 | White et al. | May 2013 | B2 |
8452715 | Barber | May 2013 | B2 |
8453226 | Hammad | May 2013 | B2 |
8462161 | Barber | Jun 2013 | B1 |
8464290 | Beyda et al. | Jun 2013 | B2 |
8468582 | Kuang et al. | Jun 2013 | B2 |
8484470 | Sakakihara et al. | Jul 2013 | B2 |
8495714 | Jones et al. | Jul 2013 | B2 |
8516439 | Brass et al. | Aug 2013 | B2 |
8539070 | Barber | Sep 2013 | B2 |
8543522 | Ryman-Tubb et al. | Sep 2013 | B2 |
8548137 | Zoldi et al. | Oct 2013 | B2 |
8559607 | Zoldi et al. | Oct 2013 | B2 |
8567669 | Griegel et al. | Oct 2013 | B2 |
8588816 | Collins | Nov 2013 | B2 |
8601109 | Johannsen | Dec 2013 | B2 |
8611856 | Yan et al. | Dec 2013 | B2 |
8612854 | Eisen et al. | Dec 2013 | B2 |
8660539 | Khambete et al. | Feb 2014 | B2 |
8683561 | Utin | Mar 2014 | B2 |
8688543 | Dominguez | Apr 2014 | B2 |
8751815 | Lunde et al. | Jun 2014 | B2 |
8762283 | Gerber et al. | Jun 2014 | B2 |
8762574 | Barber | Jun 2014 | B2 |
8763113 | Thomas et al. | Jun 2014 | B2 |
8776225 | Pierson et al. | Jul 2014 | B2 |
8779981 | Eisen et al. | Jul 2014 | B2 |
8781975 | Bennett et al. | Jul 2014 | B2 |
8782783 | Thomas et al. | Jul 2014 | B2 |
8799458 | Barber | Aug 2014 | B2 |
8817984 | Miller et al. | Aug 2014 | B2 |
8826393 | Eisen | Sep 2014 | B2 |
8838478 | Kretz et al. | Sep 2014 | B2 |
8838967 | Mills et al. | Sep 2014 | B1 |
8862514 | Eisen | Oct 2014 | B2 |
8862526 | Miltonberger | Oct 2014 | B2 |
8881288 | Levy et al. | Nov 2014 | B1 |
8938671 | Eisen et al. | Jan 2015 | B2 |
8954560 | Johannsen | Feb 2015 | B2 |
8966276 | Nanopoulos et al. | Feb 2015 | B2 |
9060012 | Eisen | Jun 2015 | B2 |
9083735 | Reumann et al. | Jul 2015 | B2 |
9098617 | Pauley, Jr. et al. | Aug 2015 | B1 |
9112850 | Eisen | Aug 2015 | B1 |
9118646 | Pierson et al. | Aug 2015 | B2 |
9191370 | Barber et al. | Nov 2015 | B2 |
9196004 | Eisen | Nov 2015 | B2 |
9203837 | Pierson et al. | Dec 2015 | B2 |
9294448 | Miller et al. | Mar 2016 | B2 |
9298677 | Tollinger et al. | Mar 2016 | B2 |
9332020 | Thomas et al. | May 2016 | B2 |
9361597 | Britton et al. | Jun 2016 | B2 |
9378500 | Jimenez et al. | Jun 2016 | B2 |
9390384 | Eisen | Jul 2016 | B2 |
9396331 | Eisen et al. | Jul 2016 | B2 |
9412123 | Eisen | Aug 2016 | B2 |
9514248 | Guan et al. | Dec 2016 | B1 |
9521161 | Reumann et al. | Dec 2016 | B2 |
9521551 | Eisen et al. | Dec 2016 | B2 |
9559852 | Miller et al. | Jan 2017 | B2 |
9633201 | Katz | Apr 2017 | B1 |
9703983 | Eisen et al. | Jul 2017 | B2 |
9754256 | Britton et al. | Sep 2017 | B2 |
9754311 | Eisen | Sep 2017 | B2 |
9781151 | McCorkendale et al. | Oct 2017 | B1 |
9785973 | Tollinger et al. | Oct 2017 | B2 |
9948629 | Eisen | Apr 2018 | B2 |
9990631 | Eisen | Jun 2018 | B2 |
10021099 | Eisen et al. | Jul 2018 | B2 |
10089679 | Eisen | Oct 2018 | B2 |
10091312 | Khanwalkar et al. | Oct 2018 | B1 |
20010011243 | Dembo et al. | Aug 2001 | A1 |
20010011304 | Wesigner et al. | Aug 2001 | A1 |
20010016840 | Hijikata et al. | Aug 2001 | A1 |
20010016876 | Kurth et al. | Aug 2001 | A1 |
20010034712 | Colvin | Oct 2001 | A1 |
20010046096 | Worden | Nov 2001 | A1 |
20020035622 | Barber | Mar 2002 | A1 |
20020041328 | LeCompte et al. | Apr 2002 | A1 |
20020046157 | Solomon | Apr 2002 | A1 |
20020052852 | Bozeman | May 2002 | A1 |
20020056042 | van der Kaay et al. | May 2002 | A1 |
20020073046 | David | Jun 2002 | A1 |
20020073327 | Vellandi | Jun 2002 | A1 |
20020083079 | Meier et al. | Jun 2002 | A1 |
20020112171 | Ginter et al. | Aug 2002 | A1 |
20020128917 | Grounds | Sep 2002 | A1 |
20020138335 | Palmer et al. | Sep 2002 | A1 |
20020138577 | Teng et al. | Sep 2002 | A1 |
20020153424 | Li | Oct 2002 | A1 |
20020156724 | Levchin et al. | Oct 2002 | A1 |
20020156836 | Janosik, Jr. et al. | Oct 2002 | A1 |
20020166063 | Lachman et al. | Nov 2002 | A1 |
20020167965 | Beasley et al. | Nov 2002 | A1 |
20030002732 | Gossett et al. | Jan 2003 | A1 |
20030002740 | Melikian et al. | Jan 2003 | A1 |
20030014327 | Skantze | Jan 2003 | A1 |
20030033161 | Walker et al. | Feb 2003 | A1 |
20030033356 | Tran et al. | Feb 2003 | A1 |
20030070080 | Rosen | Apr 2003 | A1 |
20030074301 | Solomon | Apr 2003 | A1 |
20030076242 | Burns et al. | Apr 2003 | A1 |
20030105707 | Audebert et al. | Jun 2003 | A1 |
20030105854 | Thorsteinsson et al. | Jun 2003 | A1 |
20030115334 | Bhat et al. | Jun 2003 | A1 |
20030115481 | Baird et al. | Jun 2003 | A1 |
20030120543 | Carey | Jun 2003 | A1 |
20030120586 | Litty | Jun 2003 | A1 |
20030140258 | Nelson et al. | Jul 2003 | A1 |
20030154214 | Tu et al. | Aug 2003 | A1 |
20030158751 | Suresh et al. | Aug 2003 | A1 |
20030163359 | Kanesaka | Aug 2003 | A1 |
20030163398 | Yoshioka et al. | Aug 2003 | A1 |
20030163413 | Wiczkowski | Aug 2003 | A1 |
20030172036 | Feigenbaum | Sep 2003 | A1 |
20030182551 | Frantz et al. | Sep 2003 | A1 |
20030208684 | Camacho et al. | Nov 2003 | A1 |
20030212618 | Keyes et al. | Nov 2003 | A1 |
20030233553 | Parks et al. | Dec 2003 | A1 |
20040001044 | Luciani et al. | Jan 2004 | A1 |
20040004733 | Barker et al. | Jan 2004 | A1 |
20040006553 | de Vries et al. | Jan 2004 | A1 |
20040010682 | Foster et al. | Jan 2004 | A1 |
20040027385 | Rekimoto et al. | Feb 2004 | A1 |
20040030912 | Merkle, Jr. et al. | Feb 2004 | A1 |
20040034794 | Mayer et al. | Feb 2004 | A1 |
20040073809 | Wing Keong | Apr 2004 | A1 |
20040088313 | Torres | May 2004 | A1 |
20040098618 | Kim et al. | May 2004 | A1 |
20040105431 | Monjas-Llorente et al. | Jun 2004 | A1 |
20040111621 | Himberger et al. | Jun 2004 | A1 |
20040117321 | Sancho | Jun 2004 | A1 |
20040139008 | Mascavaage, III | Jul 2004 | A1 |
20040153644 | McCorkendale et al. | Aug 2004 | A1 |
20040159699 | Nelson et al. | Aug 2004 | A1 |
20040166857 | Shim et al. | Aug 2004 | A1 |
20040171381 | Inselberg | Sep 2004 | A1 |
20040181598 | Paya et al. | Sep 2004 | A1 |
20040203750 | Cowdrey et al. | Oct 2004 | A1 |
20040230820 | Hui Hsu et al. | Nov 2004 | A1 |
20040236696 | Aoki et al. | Nov 2004 | A1 |
20040236702 | Fink et al. | Nov 2004 | A1 |
20040254890 | Sancho et al. | Dec 2004 | A1 |
20040260876 | Singh et al. | Dec 2004 | A1 |
20040260922 | Goodman et al. | Dec 2004 | A1 |
20050008148 | Jacobson | Jan 2005 | A1 |
20050015601 | Tabi | Jan 2005 | A1 |
20050022020 | Fremberg | Jan 2005 | A1 |
20050033653 | Eisenberg et al. | Feb 2005 | A1 |
20050033703 | Holdsworth | Feb 2005 | A1 |
20050039034 | Doyle et al. | Feb 2005 | A1 |
20050039219 | Cooper et al. | Feb 2005 | A1 |
20050076230 | Redenbaugh et al. | Apr 2005 | A1 |
20050085931 | Willeby | Apr 2005 | A1 |
20050097320 | Golan et al. | May 2005 | A1 |
20050108177 | Sancho | May 2005 | A1 |
20050111054 | Umeda | May 2005 | A1 |
20050113092 | Coppinger et al. | May 2005 | A1 |
20050131826 | Cook | Jun 2005 | A1 |
20050185225 | Brawn et al. | Aug 2005 | A1 |
20050188423 | Motsinger et al. | Aug 2005 | A1 |
20050204159 | Davis et al. | Sep 2005 | A1 |
20050210533 | Copeland et al. | Sep 2005 | A1 |
20050246551 | Dondl et al. | Nov 2005 | A1 |
20050278542 | Pierson et al. | Dec 2005 | A1 |
20060008779 | Shand et al. | Jan 2006 | A1 |
20060010072 | Eisen | Jan 2006 | A1 |
20060026669 | Zakas | Feb 2006 | A1 |
20060031938 | Choi | Feb 2006 | A1 |
20060048211 | Pierson et al. | Mar 2006 | A1 |
20060064346 | Steenstra et al. | Mar 2006 | A1 |
20060069619 | Walker et al. | Mar 2006 | A1 |
20060075492 | Golan et al. | Apr 2006 | A1 |
20060080263 | Willis et al. | Apr 2006 | A1 |
20060126329 | Lai | Jun 2006 | A1 |
20060130132 | Dharmarajan | Jun 2006 | A1 |
20060136294 | Linden et al. | Jun 2006 | A1 |
20060155985 | Canard et al. | Jul 2006 | A1 |
20060161501 | Waserstein et al. | Jul 2006 | A1 |
20060190331 | Tollinger et al. | Aug 2006 | A1 |
20060200855 | Willis | Sep 2006 | A1 |
20060200856 | Salowey et al. | Sep 2006 | A1 |
20060224898 | Ahmed | Oct 2006 | A1 |
20060237531 | Heffez et al. | Oct 2006 | A1 |
20060253327 | Morris et al. | Nov 2006 | A1 |
20060253328 | Kohli et al. | Nov 2006 | A1 |
20060264202 | Hagmeier et al. | Nov 2006 | A1 |
20060281541 | Nguyen et al. | Dec 2006 | A1 |
20060282660 | Varghese et al. | Dec 2006 | A1 |
20060284838 | Tsatalos et al. | Dec 2006 | A1 |
20060287902 | Helsper et al. | Dec 2006 | A1 |
20070011078 | Jain et al. | Jan 2007 | A1 |
20070030528 | Quaeler et al. | Feb 2007 | A1 |
20070038568 | Greene et al. | Feb 2007 | A1 |
20070043837 | Kruse et al. | Feb 2007 | A1 |
20070061211 | Ramer et al. | Mar 2007 | A1 |
20070061273 | Greene et al. | Mar 2007 | A1 |
20070073630 | Greene et al. | Mar 2007 | A1 |
20070094594 | Matichuk et al. | Apr 2007 | A1 |
20070097076 | Gross | May 2007 | A1 |
20070097976 | Wood et al. | May 2007 | A1 |
20070101405 | Engle et al. | May 2007 | A1 |
20070107059 | Chasin et al. | May 2007 | A1 |
20070118892 | Sastry et al. | May 2007 | A1 |
20070124246 | Lawyer et al. | May 2007 | A1 |
20070162763 | Bender et al. | Jul 2007 | A1 |
20070198410 | Labgold et al. | Aug 2007 | A1 |
20070199054 | Florencio et al. | Aug 2007 | A1 |
20070204044 | Rice et al. | Aug 2007 | A1 |
20070214151 | Scott et al. | Sep 2007 | A1 |
20070220594 | Tulsyan | Sep 2007 | A1 |
20070233599 | Ganesan et al. | Oct 2007 | A1 |
20070234070 | Horning et al. | Oct 2007 | A1 |
20070239604 | O'Connell et al. | Oct 2007 | A1 |
20070255821 | Ge et al. | Nov 2007 | A1 |
20070266257 | Camaisa et al. | Nov 2007 | A1 |
20070271466 | Mak et al. | Nov 2007 | A1 |
20070294401 | Shkedi | Dec 2007 | A1 |
20080002725 | Alicherry et al. | Jan 2008 | A1 |
20080005394 | Crooks | Jan 2008 | A1 |
20080010367 | Cheng et al. | Jan 2008 | A1 |
20080010678 | Burdette et al. | Jan 2008 | A1 |
20080015988 | Brown et al. | Jan 2008 | A1 |
20080021801 | Song et al. | Jan 2008 | A1 |
20080040653 | Levine | Feb 2008 | A1 |
20080040802 | Pierson et al. | Feb 2008 | A1 |
20080046562 | Butler | Feb 2008 | A1 |
20080052629 | Phillips et al. | Feb 2008 | A1 |
20080098222 | Zilberman | Apr 2008 | A1 |
20080101277 | Taylor | May 2008 | A1 |
20080104070 | Lonchar | May 2008 | A1 |
20080104672 | Lunde | May 2008 | A1 |
20080104684 | Lunde | May 2008 | A1 |
20080120195 | Shakkarwar | May 2008 | A1 |
20080120214 | Steele et al. | May 2008 | A1 |
20080133420 | Barber | Jun 2008 | A1 |
20080162200 | O'Sullivan et al. | Jul 2008 | A1 |
20080162202 | Khanna et al. | Jul 2008 | A1 |
20080162475 | Meggs | Jul 2008 | A1 |
20080163128 | Callanan et al. | Jul 2008 | A1 |
20080184372 | Hoshina | Jul 2008 | A1 |
20080189790 | Park | Aug 2008 | A1 |
20080201214 | Aaron | Aug 2008 | A1 |
20080204788 | Kelly et al. | Aug 2008 | A1 |
20080222706 | Renaud et al. | Sep 2008 | A1 |
20080235623 | Li | Sep 2008 | A1 |
20080239365 | Salgado et al. | Oct 2008 | A1 |
20080249820 | Pathria et al. | Oct 2008 | A1 |
20080281606 | Kitts | Nov 2008 | A1 |
20080281941 | Park et al. | Nov 2008 | A1 |
20080288299 | Schultz | Nov 2008 | A1 |
20080301281 | Wang et al. | Dec 2008 | A1 |
20080306830 | Lasa et al. | Dec 2008 | A1 |
20080313079 | Van Bosch et al. | Dec 2008 | A1 |
20080319774 | O'Sullivan et al. | Dec 2008 | A1 |
20080319841 | Oliver et al. | Dec 2008 | A1 |
20090018940 | Wang et al. | Jan 2009 | A1 |
20090024971 | Willner et al. | Jan 2009 | A1 |
20090044279 | Crawford et al. | Feb 2009 | A1 |
20090044282 | Govindaraju | Feb 2009 | A1 |
20090055398 | Zhu et al. | Feb 2009 | A1 |
20090070664 | Gavin et al. | Mar 2009 | A1 |
20090089869 | Varghese | Apr 2009 | A1 |
20090106413 | Salo | Apr 2009 | A1 |
20090138590 | Lee et al. | May 2009 | A1 |
20090157417 | Bradley et al. | Jun 2009 | A1 |
20090164269 | Gupta et al. | Jun 2009 | A1 |
20090177692 | Chagoly et al. | Jul 2009 | A1 |
20090183010 | Schnell et al. | Jul 2009 | A1 |
20090205031 | Sato et al. | Aug 2009 | A1 |
20090222308 | Zoldi et al. | Sep 2009 | A1 |
20090228585 | Kosbab et al. | Sep 2009 | A1 |
20090234738 | Britton et al. | Sep 2009 | A1 |
20090241174 | Rajan et al. | Sep 2009 | A1 |
20090260064 | McDowell et al. | Oct 2009 | A1 |
20090265773 | Schultz | Oct 2009 | A1 |
20090271306 | Pierson | Oct 2009 | A1 |
20090307141 | Kongalath et al. | Oct 2009 | A1 |
20090280777 | Doherty | Nov 2009 | A1 |
20090292568 | Khosravani et al. | Nov 2009 | A1 |
20090293128 | Lippmann et al. | Nov 2009 | A1 |
20090296907 | Vendrow et al. | Dec 2009 | A1 |
20090298480 | Khambete et al. | Dec 2009 | A1 |
20090307119 | Ahles et al. | Dec 2009 | A1 |
20090313134 | Faith et al. | Dec 2009 | A1 |
20100005013 | Uriarte | Jan 2010 | A1 |
20100030641 | Ibenforth | Feb 2010 | A1 |
20100030777 | Panwar et al. | Feb 2010 | A1 |
20100057623 | Kapur et al. | Mar 2010 | A1 |
20100070606 | Shenfield et al. | Mar 2010 | A1 |
20100082972 | Benco et al. | Apr 2010 | A1 |
20100094767 | Miltonberger | Apr 2010 | A1 |
20100094768 | Miltonberger | Apr 2010 | A1 |
20100106611 | Paulsen et al. | Apr 2010 | A1 |
20100107225 | Spencer et al. | Apr 2010 | A1 |
20100121716 | Golan | May 2010 | A1 |
20100138299 | Preston et al. | Jun 2010 | A1 |
20100145960 | Casteel et al. | Jun 2010 | A1 |
20100153540 | Li et al. | Jun 2010 | A1 |
20100157848 | Das et al. | Jun 2010 | A1 |
20100161424 | Sylvain | Jun 2010 | A1 |
20100161566 | Adair et al. | Jun 2010 | A1 |
20100169157 | Muhonen et al. | Jul 2010 | A1 |
20100169192 | Zoldi et al. | Jul 2010 | A1 |
20100192082 | Sodah | Jul 2010 | A1 |
20100199332 | Bachmann et al. | Aug 2010 | A1 |
20100199338 | Craddock et al. | Aug 2010 | A1 |
20100211464 | Zhu et al. | Aug 2010 | A1 |
20100223105 | Gassewitz et al. | Sep 2010 | A1 |
20100223145 | Dragt | Sep 2010 | A1 |
20100228625 | Priyadarshan et al. | Sep 2010 | A1 |
20100228638 | Mikan et al. | Sep 2010 | A1 |
20100257065 | Gupta et al. | Oct 2010 | A1 |
20100274678 | Rolf et al. | Oct 2010 | A1 |
20100293094 | Kolkowitz et al. | Nov 2010 | A1 |
20100306827 | Esteve Balducci et al. | Dec 2010 | A1 |
20100321296 | Gross | Dec 2010 | A1 |
20100333170 | Cox et al. | Dec 2010 | A1 |
20110022483 | Hammad | Jan 2011 | A1 |
20110022517 | Hammad | Jan 2011 | A1 |
20110035302 | Martell et al. | Feb 2011 | A1 |
20110047072 | Ciurea | Feb 2011 | A1 |
20110082768 | Eisen | Apr 2011 | A1 |
20110112901 | Fried et al. | May 2011 | A1 |
20110161228 | Suzuki et al. | Jun 2011 | A1 |
20110173281 | Smith | Jul 2011 | A1 |
20110184778 | Graepel et al. | Jul 2011 | A1 |
20110194679 | Patisaul et al. | Aug 2011 | A1 |
20110218860 | Barber | Sep 2011 | A1 |
20110225091 | Plastina et al. | Sep 2011 | A1 |
20110238575 | Nightengale et al. | Sep 2011 | A1 |
20110251951 | Kolkowitz et al. | Oct 2011 | A1 |
20110258118 | Ciurea | Oct 2011 | A1 |
20110282778 | Wright et al. | Nov 2011 | A1 |
20110288932 | Marks et al. | Nov 2011 | A1 |
20110302087 | Crooks | Dec 2011 | A1 |
20110302096 | Lowry | Dec 2011 | A1 |
20110307341 | Zohar et al. | Dec 2011 | A1 |
20110314557 | Marshall | Dec 2011 | A1 |
20120022883 | Morrison | Jan 2012 | A1 |
20120030083 | Newman et al. | Feb 2012 | A1 |
20120030757 | Baikalov et al. | Feb 2012 | A1 |
20120030771 | Pierson et al. | Feb 2012 | A1 |
20120036042 | Graylin et al. | Feb 2012 | A1 |
20120041841 | Hu et al. | Feb 2012 | A1 |
20120054136 | Maulik | Mar 2012 | A1 |
20120054847 | Schultz et al. | Mar 2012 | A1 |
20120084203 | Mehew et al. | Apr 2012 | A1 |
20120084860 | Cao et al. | Apr 2012 | A1 |
20120094639 | Carlson et al. | Apr 2012 | A1 |
20120101939 | Kasower | Apr 2012 | A1 |
20120150742 | Poon et al. | Jun 2012 | A1 |
20120150750 | Law et al. | Jun 2012 | A1 |
20120157062 | Kim et al. | Jun 2012 | A1 |
20120158586 | Ganti et al. | Jun 2012 | A1 |
20120166533 | Rubinstein et al. | Jun 2012 | A1 |
20120173465 | Hore et al. | Jul 2012 | A1 |
20120179558 | Fischer | Jul 2012 | A1 |
20120197981 | Chan | Aug 2012 | A1 |
20120204262 | Thomas et al. | Aug 2012 | A1 |
20120215896 | Johannsen | Aug 2012 | A1 |
20120216282 | Pappu et al. | Aug 2012 | A1 |
20120221470 | Lyon | Aug 2012 | A1 |
20120222111 | Oliver et al. | Aug 2012 | A1 |
20120233665 | Ranganathan et al. | Sep 2012 | A1 |
20120239553 | Gonen et al. | Sep 2012 | A1 |
20120239574 | Smith et al. | Sep 2012 | A1 |
20120239774 | Tola et al. | Sep 2012 | A1 |
20120278127 | Kirakosyan et al. | Nov 2012 | A1 |
20120295580 | Corner | Nov 2012 | A1 |
20120297380 | Colbert et al. | Nov 2012 | A1 |
20120311162 | Paulsen et al. | Dec 2012 | A1 |
20120323788 | Keresman et al. | Dec 2012 | A1 |
20120323836 | Wright et al. | Dec 2012 | A1 |
20120330787 | Hanson et al. | Dec 2012 | A1 |
20130006743 | Moore et al. | Jan 2013 | A1 |
20130018789 | Kaufmann | Jan 2013 | A1 |
20130018791 | Mendicino et al. | Jan 2013 | A1 |
20130024300 | Choudhuri et al. | Jan 2013 | A1 |
20130036304 | Lin et al. | Feb 2013 | A1 |
20130040603 | Stahlberg et al. | Feb 2013 | A1 |
20130042298 | Plaza Fonseca et al. | Feb 2013 | A1 |
20130055388 | Thomas et al. | Feb 2013 | A1 |
20130073463 | Dimmick et al. | Mar 2013 | A1 |
20130073473 | Heath | Mar 2013 | A1 |
20130085841 | Singleton et al. | Apr 2013 | A1 |
20130097673 | Meehan et al. | Apr 2013 | A1 |
20130097701 | Moyle et al. | Apr 2013 | A1 |
20130103482 | Song et al. | Apr 2013 | A1 |
20130103629 | Vaiciulis et al. | Apr 2013 | A1 |
20130110637 | Bott | May 2013 | A1 |
20130111592 | Zhu et al. | May 2013 | A1 |
20130117832 | Gandhi | May 2013 | A1 |
20130144539 | Allen et al. | Jun 2013 | A1 |
20130148525 | Cuadra Sanchez et al. | Jun 2013 | A1 |
20130159195 | Kirillin et al. | Jun 2013 | A1 |
20130185764 | Krstić et al. | Jul 2013 | A1 |
20130197998 | Buhrmann et al. | Aug 2013 | A1 |
20130198066 | Wall et al. | Aug 2013 | A1 |
20130226717 | Ahluwalia et al. | Aug 2013 | A1 |
20130273879 | Eisen et al. | Oct 2013 | A1 |
20130339186 | French | Dec 2013 | A1 |
20140032902 | Agrawal et al. | Jan 2014 | A1 |
20140114821 | Yoshioka et al. | Apr 2014 | A1 |
20140120864 | Manolarakis et al. | May 2014 | A1 |
20140122343 | Einav et al. | May 2014 | A1 |
20140258125 | Gerber et al. | Sep 2014 | A1 |
20140289867 | Bukai | Sep 2014 | A1 |
20140361926 | Eisen et al. | Dec 2014 | A1 |
20150026027 | Priess et al. | Jan 2015 | A1 |
20150046989 | Oberheide et al. | Feb 2015 | A1 |
20150106270 | Burrell et al. | Apr 2015 | A1 |
20150127825 | Johannsen | May 2015 | A1 |
20150186901 | Miltonberger | Jul 2015 | A1 |
20150193769 | Barber | Jul 2015 | A1 |
20150193821 | Izumori et al. | Jul 2015 | A1 |
20150205978 | Eisen et al. | Jul 2015 | A1 |
20150242861 | Baldassano | Aug 2015 | A9 |
20150254658 | Bondesen et al. | Sep 2015 | A1 |
20150294316 | Eisen | Oct 2015 | A1 |
20150350856 | Circosta et al. | Dec 2015 | A1 |
20160019546 | Elsen | Jan 2016 | A1 |
20160021084 | Elsen | Jan 2016 | A1 |
20160034954 | Tollinger et al. | Feb 2016 | A1 |
20160125461 | Sivaramakrishnan et al. | May 2016 | A1 |
20160203487 | Eisen | Jul 2016 | A1 |
20160246581 | Jimenez et al. | Aug 2016 | A1 |
20160321701 | Artman et al. | Nov 2016 | A1 |
20180089459 | Eisen et al. | Mar 2018 | A1 |
20180108029 | Sinha et al. | Apr 2018 | A1 |
20180121915 | Britton et al. | May 2018 | A1 |
20180262478 | Eisen | Sep 2018 | A1 |
20180322500 | Eisen | Nov 2018 | A1 |
20190028472 | Eisen | Jan 2019 | A1 |
20190066192 | Eisen | Feb 2019 | A1 |
Number | Date | Country |
---|---|---|
0 418 144 | Mar 1991 | EP |
645692 | Mar 1995 | EP |
0 923 039 | Jun 1999 | EP |
1 067 792 | Jan 2001 | EP |
1 209 935 | May 2002 | EP |
1 256 911 | Nov 2002 | EP |
1 201 070 | Jun 2006 | EP |
1 703 382 | Sep 2006 | EP |
1 197 032 | Aug 2007 | EP |
2 154 891 | Feb 2010 | EP |
2 491 101 | Nov 2012 | GB |
2 492 604 | Jan 2013 | GB |
05-257602 | Oct 1993 | JP |
2000-276281 | Oct 1993 | JP |
2000-020467 | Jan 2000 | JP |
2000099250 | Apr 2000 | JP |
2000-137755 | May 2000 | JP |
2000-242582 | Sep 2000 | JP |
2002-007697 | Jan 2002 | JP |
2002-297869 | Oct 2002 | JP |
2003-050910 | Feb 2003 | JP |
2005-063216 | Mar 2005 | JP |
2005-115644 | Apr 2005 | JP |
2005-135431 | May 2005 | JP |
2006-004333 | Jan 2006 | JP |
2007-272520 | Oct 2007 | JP |
2007-282249 | Oct 2007 | JP |
2008-022298 | Jan 2008 | JP |
2008-065363 | Mar 2008 | JP |
2008-171315 | Jul 2008 | JP |
2008-535124 | Aug 2008 | JP |
2008-243008 | Oct 2008 | JP |
2008-257434 | Oct 2008 | JP |
2008-269229 | Nov 2008 | JP |
2009-048538 | Mar 2009 | JP |
2009-122880 | Jun 2009 | JP |
2009-175984 | Aug 2009 | JP |
2010-020728 | Jan 2010 | JP |
2010-061254 | Mar 2010 | JP |
2010-122955 | Jun 2010 | JP |
2010-122956 | Jun 2010 | JP |
2010-225040 | Oct 2010 | JP |
2010-250664 | Nov 2010 | JP |
2011-065531 | Mar 2011 | JP |
2011-134252 | Jul 2011 | JP |
2011-159307 | Aug 2011 | JP |
2012-234503 | Nov 2012 | JP |
5216932 | Jun 2013 | JP |
10-1999-0015738 | Mar 1999 | KR |
10-0645983 | Nov 2006 | KR |
10-2008-0044558 | May 2008 | KR |
10-2009-0051977 | Sep 2009 | KR |
10-2010-0085888 | Jul 2010 | KR |
WO 96041488 | Dec 1996 | WO |
WO 97003410 | Jan 1997 | WO |
WO 99050775 | Oct 1999 | WO |
WO 01011450 | Feb 2001 | WO |
WO 01033520 | May 2001 | WO |
WO 01095550 | Dec 2001 | WO |
WO 01097134 | Dec 2001 | WO |
WO 02001462 | Jan 2002 | WO |
WO 02071176 | Sep 2002 | WO |
WO 02091226 | Nov 2002 | WO |
WO 03017155 | Feb 2003 | WO |
WO 03025868 | Mar 2003 | WO |
WO 03075197 | Sep 2003 | WO |
WO 03075197 | Dec 2003 | WO |
WO 2004038997 | Dec 2003 | WO |
WO 02037219 | May 2004 | WO |
WO 2005038818 | Apr 2005 | WO |
WO 2005099166 | Oct 2005 | WO |
WO 2006135367 | Dec 2006 | WO |
WO-2006135367 | Dec 2006 | WO |
WO 2007001394 | Jan 2007 | WO |
WO 2007045818 | Apr 2007 | WO |
WO 2007072238 | Jun 2007 | WO |
WO 2007075573 | Jul 2007 | WO |
WO 2008029828 | Mar 2008 | WO |
WO 2008054849 | May 2008 | WO |
WO 2009132148 | Oct 2009 | WO |
WO 2012054646 | Apr 2012 | WO |
WO 2012061801 | May 2012 | WO |
WO 2012142121 | Oct 2012 | WO |
WO 2012142584 | Oct 2012 | WO |
WO 2013006538 | Jan 2013 | WO |
WO 2013142722 | Sep 2013 | WO |
WO 2014022813 | Feb 2014 | WO |
WO 2014078569 | May 2014 | WO |
Entry |
---|
• The Nightmare. Secrets of a Super Hacker. (1994). Retrieved online May 29, 2019. http://67.225.133.110/˜gbpprorg/2600/Secrets_of_a_Super_Hacker.pdf (Year: 1994). |
International Search Report and Written Opinion received in PCT Application No. PCT/US2005/020750, dated Jun. 13, 2008. |
Banking Services Newsletter, “Keeping You Up-to-Date on Banking Developments Throughout the UC System”, University of California, Office of the President, Banking Services Group, Newsletter 1, Dec. 2005, p. 1. |
Bharosa, “Bharosa Authenticator”, http://www.bharosa.com/authenticator.html, Jan. 18, 2007, pp. 3. |
Bharosa, “Bharosa Announces Online Authentication Solution to Counter Check 21-Based Fraud”, http://www.bharosa.com/news/PR-110705.html, Jan. 18, 2007, pp. 2. |
Darlin, Damon, “Opening the Door on the Credit Report and Throwing Away the Lock”, http://www.nytimes.com/2006/03/18/business/yourmoney/18money.html, The New York Times, Saturday Mar. 18, 2006, pp. 2. |
Derfler, Jr. et al, “How Networks Work”, Millennium Edition, Que Corporation, Indianapolis, IN, Sep. 2000. |
Gralla, Preston, “How the Internet Works”, Millennium Edition, Que Corporation, Indianapolis, IN, Aug. 1999. |
Gueye et al., “Constraint-Based Geolocation of Internet Hosts”, ACM Internet Measurement Conference 2004, Oct. 25-27, 2004, Taormina, Sicily, Italy, vol. 14, No. 6, pp. 288-293. |
“ISO 8583”, Wikipedia, http://en.wikipedia.org/wiki/ISO_8583, dated Apr. 13, 2015 in 14 pages. |
Kohno et al., “Remote Physical Device Fingerprinting”, Proceedings of 2005 IEEE Symposium on Security and Privacy, May 8-11, 2005, Oakland, CA, pp. 211-225. |
Manavoglu et al., “Probabilistic User Behavior Models”, ICDM, Third IEEE International Conference on Data Mining, Nov. 19-22, 2003, pp. 203-210. |
TechWeb, “Wells Fargo Intros Anti-Theft Alerts”, http://www.techweb.com/wire/166404177, Aug. 1, 2005, pp. 1. |
“UPIC Marketing Guide—The Clearing House”, http://www.upic.com/infofiles/UPIC_Marketing_Guide.pdf, as printed Dec. 19, 2006. pp. 1-16. |
White, Ron, “How Computers Work”, Millennium Edition, Que Corporation, Indianapolis, IN, Sep. 1999. |
U.S. Appl. No. 10/612,375, filed Jul. 1, 2003, U.S. Pat. No. 9,412,123, Keystroke Analysis. |
Official Communication in European Patent Application No. 05818903.6, dated Dec. 23, 2011. |
Official Communication in European Patent Application No. 05818903.6, dated Mar. 18, 2014. |
Official Communication in European Patent Application No. 05818903.6, dated Jul. 18, 2017. |
International Search Report and Written Opinion for Application No. PCT/US2005/035532, dated Oct. 29, 2007. |
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2005/035532, dated Jan. 9, 2008. |
Official Communication in European Patent Application No. 6845722.5, dated Mar. 13, 2009. |
Official Communication in European Patent Application No. 8159110.9, dated Oct. 27, 2008. |
Official Communication in European Patent Application No. 8159110.9, dated Mar. 22, 2010. |
International Search Report and Written Opinion for Application No. PCT/US2006/048251, dated Feb. 26, 2008. |
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2006/048251, dated Jun. 18, 2008. |
International Search Report and Written Opinion for Application No. PCT/US2007/065776, dated Jul. 3, 2008. |
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2007/065776, dated Sep. 30, 2008. |
International Preliminary Report on Patentability and Written Opinion received in PCT Application No. PCT/US2005/020750, dated Jul. 1, 2008. |
Official Communication in European Patent Application No. 08165224.0, dated Nov. 15, 2010. |
Supplementary European Search Report for Application No. EP09735653, dated Dec. 16, 2011. |
Official Communication for Application No. EP09735653, dated Jan. 4, 2013. |
Summons to Attend Oral Proceedings received in European Application No. EP09735653, dated Oct. 7, 2016. |
International Search Report and Written Opinion for Application No. PCT/US2009/041462, dated Dec. 1, 2009. |
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2009/041462, dated Nov. 4, 2010. |
International Search Report and Written Opinion for Application No. PCT/US2011/056948, dated Apr. 18, 2012. |
International Preliminary Report on Patentability in Application No. PCT/US2011/056948, dated May 2, 2013. |
International Search Report and Written Opinion for Application No. PCT/US2013/033357, dated Jul. 10, 2013. |
International Preliminary Report on Patentability in Application No. PCT/US2013/033357, dated Sep. 23, 2014. |
International Search Report and Written Opinion for Application No. PCT/US2013/053495, dated Nov. 22, 2013. |
International Preliminary Report on Patentability in Application No. PCT/US2013/053495, dated Feb. 3, 2015. |
International Search Report and Written Opinion for Application No. PCT/US2013/070146, dated Mar. 3, 2014. |
International Preliminary Report on Patentability in Application No. PCT/US2013/070146, dated May 28, 2015. |
Provisional Application as filed in U.S. Appl. No. 61/324,312, dated Apr. 15, 2010 in 15 pages. |
Number | Date | Country | |
---|---|---|---|
20170039571 A1 | Feb 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10612375 | Jul 2003 | US |
Child | 15204654 | US |