US 8,635,690 B2Grant
Reputation based message processing
Issue Date:2014-01-21
•15 Claims
•13 Drawing Sheets
Abstract
Methods and systems for processing electronic communications based upon reputation. Reputation of an entity associated with the electronic communication can be generated. The communication can be placed in a queue based upon the reputation. The queued communication can be processed based upon updated information about the entity.
Metadata
Assignee
- McAfee, Inc.
Inventors
- Dmitri Alperovitch
- Sven Krasser
Application Information
Application Number:US 12/020,370
Filing Date:2008-01-25
Priority Date:2004-11-05
Art Unit:2494
Classifications
IPC:
G06F12/14
Patent Drawings (13 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a continuation-in-part and claims priority to and the benefit of U.S. application Ser. No. 11/142,943 (entitled “Systems And Methods For Classification Of Messaging Entities”) filed on Jun. 2, 2005, which claims priority as a utility of U.S. Provisional Application Ser. No. 60/625,507 (entitled “Classification of Messaging Entities”) filed on Nov. 5, 2004, both of which the entire disclosures (including any and all figures) are incorporated herein by reference.
[0002] This application is a continuation-in-part and claims priority to and the benefit of U.S. application Ser. No. 11/173,941 (entitled “Message Profiling Systems And Methods”) filed on Jul. 1, 2005, which claims priority as a utility of U.S. Provisional Application Ser. No. 60/625,507 (entitled “Classification of Messaging Entities”) filed on Nov. 5, 2004, both of which the entire disclosures (including any and all figures) are incorporated herein by reference.
Background and Field
[0003] This disclosure relates generally to processing electronic communications.
[0004] Spammers and other malicious internet users use various creative means for evading detection by messaging filters. Accordingly, message filter designers adopt a strategy of combining various detection techniques in their filters.
[0005] Current tools for message sender analysis include IP blacklists (sometimes called real-time blacklists (RBLs)) and IP whitelists (real-time whitelists (RWLs)). Whitelists and blacklists certainly add value to the spam classification process; however, whitelists and blacklists are inherently limited to providing a binary-type (YES/NO) response to each query. In contrast, a reputation system has the ability to express an opinion of a sender in terms of a scalar number in some defined range. Thus, where blacklists and whitelists are limited to “black and white” responses, a reputation system can express “shades of gray” in its response.
[0006] In accordance with the teachings disclosed herein, methods and systems are provided for operation upon one or more data processors for assigning a reputation to a messaging entity. A method can include receiving data that identifies one or more characteristics related to a messaging entity's communication. A reputation score is determined based upon the received identification data. The determined reputation score is indicative of reputation of the messaging entity. The determined reputation score is used in deciding what action is to be taken with respect to a communication associated with the messaging entity.
Summary
[0007] Systems, methods, apparatuses and computer program products for processing electronic communications are provided. In one aspect, methods are disclosed, which include: receiving a message through a communications interface, the message comprising information about an entity; identifying a reputation for the entity associated with the message; queuing the message based upon the reputation associated with the entity or based upon a message profile associated with the message, thereby delaying delivery of the message; and processing the queued message based upon updated reputation or message profile information.
[0008] Systems can include a communications interface, a message processing module, a queuing module and a reprocessing module. The communications interface can receive electronic messages associated with an entity. The message processing module can process the electronic message to identify the entity and can send a reputation query to a reputation module to identify a reputation of the entity associated with the electronic message. The queuing module can place an electronic message into a queue based upon the reputation of the entity associated with the electronic message. The reprocessing module can periodically query the reputation module for an updated reputation for the entity associated with the electronic message, and can process the electronic message based upon the updated reputation of the entity associated with the electronic message.
[0009] The details of one or more embodiments of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.
Description of Drawings
[0010] FIG. 1 is a block diagram depicting a system for handling transmissions received over a network.
[0011] FIG. 2 is a block diagram depicting a reputation system that has been configured for determining reputation scores.
[0012] FIG. 3 is a table depicting reputation scores at various calculated probability values.
[0013] FIG. 4 is a graph depicting reputation scores at various calculated probability values.
[0014] FIG. 5 is a flowchart depicting an operational scenario for generating reputation scores.
[0015] FIG. 6 is a block diagram depicting use of non-reputable criteria and reputable criteria for determining reputation scores.
[0016] FIG. 7 is a block diagram depicting a reputation system configured to respond with a return value that includes the reputation score of a sender.
[0017] FIG. 8 is a block diagram illustrating an example reputation based message processing system.
[0018] FIG. 9 is a block diagram illustrating an example reputation server.
[0019] FIG. 10 is a flowchart illustrating an example method for reputation based message processing.
[0020] FIG. 11 is a flowchart illustrating an example method for reputation based message processing.
[0021] FIG. 12 is a block diagram depicting a server access architecture.
Detailed Description
[0022] FIG. 1 depicts at 30 a system for handling transmissions received over a network 40. The transmissions can be many different types of communications, such as electronic mail (e-mail) messages sent from one or more messaging entities 50. The system 30 assigns a classification to a messaging entity (e.g., messaging entity 52), and based upon the classification assigned to the messaging entity, an action is taken with respect to the messaging entity's communication.
[0023] The system 30 uses a filtering system 60 and a reputation system 70 to help process communications from the messaging entities 50. The filtering system 60 uses the reputation system 70 to help determine what filtering action (if any) should be taken upon the messaging entities' communications. For example, the communication may be determined to be from a reputable source and thus the communication should not be filtered.
[0024] The filtering system 60 identifies at 62 one or more message characteristics associated with a received communication and provides that identification information to the reputation system 70. The reputation system 70 evaluates the reputation by calculating probabilities that the identified message characteristic(s) exhibit certain qualities. An overall reputation score is determined based upon the calculated probabilities and is provided to the filtering system 60.
[0025] The filtering system 60 examines at 64 the reputation score in order to determine what action should be taken for the sender's communication (such as whether the communication transmission should be delivered to the communication's designated recipient located within a message receiving system 80). The filtering system 60 could decide that a communication should be handled differently based in whole or in part upon the reputation scored that was provided by the reputation system 70. As an illustration, a communication may be determined to be from a non-reputable sender and thus the communication should be handled as Spam (e.g., deleted, quarantined, etc.).
[0026] Reputation systems may be configured in many different ways in order to assist a filtering system. For example, a reputation system 70 can be located externally or internally relative to the filtering system 60 depending upon the situation at hand. As another example, FIG. 2 depicts a reputation system 70 that has been configured to calculate reputation scores based upon such message characteristic identification information as sender identity as shown at 82. It should be understood that other message characteristics can be used instead of or in addition to sender identity. Moreover, transmissions may be from many different types of messaging entities, such as a domain name, IP address, phone number, or individual electronic address or username representing an organization, computer, or individual user that transmits electronic messages. For example, generated classifications of reputable and non-reputable can be based upon a tendency for an IP address to send unwanted transmissions or legitimate communication.
[0027] The system's configuration 90 could also, as shown in FIG. 2 , be established by identifying a set of binary, testable criteria 92 which appear to be strong discriminators between good and bad senders. P (NR|Ci) can be defined as the probability that a sender is non-reputable, given that it conforms to quality/criterion Ci, and P (R|Ci) can be defined as the probability that a sender is reputable, given that it conforms to quality/criterion Ci.
[0028] For each quality/criterion Ci, periodic (e.g., daily, weekly, monthly, etc.) sampling exercises can be performed to recalculate P (NR|Ci). A sampling exercise may include selecting a random sample set S of N senders for which quality/criterion Ci is known to be true. The senders in the sample are then sorted into one of the following sets: reputable (R), non-reputable (NR) or unknown (U). NR is the number of senders in the sample that are reputable senders, NNR is the number of senders that are non-reputable senders, etc. Then, P (NR|Ci) and P (R|Ci) are estimated using the formulas:
[0029]
For this purpose, N=30 was determined to be a large enough sample size to achieve an accurate estimate of P (NR|Ci) and P (R|Ci) for each quality/criterion Ci.
For this purpose, N=30 was determined to be a large enough sample size to achieve an accurate estimate of P (NR|Ci) and P (R|Ci) for each quality/criterion Ci.
[0030] After calculating P (NR|Ci) and P (R|Ci) for all criteria, the computed probabilities are used to calculate an aggregate non-reputable probability 94, PNR, and an aggregate reputable sender probability 96, PR, for each sender in the reputation space. These probabilities can be calculated using the formulas:
[0031]
In experimentation, the above formulas appeared to behave very well for a wide range of input criteria combinations, and in practice their behavior appears to be similar to the behavior of the formula for correctly computing naïve joint conditional probabilities of “non-reputable” and “reputable” behavior for the input criteria.
In experimentation, the above formulas appeared to behave very well for a wide range of input criteria combinations, and in practice their behavior appears to be similar to the behavior of the formula for correctly computing naïve joint conditional probabilities of “non-reputable” and “reputable” behavior for the input criteria.
[0032] After calculating PNR and PR for each sender, a reputation score is calculated for that sender using the following reputation function:
[0033]
-
- [0034] where
- [0035] c1=86.50
- [0036] c2=−193.45
- [0037] c3=−35.19
- [0038] c4=581.09
- [0039] c5=234.81
- [0040] c6=−233.18
- [0041] c7=0.51
It should be understood that different functions can act as a reputation score determinator 98 and can be expressed in many different forms in addition to a functional expression. As an illustration,FIG. 3 depicts at 100 a tabular form for determining reputation scores. The table shows reputation scores produced by the above function, based on values of PNR and PR as they each vary between 0.0 and 1.0. For example as shown at 110, a reputation score of 53 is obtained for the combination of PNR=0.9 and PR=0.2. This reputation score is a relatively high indicator that the sender should not be considered reputable. A reputation score of 0 is obtained if PNR and PR are the same (e.g., the reputation score is 0 if PNR=0.7 and PR=0.7 as shown at 120). A reputation score can have a negative value to indicate that a sender is relatively reputable as determined when PR is greater than PNR. For example, if PNR=0.5 and PR=0.8 as shown at 130, then the reputation score is −12.
[0042] Reputation scores can be shown graphically as depicted in FIG. 4 at 150. Graph 150 was produced by the above function, based on values of PNR and PR. FIG. 4 illustrates reputation score determinations in the context of Spam in that the terms PNR and PR are used respectively as probability of hamminess and probability of spamminess as the probabilities each vary between 0.0 and 1.0.
[0043] As shown in these examples, reputation scores can be numeric reputations that are assigned to messaging entities based on characteristics of a communication (e.g., messaging entity characteristic(s)) and/or a messaging entity's behavior. Numeric reputations can fluctuate between a continuous spectrum of reputable and non-reputable classifications. However, reputations may be non-numeric, such as by having textual, or multiple level textual categories.
[0044] FIG. 5 depicts an operational scenario wherein a reputation system is used by a filtering system to generate reputation scores. In this operational scenario, a reputation score is computed for a particular sender (e.g., IP address, domain name, phone number, address, name, etc), from a set of input data. With reference to FIG. 5 , data is gathered at step 200 that is needed to calculate non-reputable and reputable probabilities for a sender. The data is then aggregated at step 210 and used in probability calculations at step 220. This includes determining, for a sender, non-reputable probabilities and reputable probabilities for various selected criteria. An aggregate non-reputable probability and an aggregate reputable probability are then calculated for each sender.
[0045] After calculating an aggregate non-reputable probability and an aggregate reputable probability for each sender, a reputation score is calculated at 230 for that sender using a reputation function. At step 240, the sender's reputation score is distributed locally and/or to one or more systems to evaluate a communication associated with the sender. As an illustration, reputation scores can be distributed to a filtering system. With the reputation score, the filtering system can choose to take an action on the transmission based on the range the sender reputation score falls into. For unreputable senders, a filtering system can choose to drop the transmission (e.g., silently), save it in a quarantine area, or flag the transmission as suspicious. In addition, a filter system can choose to apply such actions to all future transmissions from this sender for a specified period of time, without requiring new lookup queries to be made to the reputation system. For reputable senders, a filtering system can similarly apply actions to the transmissions to allow them to bypass all or certain filtering techniques that cause significant processing, network, or storage overhead for the filtering system.
[0046] It should be understood that similar to the other processing flows described herein, the processing and the order of the processing may be altered, modified and/or augmented and still achieve the desired outcome. For example, an optional addition to the step of extracting unique identifying information about the sender of the transmission would be to use sender authentication techniques to authenticate certain parts of the transmission, such as the purported sending domain name in the header of the message, to unforgeable information about the sender, such as the IP address the transmission originated from. This process can allow the filtering system to perform lookups on the reputation system by querying for information that can potentially be forged, had it not been authenticated, such as a domain name or email address. If such domain or address has a positive reputation, the transmission can be delivered directly to the recipient system bypassing all or some filtering techniques. If it has a negative reputation, the filtering system can choose to drop the transmission, save it in a quarantine area, or flag it as suspicious.
[0047] Many different types of sender authentication techniques can be used, such as the Sender Policy Framework (SPF) technique. SPF is a protocol by which domain owners publish DNS records that indicate which IP addresses are allowed to send mail on behalf of a given domain. As other non-limiting examples, SenderID or DomainKeys can be used as sender authentication techniques.
[0048] As another example, many different types of criteria may be used in processing a sender's communication. FIG. 6 depicts the use of non-reputable criteria 300 and reputable criteria 310 for use in determining reputation scores.
[0049] The non-reputable criteria 300 and reputable criteria 310 help to distinguish non-reputable senders and reputable senders. A set of criteria can change often without significantly affecting the reputation scores produced using this scoring technique. As an illustration within the context of SPAM identification, the following is a list of spamminess criteria that could be used in the reputation scoring of a message sender. The list is not intended to be exhaustive, and can be adapted to include other criteria or remove criteria based upon observed behavior.
-
- [0050] 1. Mean Spam Score: A sender is declared “non-reputable” if a mean spam profiler score of transmissions that it sends exceeds some threshold, W.
- [0051] 2. RDNS Lookup Failure: A sender is declared “non-reputable” if reverse domain name system (RDNS) queries for its IP addresses fail.
- [0052] 3. RBL Membership: A sender is declared “non-reputable” if it is included in a real-time blackhole list (RBL). (Note: multiple RBLs may be used. Each RBL can constitute a separate testing criterion.)
- [0053] 4. Mail Volume: A sender is declared “non-reputable” if its average (mean or median) transmission volume exceeds a threshold, X, where X is measured in transmissions over a period of time (such as, e.g., a day, week, or month). (Note: multiple average volumes over multiple time periods may be used, and each average volume can constitute a separate testing criterion.)
- [0054] 5. Mail Burstiness/Sending History: A sender is declared “non-reputable” if its average (mean or median) transmission traffic pattern burstiness (defined by the number of active sending sub-periods within a larger time period, e.g., number of active sending hours in a day or number of active sending days in a month) is less than some threshold, Y, where Y is measured in sub-periods per period. (Note: multiple average burstiness measures over multiple time periods may be used, and each average burstiness measure can constitute a separate testing criterion.)
- [0055] 6. Mail Breadth: A sender is declared “non-reputable” if its average (mean or median) transmission traffic breadth (as defined by the percentage of systems that receive transmissions from the same sender during a period of time (such as, e.g., a day, week, or month)) exceeds some threshold, Z. (Note: multiple average breadths over multiple time periods may be used, and each average breadth measure can constitute a separate testing criterion.)
- [0056] 7. Malware Activity: A sender is declared “non-reputable” if it is known to have delivered one or more malware codes (such as, e.g., viruses, spyware, intrusion code, etc) during a measurement period (e.g., a day, week, or month).
- [0057] 8. Type of Address: A sender is declared “non-reputable” if it is known to be dynamically assigned to dial-up or broadband dynamic host control protocol (DHCP) clients by an internet service provider (ISP).
- [0058] 9. CIDR Block Spamminess: A sender is declared “non-reputable” if its IP addresses are known to exist within classless inter-domain routing (CIDR) blocks that contain predominantly “non-reputable” IP addresses.
- [0059] 10. Human Feedback: A sender is declared “non-reputable” if it is reported to have sent undesirable transmissions by people analyzing the content and other characteristics of those transmissions.
- [0060] 11. SpamTrap Feedback: A sender is declared “non-reputable” if it is sending transmissions to accounts that have been declared as spamtraps and as such are not supposed to receive any legitimate transmissions.
- [0061] 12. Bounceback Feedback: A sender is declared “non-reputable” if it is sending bounceback transmissions or transmissions to accounts that do not exist on the destination system.
- [0062] 13. Legislation/Standards Conformance: A sender is declared “non-reputable” if it is not conforming to laws, regulations, and well-established standards of transmission behavior in the countries of operation of either the sender and/or the recipient of the transmissions.
- [0063] 14. Continuity of Operation: A sender is declared “non-reputable” if it has not operated at that sending location longer than some threshold Z.
- [0064] 15. Responsiveness to Recipient Demands: A sender is declared “non-reputable” if it is not responding in a reasonable timeframe to legitimate demands of the recipients to terminate their relationship with the sender to not receive any more transmissions from them.
[0065] The following is a list of “reputable” criteria that could be used in determining the “reputability” of a sender. The list is not intended to be exhaustive, and can be adapted to include other criteria or remove criteria based upon observed behavior.
-
- [0066] 1. Mean Spam Score: A sender is declared “reputable” if the mean spam profiler score of transmissions that it sends falls below some threshold, W.
- [0067] 2. Human Feedback: A sender is declared “reputable” if it is reported to have sent only legitimate transmissions by people analyzing transmission flows from that sender, in conjunction with the reputation of the organization that owns those sending stations.
[0068] After computing a reputation grade for each sender in the universe of senders, a reputation classification can be made available via a communication protocol that can be interpreted by the queriers that make use of the reputation system (e.g., DNS, HTTP, etc). As shown in FIG. 7 , when a query 350 is issued for a sender, the reputation system can respond with a return value 360 that includes the reputation score of that sender, as well as any other relevant additional information that can be used by the querier to make the final judgment on the acceptability of the sender's transmission (e.g., age of the reputation score, input data that determined the score, etc).
[0069] An example of a communication protocol that can be used is a domain name system (DNS) server which can respond with a return value in the form of an IP address: 172.x.y.z. The IP address can be encoded using the formula:
[0070]
[0071] The reputation of the queried sender can be deciphered from the return value as follows:
rep=(−1)2−x×(256y+z)
rep=(−1)2−x×(256y+z)
[0072] Therefore, when x=0, the returned reputation is a positive number, and when x=1, the returned reputation is a negative number. The absolute value of the reputation is determined by the values of y and z. This encoding scheme enables the server to return via the DNS protocol reputation values within the range [−65535, 65535]. It also leaves seven (7) unused bits, namely the seven high-order bits of x. These bits can be reserved for extensions to the reputation system. (For example, the age of a reputation score may be communicated back to the querier.)
[0073] FIG. 8 is a block diagram illustrating an example reputation based message processing system. The reputation based message processing system can include a communication processing system 500. The communication processing system 500 can receive messages through a network 505. The messages can include electronic communications from a messaging entity 510 to a client 515. In some implementations, the electronic communications can be controlled by a message transfer agent (MTA) 520. In various examples, electronic communications can include electronic mail, hypertext transfer protocol (HTTP) messages, file transfer protocol (FTP) messages, instant messaging messages, and real-time streaming protocol messages, voice over internet protocol (VoIP) messages, among many others.
[0074] The communication processing system 500 can operate to determine a message threat associated with messages received from the network. In some implementations, the message processing system 500 can include a communications interface 525, a message processing module 530, a queuing module 535, and an optional reprocessing module 540. The components of the communications processing system 500 can query reputation information and/or message profiling information from other system. However, in some implementations, a reputation system and/or a message profiler can be internal to the communication processing system 500.
[0075] The communications interface 525 can operate to receive messages through the network 505. In some implementations, the communications interface 525 can receive messages of a variety of protocols based upon the protocols supported by the communications processing system 500. The communications interface 525 can also operate to send communications to other devices coupled to the network 505.
[0076] The message processing module 530 can operate to query a reputation module (e.g., reputation server 545) and/or a message profiler 550. In some implementations, the message processing module 530 can use local reputation and/or message profile information to classify a risk associated with a message. In other implementations, the message processing module 530 can use non-local (e.g., global) reputation and/or message profile information to classify risk associated with a message. In still further implementations, a combination of local and non-local reputation and/or message profile information can be used to classify a risk associated with a message.
[0077] The message processing module 530 can process the message based upon reputation and/or message profile information associated with the message. In some implementations, when the reputation and/or reputation profile information is indeterminate, the message processing module 530 can send the message to a queuing module 535. An indeterminate reputation can be, for example, a reputation associated with an entity that has not previously been observed by the reputation server 545. In some implementations, a score is associated with all entities, some scores are not strong enough to provide an accurate classification of the message. An indeterminate message profile can be, for example, a message that has not previously been interrogated by the message profiler. When the reputation or message profile information associated with the message is indeterminate, the entity or message profile might not have been observed by the system prior to the current message.
[0078] The queuing module 535 can operate to store messages with indeterminate reputation or message profile information in a queue such that delivery of those messages to a recipient (e.g., client 515) is delayed. While the message is stored by the queuing module 535, a reputation module (e.g., reputation server 545) can collect additional information about an entity associated with the message. When the reputation module has collected enough information to identify a determinate reputation (e.g., reputable or non-reputable), the message can be released from the queuing module 535.
[0079] In some implementations, a reprocessing module 540 can periodically query a reputation module (e.g., reputation server 545) and/or a message profiler 550 to identify a reputation of entities associated with messages stored by the queuing module 535. In other implementations, the reputation server 545 or message profiler 550 can collect additional information about the entity, and can affirmatively notify the reprocessing module 540 when a reputation has been determined (e.g., without receiving a query). The reprocessing module 540 can remove a message the queuing module and process the message based upon updated reputation and/or message profile information received from the reputation server 545 and the message profiler 550, respectively. Thus, delivery of messages which have an indeterminate reputation or message profile can be delayed until the reputation or message profile is determinate of the classification of risk associated with the message. In some implementations, if a message has been stored by the queuing module for greater than a threshold period of time, the message can be reprocessed with the indeterminate reputation and/or message profile. In further implementations, notification of a queued message can be provided to a recipient, and the recipient can be provided with a manual release interface whereby he/she can manually release the message from the queue.
[0080] In some implementations, the reprocessing module 540 can instruct an MTA 520 to deliver the message if the updated reputation indicates that the reputation of the message is reputable and/or the updated message profile indicates that the message is legitimate. In further implementations, the reprocessing module 540 can send the message to a message interrogation engine based upon the updated reputation indicates that the message is non-reputable or that an updated message profile indicates that the message is non-legitimate. Message interrogation engines can include, for example, virus interrogation engines, spam interrogation engines, phishing interrogation engines, etc. designed to identify specific anomalies within communications that exhibit a specific tendency. For example, a reputation may indicate that a message is associated with an entity that has a reputation for viruses. In such instances, the message can be sent to virus interrogation engines to provide protection against the specific tendency the entity exhibits. In other examples, the message can be sent to multiple interrogation engines responsive to updated reputation or message profile information. In still further examples, messages that are associated with non-reputable entities or have non-legitimate message profiles can be interrogated by each of a plurality of interrogation engines.
[0081] In some implementations, the optional reprocessing module 540 can be included within the message processing module 530. Thus, the message processing module 530 can provide both the initial processing of a received message and the subsequent reprocessing of a queued message.
[0082] FIG. 9 is a block diagram illustrating an example reputation server. In various implementations, the reputation server 545 can include a communications interface 600, a reputation module 610, a flagging module 620, and a reputation information collection module 630. The communications interface 600 can operate to receive reputation queries from other devices (e.g., communication processing system 500). The reputation queries can include information about the entity (e.g., message originator, message recipient, message components, an intermediate server, a transit path associated with the communication of the message, among others) being queried. In some implementations, the query can include the message itself, and the reputation server can parse the entities associated with the message.
[0083] The reputation module 610 can score the reputation of an entity associated with a queried message. The reputation score can be a raw score indicating the risk associated with an entity related to the message. In some implementations, the reputation module 610 can abstract the score to provide a classification of the reputation score. For example, a message that has a score indicating a high likelihood that the entity is non-reputable can be rated as non-reputable. In other examples, if an entity associated with the message shows only a low correlation to either reputable or non-reputable behavior, the reputation module 610 can instruct the flagging module 620 to label the reputation of an entity associated with the message as indeterminate.
[0084] In some implementations, the flagging module 620 can instruct the communications interface to transmit a flagging instruction to a message processing system (e.g., communications processing system 500 of FIG. 8 ). The flagging instruction can instruct the message processing system to flag the message for delayed delivery until a determinate reputation of an entity associated with the message can be identified or the message is otherwise released (e.g., manually released, threshold period of time, etc).
[0085] The flagging module 620 can also instruct a reputation information collection module 630 to collect additional information related to the entity. The reputation information collection module 630 can collect additional reputation information, for example, by querying other reputation modules. In other examples, the reputation information collection module 630 can collect additional reputation information by identifying relationships between the entity and known classified entities. In still further examples, the reputation information collection module 630 can collect additional reputation information by collecting additional messages associated with the entity.
[0086] Upon identifying a determinate reputation associated with the entity, the reputation information collection module can instruct the communications interface 600 to communicate the reputation information to a message processing system (e.g., communications processing system 500 of FIG. 8 ). In other implementations, the reputation information collection module can communicate the additional reputation information to the reputation module 610. The reputation module 610 can thereby derive a reputation associated with the entity and communicate the reputation to the message processing system through the communications interface 600 when the reputation is determinate. In other implementations, a message processing system can continue to query the reputation server with regard to any messages flagged by the reputation server for queuing by the queuing module.
[0087] FIG. 10 is a flowchart illustrating an example method for reputation based message processing. At stage 700 a message is received. The message can be received, for example, by a communications interface (e.g., communications interface 525 of FIG. 8 ). In some implementations, the communications interface can be configured to receive messages in a variety of different formats and/or protocol. For example, the communications interface can be configured to receive protocols including, electronic mail (e.g., internet message access protocol (IMAP), simple mail transfer protocol (SMTP), post office protocols (e.g., POP3), etc.), streaming protocols (e.g., session initiation protocol (SIP), internet relay chat (IRC), instant messaging, videoconferencing, etc.), HTTP, FTP, etc.
[0088] At stage 710 the reputation of an entity associated with the message can be identified. The reputation can be identified, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ) in conjunction with a reputation module (e.g., reputation server 545 of FIG. 8 ). In some implementations, the reputation module and message processing module can both be provided by a communication processing system (e.g., communication processing system 500 of FIG. 8 ). In other implementations, the reputation module can be separate from the communication processing system. The message processing module, for example, can communicate a query to the reputation module. In some implementations, the query can include the message itself. In other implementations, the message processing module can parse the message and extract the various entities associated with the message and query each of those entities.
[0089] In other implementations, a message profile can be obtained in addition to (or instead of) the entity reputation. The message profile can be derived by comparing the features of the message with features of similar messages. A detailed description of message profiling can be found in U.S. application Ser. No. 11/173,941 (entitled “Message Profiling Systems And Methods”) filed on Jul. 1, 2005, which is incorporated herein by reference. Message profiling can identify legitimate messages versus non-legitimate messages through identification of feature vectors. In some implementations, a message profiler and the message processing module can be provided by a communication processing system (e.g., communication processing system 500 of FIG. 8 ). In other implementations, the message profiler (e.g., message profiler 550 of FIG. 8 ) can be separate from the communication processing system.
[0090] At stage 720 the message can be queued based upon the reputation of an entity associated with the message. The message can be queued for example, by a queuing module (e.g., queuing module 535 of FIG. 8 ). In some implementations, the message can be queued if the reputation information has not reached a threshold volume to provide an accurate reputation judgment. In other implementations, the message can be queued even if a large volume of reputation information has been gathered, but the reputation remains indeterminate. The queuing module can save the message to a processing queue, whereby the entity might not be assumed to be either reputable or non-reputable, but merely placed aside while further information is collected about the entity. This can facilitate collection of information which might be determinate of a reputation for the entity. In some implementations, after the collection of additional information, the message can be released from the queue, even if the reputation is still indeterminate. For example, if the message has been queued for more than an hour without discovery of reputation information which classifies the risk associated with the entity as reputable or non-reputable, the message can be released and processed by a reprocessing module (e.g., reprocessing module 540 or message processing module 530 of FIG. 8 ).
[0091] In some implementations, message processing module can be biased to assume that a message with an indeterminate reputation is non-reputable. In such implementations, the message can be tested by dedicated interrogation engines operable to determine whether the message includes any known threats. In other implementations, the message processing module can be biased to assume that a message with an indeterminate reputation is reputable. Such messages can be delivered to the recipient (e.g., through an MTA 515 of FIG. 8 ).
[0092] Similarly, in those implementations which include message profiling, if a message profile is indeterminate, the message can be queued by a queuing module (e.g., queuing module 535 of FIG. 8 ). In some implementations, the message can be queued if the message profile information has not reached a threshold volume to provide an accurate message profile judgment. In other implementations, the message can be queued even if a large volume of message profile information has been gathered, but the message profile remains indeterminate. The queuing module can save the message to a processing queue, whereby the entity might not be assumed to be either legitimate or non-legitimate, but merely placed aside while further information is collected about the entity. This can facilitate collection of information which might be determinate of a message profile. In some implementations, after the collection of additional information, the message can be released from the queue, even if the message profile is still indeterminate. For example, if the message has been queued for more than an hour without discovery of message profile information which classifies the risk associated with the message, the message can be released and processed by a reprocessing module (e.g., reprocessing module 540 or message processing module 530 of FIG. 8 ).
[0093] At stage 730, the queued message is processed based upon updated reputation information. The queued message can be processed, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ) based upon updated reputation information received, for example, from a reputation module (e.g., reputation server 545 of FIG. 8 ). In some implementations, if the entity reputation is non-reputable, the message can be tested using dedicated message interrogation engines. The selection of which dedicated interrogation engines to be used on the message can be based upon the particular reputation associated with the message. For example, if the entity associated with the message has a reputation for phishing, the message can be sent to a dedicated phishing interrogation engine operable to specifically test the message for characteristics/features of phishing messages. In other implementations, messages associated with entities having non-reputable reputations can be tested by all available interrogation engines or any subset thereof.
[0094] In those implementations which include message profile information, the queued message can be processed based upon the message profile information. The queued message can be processed, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ) based upon updated message profile information received, for example, from a message profiler (e.g., message profiler 550 of FIG. 8 ). In some implementations, if the message profile is non-legitimate, the message can be tested using dedicated message interrogation engines. The selection of which dedicated interrogation engines to be used on the message can be based upon the particular message profile associated with the message. For example, if the message has a message profile associated with spyware, the message can be sent to a dedicated spyware interrogation engine operable to specifically test the message for characteristics/features of spyware messages. In other implementations, messages associated with negative message profiles can be tested by all available interrogation engines or any subset thereof.
[0095] FIG. 11 is a flowchart illustrating an example method for reputation based message processing. At stage 800 a message is received. The message can be received, for example, by a communications interface (e.g., communications interface 525 of FIG. 8 ) from a network (e.g., network 505 of FIG. 8 ). The message can include a variety of components. The various components can identify entities associated with the message. In some implementations, the entities can include, for example, message originator(s), message recipient(s), transit path associated with the message, and other components of the message, including for example, the body of the message.
[0096] At stage 810, the reputation of an entity associated with the message is identified. The reputation can be identified, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ) querying a reputation module (e.g., reputation server 545 of FIG. 8 ). The reputation can indicate an entity's tendency for engaging in legitimate or non-legitimate activity. The reputation can be calculated as a raw score. In some implementations, the raw score can be communicated to the message processing module. In other implementations, an interpretation or abstraction of the raw score can be communicated to the message processing module. For example, reputation can be visualized as an axis, whereby a negative score can be said to be non-reputable and a positive score can be said to be reputable. However, because the axis is a spectrum, the further away from zero, the stronger a confidence can be given to the reputation classification. Thus, weakly classified reputable or non-reputable scores can be seen as relatively indeterminate in comparison to strongly classified reputable or non-reputable scores. For example, if an entity is scored at 0.1, there might only be a slightly better than even chance that the entity is reputable. However, there is some hesitation to classifying an entity having such a reputation score as reputable given the relatively large risk that the entity is non-reputable. Thus, reputation systems can classify such weakly correlated reputation scores as indeterminate. In those implementations where the raw score is communicated to the message processing module, the message processing module can undergo a similar analysis and translation of the reputation score, for example, based upon local preferences and settings.
[0097] At stage 820, a decision is made whether the reputation of the entity is indeterminate. The decision whether the reputation is indeterminate can be made, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ) or by a reputation module (e.g., reputation server 545 of FIG. 8 ). If the reputation of the entity is not indeterminate, the message is processed at stage 830. For example, if the entity reputation is reputable, the message can be forwarded to the user. If the entity reputation is non-reputable, the message can be tested by one or more dedicated message interrogation engines.
[0098] If the entity reputation is indeterminate, the message is labeled as suspicious at stage 840. The message can be labeled as suspicious, for example, by the message processing module (e.g., message processing module 530 of FIG. 8 ) in conjunction with a reputation module (e.g., reputation server 545 of FIG. 8 ). In some implementations, suspicious messages are flagged by the reputation module and/or the message processing module. In other implementations, suspicious messages can be flagged for their mere inclusion in a queue (e.g., a quarantine queue).
[0099] At stage 850, the delivery of the suspicious message is delayed. The delivery of the suspicious message can be delayed, for example, by a queuing module (e.g., queuing module 535 of FIG. 8 ). In other implementations, the delivery of the suspicious message can be delayed, for example, by storing the suspicious message to a quarantine.
[0100] Delaying the delivery of the message enables additional reputation and/or message profile information to be collected as shown by stage 860. Additional reputation and/or message profile information can be collected by a reputation information collection module (e.g., reputation information collection module 630 of FIG. 9 ) or by a message profiler (e.g., message profiler 550 of FIG. 8 ). Additional reputation and/or message profile information can facilitate deriving a determinate reputation and/or message profile associated with the entity associated with the message or with the message itself. In some implementations, the message can be delayed until a determinate reputation and/or message profile is derived. In other implementations, the message can be delayed for a maximum period of time before the message is processed (e.g., delivered, sent for testing, etc.).
[0101] The message is processed at stage 830. The message can be processed, for example, by a message processing module (e.g., message processing module 530 of FIG. 8 ). If the entity reputation is reputable and the message profile is legitimate, the message can be delivered (e.g., through the MTA 515 of FIG. 8 ). If the entity is non-reputable or the message profile is non-legitimate, the message can be sent to one or more dedicated interrogation engines. If the entity remains indeterminate and/or the message profile is indeterminate, in some implementations, the message can be sent to the dedicated interrogation engines for further testing. In other implementations, if the entity remains indeterminate and/or the message profile is indeterminate, the message can be delivered (e.g., through MTA 515 of FIG. 8 ).
[0102] The systems and methods disclosed herein may be implemented on various types of computer architectures, such as for example on different types of networked environments. As an illustration, FIG. 12 depicts a server access architecture within which the disclosed systems and methods may be used (e.g., as shown at 30 in FIG. 12 ). The architecture in this example includes a corporation's local network 490 and a variety of computer systems residing within the local network 490. These systems can include application servers 420 such as Web servers and e-mail servers, user workstations running local clients 430 such as e-mail readers and Web browsers, and data storage devices 410 such as databases and network connected disks. These systems communicate with each other via a local communication network such as Ethernet 450. Firewall system 440 resides between the local communication network and Internet 460. Connected to the Internet 460 are a host of external servers 470 and external clients 480.
[0103] Local clients 430 can access application servers 420 and shared data storage 410 via the local communication network. External clients 480 can access external application servers 470 via the Internet 460. In instances where a local server 420 or a local client 430 requires access to an external server 470 or where an external client 480 or an external server 470 requires access to a local server 420, electronic communications in the appropriate protocol for a given application server flow through “always open” ports of firewall system 440.
[0104] A system 30 as disclosed herein may be located in a hardware device or on one or more servers connected to the local communication network such as Ethernet 480 and logically interposed between the firewall system 440 and the local servers 420 and clients 430. Application-related electronic communications attempting to enter or leave the local communications network through the firewall system 440 are routed to the system 30.
[0105] In the example of FIG. 12 , system 30 could be configured to store and process reputation data about many millions of senders as part of a threat management system. This would allow the threat management system to make better informed decisions about allowing or blocking electronic mail (e-mail).
[0106] System 30 could be used to handle many different types of e-mail and its variety of protocols that are used for e-mail transmission, delivery and processing including SMTP and POP3. These protocols refer, respectively, to standards for communicating e-mail messages between servers and for server-client communication related to e-mail messages. These protocols are defined respectively in particular RFC's (Request for Comments) promulgated by the IETF (Internet Engineering Task Force). The SMTP protocol is defined in RFC 821, and the POP3 protocol is defined in RFC 1939.
[0107] Since the inception of these standards, various needs have evolved in the field of e-mail leading to the development of further standards including enhancements or additional protocols. For instance, various enhancements have evolved to the SMTP standards leading to the evolution of extended SMTP. Examples of extensions may be seen in (1) RFC 1869 that defines a framework for extending the SMTP service by defining a means whereby a server SMTP can inform a client SMTP as to the service extensions it supports and in (2) RFC 1891 that defines an extension to the SMTP service, which allows an SMTP client to specify (a) that delivery status notifications (DSNs) should be generated under certain conditions, (b) whether such notifications should return the contents of the message, and (c) additional information, to be returned with a DSN, that allows the sender to identify both the recipient(s) for which the DSN was issued, and the transaction in which the original message was sent. In addition, the IMAP protocol has evolved as an alternative to POP3 that supports more advanced interactions between e-mail servers and clients. This protocol is described in RFC 2060.
[0108] Other communication mechanisms are also widely used over networks. These communication mechanisms include, but are not limited to, Voice Over IP (VoIP) and Instant Messaging. VoIP is used in IP telephony to provide a set of facilities for managing the delivery of voice information using the Internet Protocol (IP). Instant Messaging is a type of communication involving a client which hooks up to an instant messaging service that delivers communications (e.g., conversations) in realtime.
[0109] As the Internet has become more widely used, it has also created new troubles for users. In particular, the amount of spam received by individual users has increased dramatically in the recent past. Spam, as used in this specification, refers to any communication receipt of which is either unsolicited or not desired by its recipient. A system and method can be configured as disclosed herein to address these types of unsolicited or undesired communications. This can be helpful in that e-mail spamming consumes corporate resources and impacts productivity.
[0110] The systems and methods disclosed herein are presented only by way of example and are not meant to limit the scope of the invention. Other variations of the systems and methods described above will be apparent to those skilled in the art and as such are considered to be within the scope of the invention. For example, using the systems and methods of sender classification described herein, a reputation system can be configured for use in training and tuning of external filtering techniques. Such techniques may include Bayesian, Support Vector Machine (SVM) and other statistical content filtering techniques, as well as signature-based techniques such as distributed bulk message identification and message clustering-type techniques. The training strategies for such techniques can require sets of classified legitimate and unwanted transmissions, which can be provided to the trainer by classifying streams of transmissions based on the reputation scores of their senders. Transmissions from senders classified as un-reputable can be provided to the filtering system trainer as unwanted, and the wanted transmissions can be taken from the stream sent by the legitimate senders.
[0111] As an illustration, methods and systems can be configured to perform tuning and training of filtering systems utilizing reputation scores of senders of transmissions in sets of trainable transmissions. At least one characteristic is identified about transmissions from senders. The identifying of at least one characteristic can include extracting unique identifying information about the transmissions (e.g., information about the senders of the transmissions), or authenticating unique identifying information about the transmissions, or combinations thereof. Queries are sent to a reputation system and scores are received representing reputations of the senders. Transmissions are classified into multiple categories based on a range a sender's reputation score falls into. Transmissions and their classification categories are passed on to a trainer of another filtering system to be used for optimization of the filtering system.
[0112] As another example, methods and systems can be configured to perform filtering of groups of transmissions utilizing reputation scores of senders of transmissions. Multiple transmissions can be grouped together based on content similarities or similarities in transmission sender behavior. At least one characteristic can be identified about each transmission in the groupings. The identifying of at least one characteristic can include extracting unique identifying information about the transmission (e.g., information about the sender of a transmission), or authenticating unique identifying information about the transmission, or combinations thereof. A query can be sent to the reputation system and receive a score representing reputation of each sender. Groups of transmissions can be classified based on the percentage of reputable and non-reputable senders in the group.
[0113] As another example of the wide variations of the disclosed systems and methods, different techniques can be used for computation of joint conditional probabilities. More specifically, different mathematical techniques can be used for computing the aggregate non-reputable sender probability, PNR, and the aggregate reputable sender probability, PR, for each sender in the reputation space. As an illustration, two techniques are described. Both techniques use P (NR|Ci) and P (R|Ci), the conditional probabilities of non-reputable and reputable behavior, for each testing criterion Ci. The first technique makes the assumption that all testing criteria are independent. The second technique incorporates the assumption that the testing criteria are not independent. Therefore, the second technique is more difficult to carry out, but produces more accurate results.
[0114] 1. Technique for Independent Testing Criteria
[0115] In the independent case, it is assumed that each criterion Ci is independent of all other criteria. The probability that the sender is non-reputable, PNR, is calculated using the following formula:
[0116]
where j ranges over all criteria that apply to the sender in question. Similarly, the probability that the sender is a reputable sender, PR, is calculated using the following formula:
where j ranges over all criteria that apply to the sender in question. Similarly, the probability that the sender is a reputable sender, PR, is calculated using the following formula:
[0117]
where j ranges over all criteria that apply to the sender in question.
where j ranges over all criteria that apply to the sender in question.
[0118] 2. Technique for Non-Independent Testing Criteria In the dependent case, it is assumed that each criterion Ci is not independent of all other criteria, so the analysis must take into account “non-linear” interactions between criteria within their joint probability distribution. To find the correct values for PNR and PR for a given sender, a table is constructed to represent the entire joint probability distribution. Below is a sample table for a joint distribution of four qualities/criteria.
[0119]
For a joint distribution of M criteria, there exist (2M−1) distinct cases within the joint probability distribution. Each case constitutes a particular combination of characteristics. The probability that the sender is non-reputable, PNR, is estimated for each case using the following technique. For each one of the (2M−1) cases, a random sample of N senders is gathered that exhibit the combination of characteristics described by that case. (For this purposes, N=30 is a large enough sample). Each sender is sorted into one of the following sets: reputable (R), non-reputable (NR) or unknown (U). NR is the number of sender in the sample that are reputable senders, NNR is the number of senders that are non-reputable senders, etc. Then, PNR and PR is estimated using the formulas:
| Case | C1 | C2 | C3 | C4 | PNR | PR |
|---|---|---|---|---|---|---|
| 1 | N | N | N | N | N/A | N/A |
| 2 | N | N | N | Y | P(NR|C4) | P(R|C4) |
| 3 | N | N | Y | N | P(NR|C3) | P(R|C3) |
| 4 | N | N | Y | Y | P(NR|C3, C4) | P(R|C3, C4) |
| 5 | N | Y | N | N | P(NR|C2) | P(R|C2) |
| 6 | N | Y | N | Y | P(NR|C2, C4) | P(R|C2, C4) |
| 7 | N | Y | Y | N | P(NR|C2, C3) | P(R|C2, C3) |
| 8 | N | Y | Y | Y | P(NR|C2, C3, C4) | P(R|C2, C3, C4) |
| 9 | Y | N | N | N | P(NR|C1) | P(R|C1) |
| 10 | Y | N | N | Y | P(NR|C1, C4) | P(R|C1, C4) |
| 11 | Y | N | Y | N | P(NR|C1, C3) | P(R|C1, C3) |
| 12 | Y | N | Y | Y | P(NR|C1, C3, C4) | P(R|C1, C3, C4) |
| 13 | Y | Y | N | N | P(NRC1, C2) | P(R|C1, C2) |
| 14 | Y | Y | N | Y | P(NR|C1, C2, C4) | P(R|C1, C2, C4) |
| 15 | Y | Y | Y | N | P(NR|C1, C2, C3) | P(R|C1, C2, C3) |
| 16 | Y | Y | Y | Y | P(NR|C1, C2, C3, | P(R|C1, C2, C3, C4) |
| C4) | ||||||
For a joint distribution of M criteria, there exist (2M−1) distinct cases within the joint probability distribution. Each case constitutes a particular combination of characteristics. The probability that the sender is non-reputable, PNR, is estimated for each case using the following technique. For each one of the (2M−1) cases, a random sample of N senders is gathered that exhibit the combination of characteristics described by that case. (For this purposes, N=30 is a large enough sample). Each sender is sorted into one of the following sets: reputable (R), non-reputable (NR) or unknown (U). NR is the number of sender in the sample that are reputable senders, NNR is the number of senders that are non-reputable senders, etc. Then, PNR and PR is estimated using the formulas:
[0120]
The sampling of the IP addresses is repeated periodically (e.g., daily, weekly, monthly) to update the joint probability distribution.
The sampling of the IP addresses is repeated periodically (e.g., daily, weekly, monthly) to update the joint probability distribution.
[0121] It is further noted that the systems and methods disclosed herein may use articles of manufacture having data/digital signals conveyed via networks (e.g., local area network, wide area network, internet, etc.), fiber optic medium, carrier waves, wireless networks, etc. for communication with one or more data processing devices. The data/digital signals can carry any or all of the data disclosed herein that is provided to or from a device.
[0122] Additionally, the methods and systems described herein may be implemented on many different types of processing devices by program code comprising program instructions that are executable by one or more processors. The software program instructions may include source code, object code, machine code, or any other stored data that is operable to cause a processing system to perform methods described herein.
[0123] The systems' and methods' data (e.g., associations, mappings, etc.) may be stored and implemented in one or more different types of computer-implemented ways, such as different types of storage devices and programming constructs (e.g., data stores, RAM, ROM, Flash memory, flat files, databases, programming data structures, programming variables, IF-THEN (or similar type) statement constructs, etc.). It is noted that data structures describe formats for use in organizing and storing data in databases, programs, memory, or other computer-readable media for use by a computer program.
[0124] The systems and methods may be provided on many different types of computer-readable media including computer storage mechanisms (e.g., CD-ROM, diskette, RAM, flash memory, computer's hard drive, etc.) that contain instructions for use in execution by a processor to perform the methods' operations and implement the systems described herein.
[0125] The computer components, software modules, functions and data structures described herein may be connected directly or indirectly to each other in order to allow the flow of data needed for their operations. It is also noted that software instructions or a module can be implemented for example as a subroutine unit of code, or as a software function unit of code, or as an object (as in an object-oriented paradigm), or as an applet, or in a computer script language, or as another type of computer code or firmware. The software components and/or functionality may be located on a single device or distributed across multiple devices depending upon the situation at hand.
[0126] It should be understood that as used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise. Finally, as used in the description herein and throughout the claims that follow, the meanings of “and” and “or” include both the conjunctive and disjunctive and may be used interchangeably unless the context clearly dictates otherwise; the phrase “exclusive or” may be used to indicate situation where only the disjunctive meaning may apply.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer-implemented method, comprising:
receiving a message through a communications interface, the message comprising information and being a message from and associated with an entity;
receiving a reputation score that is indicative of a reputation for the entity associated with the message;
determining that the reputation score is indeterminate of the reputation of the entity, the reputation score being a value that does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable, and in response to the determination:
queuing the message based upon the reputation score being indeterminate, thereby delaying delivery of the message;
collecting additional information associated with the entity that can be used to determine a reputation of the entity as being one of reputable or non-reputable;
receiving an updated reputation score that is indicative of the reputation for the entity associated with the message, the updated reputation score classifying the entity as being one of reputable or non-reputable and determined, in part, from the additional information collected, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
in response to receiving the updated reputation score, processing the queued message based upon updated reputation score, the processing comprising:
delivering the message in response to the updated reputation score indicating the entity is reputable; and
sending, in response to the updated reputation score indicating the entity is non-reputable, the message to a dedicated interrogation engine to analyze the message for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
2. The computer-implemented method of claim 1, wherein: collecting additional information comprises collecting additional information for only a predefined time period.
3. The computer-implemented method of claim 1, wherein collecting additional information associated with the entity comprises analyzing other communications associated with the entity to identifying relationships between the entity and known reputable entities or known non-reputable entities.
4. The computer-implemented method of claim 3, wherein identifying relationships between the entity and known reputable or non-reputable entities comprises identifying common features between the entity and the known reputable or non-reputable entities.
5. A computer-implemented method, comprising:
receiving an electronic communication that is associated with and received from an entity;
receiving a reputation associated with the entity associated with the electronic communication;
in response to the received reputation of the entity associated with the electronic communication being indeterminate that does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable:
labeling the electronic communication as a suspicious electronic communication;
delaying delivery of the suspicious electronic communication;
collecting additional information associated with the entity that can be used to determine a reputation of the entity as being one of reputable or non-reputable;
receiving an updated reputation that is indicative of the reputation for the entity associated with the suspicious electronic communication, the updated reputation classifying the entity as being one of reputable or non-reputable and determined, in part, from the additional information collected, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
in response to receiving an updated reputation, processing the suspicious electronic communication based on the updated reputation, the processing comprising:
delivering the suspicious electronic communication in response to the updated reputation indicating the entity is reputable; and
sending, in response to the updated reputation indicating the entity is non-reputable, the suspicious electronic communication to a dedicated interrogation engine to analyze the suspicious electronic communication for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
6. The computer-implemented method of claim 5, wherein collecting additional information associated with the entity comprising identifying relationships between the entity and known reputable entities or known non-reputable entities.
7. The computer-implemented method of claim 6, wherein identifying relationships between the entity and known reputable or non-reputable entities comprises identifying common features shared by the entity and the known reputable or known non-reputable entities, including communications between the entities, identifying similar communications patterns, identifying similar communications sent independently from the entity and at least one of the known reputable or known non-reputable entities, and similar domains.
8. A message interrogation system comprising:
a computer system having one or more computer devices and a communications interface operable to receive a query associated with a message;
instructions stored in a computer storage device, the instructions executable by a computer system and defining:
a reputation module operable to retrieve reputation information related to an entity associated with the message, the reputation module being further operable to identify the entity as having an indeterminate reputation that does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable;
a flagging module operable to instruct a message processing module to queue the message, wherein the queue is operable to hold the message without delivery;
a reputation information collection module being operable to collect reputation information related to the entity associated with the message that can be used to determine a reputation of the entity as being one of reputable or non-reputable, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
the reputation module being further operable to derive an updated reputation based upon the collected reputation information and to communicate the updated reputation to a message transfer agent through the communications interface;
wherein the message processing module is operable to process the message based upon the updated reputation, the processing comprising:
forwarding the message to a recipient in response to the updated reputation indicating the entity is reputable; and
sending, in response to the updated reputation indicating the entity is non-reputable, the message to a dedicated interrogation engine to analyze the message for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
9. The system of claim 8, wherein the reputation module is operable to analyze communication patterns associated with the entity.
10. The system of claim 9, wherein the reputation module is operable to compare the communication patterns associated with the entity to known behavioral profiles of reputable and non-reputable entities, and to identify the reputation based upon identifying a closest match between the communication patterns associated with the entity and the behavioral profiles of reputable and non-reputable entities.
11. The system of claim 8, wherein the reputation module is operable to identify relationships between the entity and known reputable entities or known non-reputable entities.
12. The system of claim 11, wherein relationships between the entity and known reputable or non-reputable entities are identified based upon identification of communications between the entities, identification of similar communications patterns, identification of similar communications sent independently from the entity and at least one of the known reputable or known non-reputable entities, and identification of similar domains.
13. A system comprising:
a computer system having one or more computer devices and a communications interface operable to receive an electronic message, the electronic message being associated with and sent from an entity;
instructions stored in a computer storage device, the instructions executable by a computer system and defining:
a message processing module operable to process the electronic message to identify the entity and to send a reputation query to a reputation module to identify a reputation of the entity associated with the electronic message;
a queuing module operable to place electronic messages into a queue based upon the reputation of the entity associated with the electronic message being an indeterminate reputation that does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable;
a reputation information collection module being operable to collect reputation information related to the entity associated with the electronic message that can be used to determine a reputation of the entity as being one of reputable or non-reputable, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
a reprocessing module operable to periodically query the reputation module for an updated reputation for the entity associated with the electronic message, the reprocessing module being further operable to process the electronic message based upon the updated reputation of the entity associated with the electronic message indicating the entity being one of reputable or non-reputable, the processing comprising:
forwarding the electronic message to a recipient in response to the updated reputation indicating the entity is reputable; and
sending, in response to the updated reputation indicating the entity is non-reputable, the electronic message to a dedicated interrogation engine to analyze the electronic message for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
14. At least one non-transitory, machine accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to:
receive a message through a communications interface, the message comprising information and being a message from and associated with an entity;
receive a reputation score that is indicative of a reputation for the entity associated with the message;
determine that the reputation score is indeterminate of the reputation of the entity, the reputation score being a value that does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable, and in response to the determination:
queue the message based upon the reputation score being indeterminate, thereby delaying delivery of the message;
collect additional information associated with the entity that can be used to determine a reputation of the entity as being one of reputable or non-reputable;
receive an updated reputation score that is indicative of the reputation for the entity associated with the message, the updated reputation score classifying the entity as being one of reputable or non-reputable and determined, in part, from the additional information collected, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
in response to receipt of the updated reputation score, process the queued message based upon updated reputation score to:
deliver the message in response to the updated reputation score indicating the entity is reputable; and
send, in response to the updated reputation score indicating the entity is non-reputable, the message to a dedicated interrogation engine to analyze the message for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
15. At least one non-transitory, machine accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to:
receive an electronic communication that is associated with and received from an entity;
receive a reputation associated with the entity associated with the electronic communication;
in response to the received reputation of the entity associated with the electronic communication being indeterminate in that the received reputation does not provide an accurate indication of the reputation of the entity as being one of reputable or non-reputable:
label the electronic communication as a suspicious electronic communication;
delay delivery of the suspicious electronic communication;
collect additional information associated with the entity that can be used to determine a reputation of the entity as being one of reputable or non-reputable;
receive an updated reputation that is indicative of the reputation for the entity associated with the suspicious electronic communication, the updated reputation classifying the entity as being one of reputable or non-reputable and determined, in part, from the additional information collected, wherein a non-reputable reputation indicates a tendency by an entity to participate in a particular non-legitimate activity; and
in response to receipt of the updated reputation, processing the suspicious electronic communication based on the updated reputation to:
deliver the suspicious electronic communication message in response to the updated reputation indicating the entity is reputable; and
send, in response to the updated reputation indicating the entity is non-reputable, the suspicious electronic communication message to a dedicated interrogation engine to analyze the suspicious electronic communication for threats related to the particular non-legitimate activity in which the entity has exhibited a tendency to participate, and wherein a different dedicated interrogation engine is used for each different non-legitimate activity.
Patent Citations (788)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4289930(A) | 1981-09-01 | Connolly et al. | Applicant |
| US4384325(A) | 1983-05-01 | Slechta et al. | Applicant |
| US4386416(A) | 1983-05-01 | Giltner et al. | Applicant |
| US4532588(A) | 1985-07-01 | Foster | Applicant |
| US4713780(A) | 1987-12-01 | Schultz et al. | Applicant |
| US4754428(A) | 1988-06-01 | Schultz et al. | Applicant |
| US4837798(A) | 1989-06-01 | Cohen et al. | Applicant |
| US4853961(A) | 1989-08-01 | Pastor | Applicant |
| US4864573(A) | 1989-09-01 | Horsten | Applicant |
| US4951196(A) | 1990-08-01 | Jackson | Applicant |
| US4975950(A) | 1990-12-01 | Lentz | Applicant |
| US4979210(A) | 1990-12-01 | Nagata et al. | Applicant |
| US5008814(A) | 1991-04-01 | Mathur | Applicant |
| US5020059(A) | 1991-05-01 | Gorin et al. | Applicant |
| US5051886(A) | 1991-09-01 | Kawaguchi et al. | Applicant |
| US5054096(A) | 1991-10-01 | Beizer | Applicant |
| US5105184(A) | 1992-04-01 | Pirani et al. | Applicant |
| US5119465(A) | 1992-06-01 | Jack et al. | Applicant |
| US5136690(A) | 1992-08-01 | Becker et al. | Applicant |
| US5144557(A) | 1992-09-01 | Wang | Applicant |
| US5144659(A) | 1992-09-01 | Jones | Applicant |
| US5144660(A) | 1992-09-01 | Rose | Applicant |
| US5167011(A) | 1992-11-01 | Priest | Applicant |
| US5210824(A) | 1993-05-01 | Putz et al. | Applicant |
| US5210825(A) | 1993-05-01 | Kavaler | Applicant |
| US5235642(A) | 1993-08-01 | Wobber et al. | Applicant |
| US5239466(A) | 1993-08-01 | Morgan et al. | Applicant |
| US5247661(A) | 1993-09-01 | Hager et al. | Applicant |
| US5276869(A) | 1994-01-01 | Forrest et al. | Applicant |
| US5278901(A) | 1994-01-01 | Shieh et al. | Applicant |
| US5283887(A) | 1994-02-01 | Zachery | Applicant |
| US5293250(A) | 1994-03-01 | Okumura et al. | Applicant |
| US5313521(A) | 1994-05-01 | Torii et al. | Applicant |
| US5319776(A) | 1994-06-01 | Hile et al. | Applicant |
| US5355472(A) | 1994-10-01 | Lewis | Applicant |
| US5367621(A) | 1994-11-01 | Cohen et al. | Applicant |
| US5377354(A) | 1994-12-01 | Scannell et al. | Applicant |
| US5379340(A) | 1995-01-01 | Overend et al. | Applicant |
| US5379374(A) | 1995-01-01 | Ishizaki et al. | Applicant |
| US5384848(A) | 1995-01-01 | Kikuchi | Applicant |
| US5404231(A) | 1995-04-01 | Bloomfield | Applicant |
| US5406557(A) | 1995-04-01 | Baudoin | Applicant |
| US5414833(A) | 1995-05-01 | Hershey et al. | Applicant |
| US5416842(A) | 1995-05-01 | Aziz | Applicant |
| US5418908(A) | 1995-05-01 | Keller et al. | Applicant |
| US5424724(A) | 1995-06-01 | Williams et al. | Applicant |
| US5479411(A) | 1995-12-01 | Klein | Applicant |
| US5481312(A) | 1996-01-01 | Cash et al. | Applicant |
| US5483466(A) | 1996-01-01 | Kawahara et al. | Applicant |
| US5485409(A) | 1996-01-01 | Gupta et al. | Applicant |
| US5495610(A) | 1996-02-01 | Shing et al. | Applicant |
| US5509074(A) | 1996-04-01 | Choudhury et al. | Applicant |
| US5511122(A) | 1996-04-01 | Atkinson | Applicant |
| US5513126(A) | 1996-04-01 | Harkins et al. | Applicant |
| US5513323(A) | 1996-04-01 | Williams et al. | Applicant |
| US5530852(A) | 1996-06-01 | Meske, Jr. et al. | Applicant |
| US5535276(A) | 1996-07-01 | Ganesan | Applicant |
| US5541993(A) | 1996-07-01 | Fan et al. | Applicant |
| US5544320(A) | 1996-08-01 | Konrad | Applicant |
| US5550984(A) | 1996-08-01 | Gelb | Applicant |
| US5550994(A) | 1996-08-01 | Tashiro et al. | Applicant |
| US5557742(A) | 1996-09-01 | Smaha et al. | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5577209(A) | 1996-11-01 | Boyle et al. | Applicant |
| US5586254(A) | 1996-12-01 | Kondo et al. | Applicant |
| US5602918(A) | 1997-02-01 | Chen et al. | Applicant |
| US5606668(A) | 1997-02-01 | Shwed | Applicant |
| US5608819(A) | 1997-03-01 | Ikeuchi | Applicant |
| US5608874(A) | 1997-03-01 | Ogawa et al. | Applicant |
| US5619648(A) | 1997-04-01 | Canale et al. | Applicant |
| US5621889(A) | 1997-04-01 | Lermuzeaux et al. | Applicant |
| US5632011(A) | 1997-05-01 | Landfield et al. | Applicant |
| US5638487(A) | 1997-06-01 | Chigier | Applicant |
| US5644404(A) | 1997-07-01 | Hashimoto et al. | Applicant |
| US5657461(A) | 1997-08-01 | Harkins et al. | Applicant |
| US5673322(A) | 1997-09-01 | Pepe et al. | Applicant |
| US5675507(A) | 1997-10-01 | Bobo, II | Applicant |
| US5675733(A) | 1997-10-01 | Williams | Applicant |
| US5677955(A) | 1997-10-01 | Doggett et al. | Applicant |
| US5694616(A) | 1997-12-01 | Johnson et al. | Applicant |
| US5696822(A) | 1997-12-01 | Nachenberg | Applicant |
| US5706442(A) | 1998-01-01 | Anderson et al. | Applicant |
| US5708780(A) | 1998-01-01 | Levergood et al. | Applicant |
| US5708826(A) | 1998-01-01 | Ikeda et al. | Applicant |
| US5710883(A) | 1998-01-01 | Hong et al. | Applicant |
| US5727156(A) | 1998-03-01 | Herr-Hoyman et al. | Applicant |
| US5740231(A) | 1998-04-01 | Cohn et al. | Applicant |
| US5742759(A) | 1998-04-01 | Nessett et al. | Applicant |
| US5742769(A) | 1998-04-01 | Lee et al. | Applicant |
| US5745574(A) | 1998-04-01 | Muftic | Applicant |
| US5751956(A) | 1998-05-01 | Kirsch | Applicant |
| US5758343(A) | 1998-05-01 | Vigil et al. | Applicant |
| US5764906(A) | 1998-06-01 | Edelstein et al. | Applicant |
| US5768528(A) | 1998-06-01 | Stumm | Applicant |
| US5768552(A) | 1998-06-01 | Jacoby | Applicant |
| US5771348(A) | 1998-06-01 | Kubatzki et al. | Applicant |
| US5778372(A) | 1998-07-01 | Cordell et al. | Applicant |
| US5781857(A) | 1998-07-01 | Hwang et al. | Applicant |
| US5781901(A) | 1998-07-01 | Kuzma | Applicant |
| US5790789(A) | 1998-08-01 | Suarez | Applicant |
| US5790790(A) | 1998-08-01 | Smith et al. | Applicant |
| US5790793(A) | 1998-08-01 | Higley | Applicant |
| US5793763(A) | 1998-08-01 | Mayes et al. | Applicant |
| US5793972(A) | 1998-08-01 | Shane | Applicant |
| US5796942(A) | 1998-08-01 | Esbensen | Applicant |
| US5796948(A) | 1998-08-01 | Cohen | Applicant |
| US5801700(A) | 1998-09-01 | Ferguson | Applicant |
| US5805719(A) | 1998-09-01 | Pare, Jr. et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5812776(A) | 1998-09-01 | Gifford | Applicant |
| US5822526(A) | 1998-10-01 | Waskiewicz | Applicant |
| US5822527(A) | 1998-10-01 | Post | Applicant |
| US5826013(A) | 1998-10-01 | Nachenberg | Applicant |
| US5826014(A) | 1998-10-01 | Coley et al. | Applicant |
| US5826022(A) | 1998-10-01 | Nielsen | Applicant |
| US5826029(A) | 1998-10-01 | Gore, Jr. et al. | Applicant |
| US5835087(A) | 1998-11-01 | Herz et al. | Applicant |
| US5845084(A) | 1998-12-01 | Cordell et al. | Applicant |
| US5850442(A) | 1998-12-01 | Muftic | Applicant |
| US5855020(A) | 1998-12-01 | Kirsch | Applicant |
| US5860068(A) | 1999-01-01 | Cook | Applicant |
| US5862325(A) | 1999-01-01 | Reed et al. | Applicant |
| US5864852(A) | 1999-01-01 | Luotonen | Applicant |
| US5878230(A) | 1999-03-01 | Weber et al. | Applicant |
| US5884033(A) | 1999-03-01 | Duvall et al. | Applicant |
| US5892825(A) | 1999-04-01 | Mages et al. | Applicant |
| US5893114(A) | 1999-04-01 | Hashimoto et al. | Applicant |
| US5896499(A) | 1999-04-01 | McKelvey | Applicant |
| US5898830(A) | 1999-04-01 | Wesinger et al. | Applicant |
| US5898836(A) | 1999-04-01 | Freivald et al. | Applicant |
| US5903723(A) | 1999-05-01 | Becker et al. | Applicant |
| US5911776(A) | 1999-06-01 | Guck | Applicant |
| US5923846(A) | 1999-07-01 | Gage et al. | Applicant |
| US5930479(A) | 1999-07-01 | Hall | Applicant |
| US5933478(A) | 1999-08-01 | Ozaki et al. | Applicant |
| US5933498(A) | 1999-08-01 | Schneck et al. | Applicant |
| US5937164(A) | 1999-08-01 | Mages et al. | Applicant |
| US5940591(A) | 1999-08-01 | Boyle et al. | Applicant |
| US5948062(A) | 1999-09-01 | Tzelnic et al. | Applicant |
| US5958005(A) | 1999-09-01 | Thorne et al. | Applicant |
| US5963915(A) | 1999-10-01 | Kirsch | Applicant |
| US5978799(A) | 1999-11-01 | Hirsch | Applicant |
| US5987609(A) | 1999-11-01 | Hasebe | Applicant |
| US5987610(A) | 1999-11-01 | Franczek et al. | Applicant |
| US5991881(A) | 1999-11-01 | Conklin et al. | Applicant |
| US5999932(A) | 1999-12-01 | Paul | Applicant |
| US6003027(A) | 1999-12-01 | Prager | Applicant |
| US6006329(A) | 1999-12-01 | Chi | Applicant |
| US6012144(A) | 2000-01-01 | Pickett | Applicant |
| US6014651(A) | 2000-01-01 | Crawford | Applicant |
| US6023723(A) | 2000-02-01 | McCormick et al. | Applicant |
| US6029256(A) | 2000-02-01 | Kouznetsov | Applicant |
| US6035423(A) | 2000-03-01 | Hodges et al. | Applicant |
| US6052709(A) | 2000-04-01 | Paul | Applicant |
| US6052784(A) | 2000-04-01 | Day | Applicant |
| US6058381(A) | 2000-05-01 | Nelson | Applicant |
| US6058482(A) | 2000-05-01 | Liu | Applicant |
| US6061448(A) | 2000-05-01 | Smith et al. | Applicant |
| US6061722(A) | 2000-05-01 | Lipa et al. | Applicant |
| US6072942(A) | 2000-06-01 | Stockwell et al. | Applicant |
| US6073142(A) | 2000-06-01 | Geiger et al. | Applicant |
| US6088804(A) | 2000-07-01 | Hill et al. | Applicant |
| US6092114(A) | 2000-07-01 | Shaffer et al. | Applicant |
| US6092194(A) | 2000-07-01 | Touboul | Applicant |
| US6094277(A) | 2000-07-01 | Toyoda | Applicant |
| US6094731(A) | 2000-07-01 | Waldin et al. | Applicant |
| US6104500(A) | 2000-08-01 | Alam et al. | Applicant |
| US6108688(A) | 2000-08-01 | Nielsen | Applicant |
| US6108691(A) | 2000-08-01 | Lee et al. | Applicant |
| US6108786(A) | 2000-08-01 | Knowlson | Applicant |
| US6118856(A) | 2000-09-01 | Paarsmarkt et al. | Applicant |
| US6118886(A) | 2000-09-01 | Baumgart et al. | Applicant |
| US6119137(A) | 2000-09-01 | Smith et al. | Applicant |
| US6119142(A) | 2000-09-01 | Kosaka | Applicant |
| US6119230(A) | 2000-09-01 | Carter | Applicant |
| US6119236(A) | 2000-09-01 | Shipley | Applicant |
| US6122661(A) | 2000-09-01 | Stedman et al. | Applicant |
| US6141695(A) | 2000-10-01 | Sekiguchi et al. | Applicant |
| US6141778(A) | 2000-10-01 | Kane et al. | Applicant |
| US6145083(A) | 2000-11-01 | Shaffer et al. | Applicant |
| US6151675(A) | 2000-11-01 | Smith | Applicant |
| US6161130(A) | 2000-12-01 | Horvitz et al. | Applicant |
| US6165314(A) | 2000-12-01 | Gardner et al. | Applicant |
| US6185314(B1) | 2001-02-01 | Crabtree et al. | Applicant |
| US6185680(B1) | 2001-02-01 | Shimbo et al. | Applicant |
| US6185689(B1) | 2001-02-01 | Todd, Sr. et al. | Applicant |
| US6192360(B1) | 2001-02-01 | Dumais et al. | Applicant |
| US6192407(B1) | 2001-02-01 | Smith et al. | Applicant |
| US6199102(B1) | 2001-03-01 | Cobb | Applicant |
| US6202157(B1) | 2001-03-01 | Brownlie et al. | Applicant |
| US6219714(B1) | 2001-04-01 | Inhwan et al. | Applicant |
| US6223213(B1) | 2001-04-01 | Cleron et al. | Applicant |
| US6247045(B1) | 2001-06-01 | Shaw et al. | Applicant |
| US6249575(B1) | 2001-06-01 | Heilmann et al. | Applicant |
| US6249807(B1) | 2001-06-01 | Shaw et al. | Applicant |
| US6260043(B1) | 2001-07-01 | Puri et al. | Applicant |
| US6266668(B1) | 2001-07-01 | Vanderveldt et al. | Applicant |
| US6269447(B1) | 2001-07-01 | Maloney et al. | Applicant |
| US6269456(B1) | 2001-07-01 | Hodges et al. | Applicant |
| US6272532(B1) | 2001-08-01 | Feinleib | Applicant |
| US6275942(B1) | 2001-08-01 | Bernhard et al. | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6279133(B1) | 2001-08-01 | Vafai et al. | Applicant |
| US6282565(B1) | 2001-08-01 | Shaw et al. | Applicant |
| US6285991(B1) | 2001-09-01 | Powar | Applicant |
| US6289214(B1) | 2001-09-01 | Backstrom | Applicant |
| US6298445(B1) | 2001-10-01 | Shostack et al. | Applicant |
| US6301668(B1) | 2001-10-01 | Gleichauf et al. | Applicant |
| US6304898(B1) | 2001-10-01 | Shiigi | Applicant |
| US6304973(B1) | 2001-10-01 | Williams | Applicant |
| US6311207(B1) | 2001-10-01 | Mighdoll et al. | Applicant |
| US6317829(B1) | 2001-11-01 | Van Oorschot | Applicant |
| US6320948(B1) | 2001-11-01 | Heilmann et al. | Applicant |
| US6321267(B1) | 2001-11-01 | Donaldson | Applicant |
| US6324569(B1) | 2001-11-01 | Ogilvie et al. | Applicant |
| US6324647(B1) | 2001-11-01 | Bowman-Amuah | Applicant |
| US6324656(B1) | 2001-11-01 | Gleichauf et al. | Applicant |
| US6330589(B1) | 2001-12-01 | Kennedy | Applicant |
| US6347374(B1) | 2002-02-01 | Drake et al. | Applicant |
| US6353886(B1) | 2002-03-01 | Howard et al. | Applicant |
| US6363489(B1) | 2002-03-01 | Comay et al. | Applicant |
| US6370648(B1) | 2002-04-01 | Diep | Applicant |
| US6373950(B1) | 2002-04-01 | Rowney | Applicant |
| US6385655(B1) | 2002-05-01 | Smith et al. | Applicant |
| US6393465(B2) | 2002-05-01 | Leeds | Applicant |
| US6393568(B1) | 2002-05-01 | Ranger et al. | Applicant |
| US6405318(B1) | 2002-06-01 | Rowland | Applicant |
| US6434624(B1) | 2002-08-01 | Gai et al. | Applicant |
| US6442588(B1) | 2002-08-01 | Clark et al. | Applicant |
| US6442686(B1) | 2002-08-01 | McArdle et al. | Applicant |
| US6453345(B2) | 2002-09-01 | Trcka et al. | Applicant |
| US6460050(B1) | 2002-10-01 | Pace et al. | Applicant |
| US6460141(B1) | 2002-10-01 | Olden | Applicant |
| US6470086(B1) | 2002-10-01 | Smith | Applicant |
| US6487599(B1) | 2002-11-01 | Smith et al. | Applicant |
| US6487666(B1) | 2002-11-01 | Shanklin et al. | Applicant |
| US6502191(B1) | 2002-12-01 | Smith et al. | Applicant |
| US6516411(B2) | 2003-02-01 | Smith | Applicant |
| US6519703(B1) | 2003-02-01 | Joyce | Applicant |
| US6539430(B1) | 2003-03-01 | Humes | Applicant |
| US6546416(B1) | 2003-04-01 | Kirsch | Applicant |
| US6546493(B1) | 2003-04-01 | Magdych et al. | Applicant |
| US6550012(B1) | 2003-04-01 | Villa et al. | Applicant |
| US6574737(B1) | 2003-06-01 | Kingsford et al. | Applicant |
| US6578025(B1) | 2003-06-01 | Pollack et al. | Applicant |
| US6609196(B1) | 2003-08-01 | Dickinson, III et al. | Applicant |
| US6636946(B2) | 2003-10-01 | Jeddelch | Applicant |
| US6650890(B1) | 2003-11-01 | Irlam et al. | Applicant |
| US6654787(B1) | 2003-11-01 | Aronson et al. | Applicant |
| US6661353(B1) | 2003-12-01 | Gopen | Applicant |
| US6662170(B1) | 2003-12-01 | Dom et al. | Applicant |
| US6675153(B1) | 2004-01-01 | Cook et al. | Applicant |
| US6681331(B1) | 2004-01-01 | Munson et al. | Applicant |
| US6687687(B1) | 2004-02-01 | Smadja | Applicant |
| US6697950(B1) | 2004-02-01 | Ko | Applicant |
| US6701440(B1) | 2004-03-01 | Kim et al. | Applicant |
| US6704874(B1) | 2004-03-01 | Porras et al. | Applicant |
| US6711127(B1) | 2004-03-01 | Gorman et al. | Applicant |
| US6711687(B1) | 2004-03-01 | Sekiguchi | Applicant |
| US6725377(B1) | 2004-04-01 | Kouznetsov | Applicant |
| US6732101(B1) | 2004-05-01 | Cook | Applicant |
| US6732157(B1) | 2004-05-01 | Gordon et al. | Applicant |
| US6735703(B1) | 2004-05-01 | Kilpatrick et al. | Applicant |
| US6738462(B1) | 2004-05-01 | Brunson | Applicant |
| US6742116(B1) | 2004-05-01 | Matsui et al. | Applicant |
| US6742124(B1) | 2004-05-01 | Kilpatrick et al. | Applicant |
| US6742128(B1) | 2004-05-01 | Joiner | Applicant |
| US6754705(B2) | 2004-06-01 | Joiner et al. | Applicant |
| US6757830(B1) | 2004-06-01 | Tarbotton et al. | Applicant |
| US6760309(B1) | 2004-07-01 | Rochberger et al. | Applicant |
| US6768991(B2) | 2004-07-01 | Hearnden | Applicant |
| US6769016(B2) | 2004-07-01 | Rothwell et al. | Applicant |
| US6772196(B1) | 2004-08-01 | Kirsch et al. | Applicant |
| US6775657(B1) | 2004-08-01 | Baker | Applicant |
| US6792546(B1) | 2004-09-01 | Shanklin et al. | Applicant |
| US6880156(B1) | 2005-04-01 | Landherr et al. | Applicant |
| US6892178(B1) | 2005-05-01 | Zacharia | Applicant |
| US6892179(B1) | 2005-05-01 | Zacharia | Applicant |
| US6892237(B1) | 2005-05-01 | Gai et al. | Applicant |
| US6895385(B1) | 2005-05-01 | Zacharia et al. | Applicant |
| US6895438(B1) | 2005-05-01 | Ulrich | Applicant |
| US6907430(B2) | 2005-06-01 | Chong et al. | Applicant |
| US6910135(B1) | 2005-06-01 | Grainger | Applicant |
| US6928556(B2) | 2005-08-01 | Black et al. | Applicant |
| US6941348(B2) | 2005-09-01 | Petry et al. | Applicant |
| US6941467(B2) | 2005-09-01 | Judge et al. | Applicant |
| US6968461(B1) | 2005-11-01 | Lucas et al. | Applicant |
| US6981143(B2) | 2005-12-01 | Mullen et al. | Applicant |
| US7051077(B2) | 2006-05-01 | Lin | Applicant |
| US7076527(B2) | 2006-07-01 | Bellegarda et al. | Applicant |
| US7089428(B2) | 2006-08-01 | Farley et al. | Applicant |
| US7089590(B2) | 2006-08-01 | Judge et al. | Applicant |
| US7092992(B1) | 2006-08-01 | Yu | Applicant |
| US7093129(B1) | 2006-08-01 | Gavagni et al. | Applicant |
| US7096498(B2) | 2006-08-01 | Judge | Applicant |
| US7117358(B2) | 2006-10-01 | Bandini et al. | Applicant |
| US7124372(B2) | 2006-10-01 | Brin | Applicant |
| US7124438(B2) | 2006-10-01 | Judge et al. | Applicant |
| US7131003(B2) | 2006-10-01 | Lord et al. | Applicant |
| US7143213(B2) | 2006-11-01 | Need et al. | Applicant |
| US7152105(B2) | 2006-12-01 | McClure et al. | Applicant |
| US7155243(B2) | 2006-12-01 | Baldwin et al. | Applicant |
| US7164678(B2) | 2007-01-01 | Connor | Applicant |
| US7206814(B2) | 2007-04-01 | Kirsch | Applicant |
| US7209954(B1) | 2007-04-01 | Rothwell et al. | Applicant |
| US7213260(B2) | 2007-05-01 | Judge | Applicant |
| US7219131(B2) | 2007-05-01 | Banister et al. | Applicant |
| US7225466(B2) | 2007-05-01 | Judge | Applicant |
| US7254608(B2) | 2007-08-01 | Yeager et al. | Applicant |
| US7254712(B2) | 2007-08-01 | Godfrey et al. | Applicant |
| US7260840(B2) | 2007-08-01 | Swander et al. | Applicant |
| US7272149(B2) | 2007-09-01 | Bly et al. | Applicant |
| US7272853(B2) | 2007-09-01 | Goodman et al. | Applicant |
| US7278159(B2) | 2007-10-01 | Kaashoek et al. | Applicant |
| US7349332(B1) | 2008-03-01 | Srinivasan et al. | Applicant |
| US7376731(B2) | 2008-05-01 | Kahn et al. | Applicant |
| US7379900(B1) | 2008-05-01 | Wren | Applicant |
| US7385924(B1) | 2008-06-01 | Riddle | Applicant |
| US7458098(B2) | 2008-11-01 | Judge et al. | Applicant |
| US7460476(B1) | 2008-12-01 | Morris et al. | Applicant |
| US7461339(B2) | 2008-12-01 | Liao et al. | Applicant |
| US7496634(B1) | 2009-02-01 | Cooley | Applicant |
| US7502829(B2) | 2009-03-01 | Radatti et al. | Examiner |
| US7506155(B1) | 2009-03-01 | Stewart et al. | Applicant |
| US7519563(B1) | 2009-04-01 | Urmanov et al. | Applicant |
| US7519994(B2) | 2009-04-01 | Judge et al. | Applicant |
| US7522516(B1) | 2009-04-01 | Parker | Applicant |
| US7523092(B2) | 2009-04-01 | Andreev et al. | Applicant |
| US7543053(B2) | 2009-06-01 | Goodman et al. | Examiner |
| US7543056(B2) | 2009-06-01 | McClure et al. | Applicant |
| US7545748(B1) | 2009-06-01 | Riddle | Applicant |
| US7610344(B2) | 2009-10-01 | Mehr et al. | Examiner |
| US7617160(B1) | 2009-11-01 | Grove et al. | Applicant |
| US7620986(B1) | 2009-11-01 | Jagannathan et al. | Applicant |
| US7624448(B2) | 2009-11-01 | Coffman | Applicant |
| US7644127(B2) | 2010-01-01 | Yu | Applicant |
| US7647321(B2) | 2010-01-01 | Lund et al. | Applicant |
| US7647411(B1) | 2010-01-01 | Schiavone et al. | Applicant |
| US7668951(B2) | 2010-02-01 | Lund et al. | Examiner |
| US7693947(B2) | 2010-04-01 | Judge et al. | Applicant |
| US7694128(B2) | 2010-04-01 | Judge et al. | Applicant |
| US7711684(B2) | 2010-05-01 | Sundaresan et al. | Applicant |
| US7716310(B2) | 2010-05-01 | Foti | Applicant |
| US7730316(B1) | 2010-06-01 | Baccash | Applicant |
| US7731316(B2) | 2010-06-01 | Yanovsky et al. | Applicant |
| US7739253(B1) | 2010-06-01 | Yanovsky et al. | Applicant |
| US7748038(B2) | 2010-06-01 | Olivier et al. | Examiner |
| US7779156(B2) | 2010-08-01 | Alperovitch et al. | Applicant |
| US7779466(B2) | 2010-08-01 | Judge et al. | Applicant |
| US7870203(B2) | 2011-01-01 | Judge et al. | Applicant |
| US7899866(B1) | 2011-03-01 | Buckingham et al. | Applicant |
| US7903549(B2) | 2011-03-01 | Judge et al. | Applicant |
| US7917627(B1) | 2011-03-01 | Andriantsiferana et al. | Applicant |
| US7937480(B2) | 2011-05-01 | Alperovitch et al. | Applicant |
| US7941523(B2) | 2011-05-01 | Andreev et al. | Applicant |
| US7949716(B2) | 2011-05-01 | Alperovitch et al. | Applicant |
| US7949992(B2) | 2011-05-01 | Andreev et al. | Applicant |
| US7966335(B2) | 2011-06-01 | Slater et al. | Applicant |
| US8042149(B2) | 2011-10-01 | Judge | Applicant |
| US8042181(B2) | 2011-10-01 | Judge | Applicant |
| US8045458(B2) | 2011-10-01 | Alperovitch et al. | Applicant |
| US8051134(B1) | 2011-11-01 | Begeja et al. | Applicant |
| US8069481(B2) | 2011-11-01 | Judge | Applicant |
| US8079087(B1) | 2011-12-01 | Spies et al. | Applicant |
| US8095876(B1) | 2012-01-01 | Verstak et al. | Applicant |
| US8132250(B2) | 2012-03-01 | Judge et al. | Applicant |
| US8160975(B2) | 2012-04-01 | Tang et al. | Applicant |
| US8179798(B2) | 2012-05-01 | Alperovitch et al. | Applicant |
| US8185930(B2) | 2012-05-01 | Alperovitch et al. | Applicant |
| US8214497(B2) | 2012-07-01 | Alperovitch et al. | Applicant |
| US2001/0037311(A1) | 2001-11-01 | McCoy et al. | Applicant |
| US2001/0049793(A1) | 2001-12-01 | Sugimoto | Applicant |
| US2002/0004902(A1) | 2002-01-01 | Toh et al. | Applicant |
| US2002/0009079(A1) | 2002-01-01 | Jugck et al. | Applicant |
| US2002/0013692(A1) | 2002-01-01 | Chandhok et al. | Applicant |
| US2002/0016910(A1) | 2002-02-01 | Wright et al. | Applicant |
| US2002/0023089(A1) | 2002-02-01 | Woo | Applicant |
| US2002/0023140(A1) | 2002-02-01 | Hile et al. | Applicant |
| US2002/0026591(A1) | 2002-02-01 | Hartley et al. | Applicant |
| US2002/0032871(A1) | 2002-03-01 | Malan et al. | Applicant |
| US2002/0035683(A1) | 2002-03-01 | Kaashoek et al. | Applicant |
| US2002/0042876(A1) | 2002-04-01 | Smith | Applicant |
| US2002/0046041(A1) | 2002-04-01 | Lang | Applicant |
| US2002/0049853(A1) | 2002-04-01 | Chu et al. | Applicant |
| US2002/0051575(A1) | 2002-05-01 | Myers et al. | Applicant |
| US2002/0059454(A1) | 2002-05-01 | Barrett et al. | Applicant |
| US2002/0062368(A1) | 2002-05-01 | Holtzman et al. | Applicant |
| US2002/0078382(A1) | 2002-06-01 | Sheikh et al. | Applicant |
| US2002/0087882(A1) | 2002-07-01 | Schneier et al. | Applicant |
| US2002/0095492(A1) | 2002-07-01 | Kaashoek et al. | Applicant |
| US2002/0112013(A1) | 2002-08-01 | Walsh | Applicant |
| US2002/0112185(A1) | 2002-08-01 | Hodges | Applicant |
| US2002/0116627(A1) | 2002-08-01 | Tarbotton et al. | Applicant |
| US2002/0120853(A1) | 2002-08-01 | Tyree | Applicant |
| US2002/0133365(A1) | 2002-09-01 | Grey et al. | Applicant |
| US2002/0138416(A1) | 2002-09-01 | Lovejoy et al. | Applicant |
| US2002/0138755(A1) | 2002-09-01 | Ko | Applicant |
| US2002/0138759(A1) | 2002-09-01 | Dutta | Applicant |
| US2002/0138762(A1) | 2002-09-01 | Horne | Applicant |
| US2002/0143963(A1) | 2002-10-01 | Converse et al. | Applicant |
| US2002/0147734(A1) | 2002-10-01 | Shoup et al. | Applicant |
| US2002/0152399(A1) | 2002-10-01 | Smith | Applicant |
| US2002/0159575(A1) | 2002-10-01 | Skladman et al. | Applicant |
| US2002/0165971(A1) | 2002-11-01 | Baron | Applicant |
| US2002/0169954(A1) | 2002-11-01 | Bandini et al. | Applicant |
| US2002/0172367(A1) | 2002-11-01 | Mulder et al. | Applicant |
| US2002/0178227(A1) | 2002-11-01 | Matsa et al. | Applicant |
| US2002/0178383(A1) | 2002-11-01 | Hrabik et al. | Applicant |
| US2002/0178410(A1) | 2002-11-01 | Haitsma et al. | Applicant |
| US2002/0188732(A1) | 2002-12-01 | Buckman et al. | Applicant |
| US2002/0188864(A1) | 2002-12-01 | Jackson | Applicant |
| US2002/0194469(A1) | 2002-12-01 | Dominique et al. | Applicant |
| US2002/0199095(A1) | 2002-12-01 | Bandini et al. | Applicant |
| US2003/0005326(A1) | 2003-01-01 | Flemming | Applicant |
| US2003/0005331(A1) | 2003-01-01 | Williams | Applicant |
| US2003/0009554(A1) | 2003-01-01 | Burch et al. | Applicant |
| US2003/0009693(A1) | 2003-01-01 | Brock et al. | Applicant |
| US2003/0009696(A1) | 2003-01-01 | Bunker et al. | Applicant |
| US2003/0009699(A1) | 2003-01-01 | Gupta et al. | Applicant |
| US2003/0014664(A1) | 2003-01-01 | Hentunen | Applicant |
| US2003/0023692(A1) | 2003-01-01 | Moroo | Applicant |
| US2003/0023695(A1) | 2003-01-01 | Kobata et al. | Applicant |
| US2003/0023736(A1) | 2003-01-01 | Abkemeier | Applicant |
| US2003/0023873(A1) | 2003-01-01 | Ben-Itzhak | Applicant |
| US2003/0023874(A1) | 2003-01-01 | Prokupets et al. | Applicant |
| US2003/0023875(A1) | 2003-01-01 | Hursey et al. | Applicant |
| US2003/0028406(A1) | 2003-02-01 | Herz et al. | Applicant |
| US2003/0028803(A1) | 2003-02-01 | Bunker et al. | Applicant |
| US2003/0033516(A1) | 2003-02-01 | Howard et al. | Applicant |
| US2003/0033542(A1) | 2003-02-01 | Goseva-Popstojanova et al. | Applicant |
| US2003/0041264(A1) | 2003-02-01 | Black et al. | Applicant |
| US2003/0046253(A1) | 2003-03-01 | Shetty et al. | Applicant |
| US2003/0051026(A1) | 2003-03-01 | Carter et al. | Applicant |
| US2003/0051163(A1) | 2003-03-01 | Bidaud | Applicant |
| US2003/0051168(A1) | 2003-03-01 | King et al. | Applicant |
| US2003/0055931(A1) | 2003-03-01 | Cravo De Almeida et al. | Applicant |
| US2003/0061506(A1) | 2003-03-01 | Cooper et al. | Applicant |
| US2003/0065943(A1) | 2003-04-01 | Geis et al. | Applicant |
| US2003/0084280(A1) | 2003-05-01 | Bryan et al. | Applicant |
| US2003/0084320(A1) | 2003-05-01 | Tarquini et al. | Applicant |
| US2003/0084323(A1) | 2003-05-01 | Gales | Applicant |
| US2003/0084347(A1) | 2003-05-01 | Luzzatto | Applicant |
| US2003/0088792(A1) | 2003-05-01 | Card et al. | Applicant |
| US2003/0093518(A1) | 2003-05-01 | Hiraga | Applicant |
| US2003/0093667(A1) | 2003-05-01 | Dutta et al. | Applicant |
| US2003/0093695(A1) | 2003-05-01 | Dutta | Applicant |
| US2003/0093696(A1) | 2003-05-01 | Sugimoto | Applicant |
| US2003/0095555(A1) | 2003-05-01 | McNamara et al. | Applicant |
| US2003/0097439(A1) | 2003-05-01 | Strayer et al. | Applicant |
| US2003/0097564(A1) | 2003-05-01 | Tewari et al. | Applicant |
| US2003/0105976(A1) | 2003-06-01 | Copeland, III | Applicant |
| US2003/0110392(A1) | 2003-06-01 | Aucsmith et al. | Applicant |
| US2003/0110396(A1) | 2003-06-01 | Lewis et al. | Applicant |
| US2003/0115485(A1) | 2003-06-01 | Milliken | Applicant |
| US2003/0115486(A1) | 2003-06-01 | Choi et al. | Applicant |
| US2003/0123665(A1) | 2003-07-01 | Dunstan et al. | Applicant |
| US2003/0126464(A1) | 2003-07-01 | McDaniel et al. | Applicant |
| US2003/0126472(A1) | 2003-07-01 | Banzhof | Applicant |
| US2003/0135749(A1) | 2003-07-01 | Gales et al. | Applicant |
| US2003/0140137(A1) | 2003-07-01 | Joiner et al. | Applicant |
| US2003/0140250(A1) | 2003-07-01 | Taninaka et al. | Applicant |
| US2003/0145212(A1) | 2003-07-01 | Crumly | Applicant |
| US2003/0145225(A1) | 2003-07-01 | Bruton, III et al. | Applicant |
| US2003/0145226(A1) | 2003-07-01 | Bruton, III et al. | Applicant |
| US2003/0149887(A1) | 2003-08-01 | Yadav | Applicant |
| US2003/0149888(A1) | 2003-08-01 | Yadav | Applicant |
| US2003/0152076(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0152096(A1) | 2003-08-01 | Chapman | Applicant |
| US2003/0154393(A1) | 2003-08-01 | Young | Applicant |
| US2003/0154399(A1) | 2003-08-01 | Zuk et al. | Applicant |
| US2003/0154402(A1) | 2003-08-01 | Pandit et al. | Applicant |
| US2003/0158905(A1) | 2003-08-01 | Petry et al. | Applicant |
| US2003/0159069(A1) | 2003-08-01 | Choi et al. | Applicant |
| US2003/0159070(A1) | 2003-08-01 | Mayer et al. | Applicant |
| US2003/0167308(A1) | 2003-09-01 | Schran | Applicant |
| US2003/0167402(A1) | 2003-09-01 | Stolfo et al. | Applicant |
| US2003/0172166(A1) | 2003-09-01 | Judge et al. | Applicant |
| US2003/0172167(A1) | 2003-09-01 | Judge et al. | Applicant |
| US2003/0172289(A1) | 2003-09-01 | Soppera | Applicant |
| US2003/0172291(A1) | 2003-09-01 | Judge et al. | Applicant |
| US2003/0172292(A1) | 2003-09-01 | Judge | Applicant |
| US2003/0172294(A1) | 2003-09-01 | Judge | Applicant |
| US2003/0172301(A1) | 2003-09-01 | Judge et al. | Applicant |
| US2003/0172302(A1) | 2003-09-01 | Judge et al. | Applicant |
| US2003/0182421(A1) | 2003-09-01 | Faybishenko et al. | Applicant |
| US2003/0187936(A1) | 2003-10-01 | Bodin et al. | Applicant |
| US2003/0187996(A1) | 2003-10-01 | Cardina et al. | Applicant |
| US2003/0204596(A1) | 2003-10-01 | Yadav | Applicant |
| US2003/0204719(A1) | 2003-10-01 | Ben | Applicant |
| US2003/0204741(A1) | 2003-10-01 | Schoen et al. | Applicant |
| US2003/0212791(A1) | 2003-11-01 | Pickup | Applicant |
| US2003/0233328(A1) | 2003-12-01 | Scott et al. | Applicant |
| US2004/0015554(A1) | 2004-01-01 | Wilson | Applicant |
| US2004/0025044(A1) | 2004-02-01 | Day | Applicant |
| US2004/0034794(A1) | 2004-02-01 | Mayer et al. | Applicant |
| US2004/0054886(A1) | 2004-03-01 | Dickinson et al. | Applicant |
| US2004/0058673(A1) | 2004-03-01 | Iriam et al. | Applicant |
| US2004/0059811(A1) | 2004-03-01 | Sugauchi et al. | Applicant |
| US2004/0088570(A1) | 2004-05-01 | Roberts et al. | Applicant |
| US2004/0098464(A1) | 2004-05-01 | Koch et al. | Applicant |
| US2004/0111519(A1) | 2004-06-01 | Fu et al. | Applicant |
| US2004/0111531(A1) | 2004-06-01 | Staniford et al. | Applicant |
| US2004/0122926(A1) | 2004-06-01 | Moore et al. | Applicant |
| US2004/0122967(A1) | 2004-06-01 | Bressler et al. | Applicant |
| US2004/0123157(A1) | 2004-06-01 | Alagna et al. | Applicant |
| US2004/0128355(A1) | 2004-07-01 | Chao et al. | Applicant |
| US2004/0139160(A1) | 2004-07-01 | Wallace et al. | Applicant |
| US2004/0139334(A1) | 2004-07-01 | Wiseman | Applicant |
| US2004/0165727(A1) | 2004-08-01 | Moreh et al. | Applicant |
| US2004/0167968(A1) | 2004-08-01 | Wilson et al. | Applicant |
| US2004/0177120(A1) | 2004-09-01 | Kirsch | Applicant |
| US2004/0203589(A1) | 2004-10-01 | Wang et al. | Applicant |
| US2004/0205135(A1) | 2004-10-01 | Hallam-Baker | Applicant |
| US2004/0221062(A1) | 2004-11-01 | Starbuck et al. | Applicant |
| US2004/0236884(A1) | 2004-11-01 | Beetz | Applicant |
| US2004/0249895(A1) | 2004-12-01 | Way | Applicant |
| US2004/0255122(A1) | 2004-12-01 | Ingerman et al. | Applicant |
| US2004/0267893(A1) | 2004-12-01 | Lin | Applicant |
| US2005/0021738(A1) | 2005-01-01 | Goeller | Applicant |
| US2005/0021997(A1) | 2005-01-01 | Beynon et al. | Applicant |
| US2005/0033742(A1) | 2005-02-01 | Kamvar et al. | Applicant |
| US2005/0044158(A1) | 2005-02-01 | Malik | Applicant |
| US2005/0052998(A1) | 2005-03-01 | Oliver et al. | Applicant |
| US2005/0060295(A1) | 2005-03-01 | Gould et al. | Applicant |
| US2005/0060643(A1) | 2005-03-01 | Glass et al. | Applicant |
| US2005/0065810(A1) | 2005-03-01 | Bouron | Applicant |
| US2005/0086300(A1) | 2005-04-01 | Yaeger et al. | Applicant |
| US2005/0091319(A1) | 2005-04-01 | Kirsch | Applicant |
| US2005/0091320(A1) | 2005-04-01 | Kirsch et al. | Applicant |
| US2005/0102366(A1) | 2005-05-01 | Kirsch | Applicant |
| US2005/0120019(A1) | 2005-06-01 | Rigoutsos et al. | Applicant |
| US2005/0141427(A1) | 2005-06-01 | Bartkay | Applicant |
| US2005/0149383(A1) | 2005-07-01 | Zacharia et al. | Applicant |
| US2005/0159998(A1) | 2005-07-01 | Buyukkokten et al. | Applicant |
| US2005/0160148(A1) | 2005-07-01 | Yu | Applicant |
| US2005/0192958(A1) | 2005-09-01 | Widjojo et al. | Applicant |
| US2005/0193076(A1) | 2005-09-01 | Flury et al. | Applicant |
| US2005/0198159(A1) | 2005-09-01 | Kirsch | Applicant |
| US2005/0204001(A1) | 2005-09-01 | Stein et al. | Applicant |
| US2005/0216564(A1) | 2005-09-01 | Myers et al. | Applicant |
| US2005/0256866(A1) | 2005-11-01 | Lu et al. | Applicant |
| US2005/0262209(A1) | 2005-11-01 | Yu | Applicant |
| US2005/0262210(A1) | 2005-11-01 | Yu | Applicant |
| US2005/0262556(A1) | 2005-11-01 | Waisman et al. | Applicant |
| US2006/0007936(A1) | 2006-01-01 | Shrum et al. | Applicant |
| US2006/0009994(A1) | 2006-01-01 | Hogg et al. | Applicant |
| US2006/0010212(A1) | 2006-01-01 | Whitney et al. | Applicant |
| US2006/0015561(A1) | 2006-01-01 | Murphy et al. | Applicant |
| US2006/0015563(A1) | 2006-01-01 | Judge et al. | Applicant |
| US2006/0015942(A1) | 2006-01-01 | Judge et al. | Applicant |
| US2006/0016824(A1) | 2006-01-01 | Guerra | Applicant |
| US2006/0021055(A1) | 2006-01-01 | Judge et al. | Applicant |
| US2006/0023940(A1) | 2006-02-01 | Katsuyama | Applicant |
| US2006/0031314(A1) | 2006-02-01 | Brahms et al. | Applicant |
| US2006/0031483(A1) | 2006-02-01 | Lund et al. | Applicant |
| US2006/0036693(A1) | 2006-02-01 | Hulten et al. | Applicant |
| US2006/0036727(A1) | 2006-02-01 | Kurapati et al. | Applicant |
| US2006/0041508(A1) | 2006-02-01 | Pham et al. | Applicant |
| US2006/0042483(A1) | 2006-03-01 | Work et al. | Applicant |
| US2006/0047794(A1) | 2006-03-01 | Jezierski | Applicant |
| US2006/0059238(A1) | 2006-03-01 | Slater et al. | Applicant |
| US2006/0095404(A1) | 2006-05-01 | Adelman et al. | Applicant |
| US2006/0095586(A1) | 2006-05-01 | Adelman et al. | Applicant |
| US2006/0112026(A1) | 2006-05-01 | Graf et al. | Applicant |
| US2006/0123083(A1) | 2006-06-01 | Goutte et al. | Applicant |
| US2006/0129810(A1) | 2006-06-01 | Jeong et al. | Applicant |
| US2006/0149821(A1) | 2006-07-01 | Rajan et al. | Applicant |
| US2006/0155553(A1) | 2006-07-01 | Brohman et al. | Applicant |
| US2006/0168024(A1) | 2006-07-01 | Mehr et al. | Applicant |
| US2006/0168041(A1) | 2006-07-01 | Mishra et al. | Applicant |
| US2006/0174337(A1) | 2006-08-01 | Bernoth | Applicant |
| US2006/0174341(A1) | 2006-08-01 | Judge | Applicant |
| US2006/0179113(A1) | 2006-08-01 | Buckingham et al. | Applicant |
| US2006/0184632(A1) | 2006-08-01 | Marino et al. | Applicant |
| US2006/0191002(A1) | 2006-08-01 | Lee et al. | Applicant |
| US2006/0212925(A1) | 2006-09-01 | Shull et al. | Applicant |
| US2006/0212930(A1) | 2006-09-01 | Shull et al. | Applicant |
| US2006/0212931(A1) | 2006-09-01 | Shull et al. | Applicant |
| US2006/0225136(A1) | 2006-10-01 | Rounthwaite et al. | Applicant |
| US2006/0230039(A1) | 2006-10-01 | Shull et al. | Applicant |
| US2006/0230134(A1) | 2006-10-01 | Qian et al. | Applicant |
| US2006/0248156(A1) | 2006-11-01 | Judge et al. | Applicant |
| US2006/0251068(A1) | 2006-11-01 | Judge et al. | Applicant |
| US2006/0253447(A1) | 2006-11-01 | Judge | Applicant |
| US2006/0253458(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0253578(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0253579(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0253582(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0253584(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0265747(A1) | 2006-11-01 | Judge | Applicant |
| US2006/0267802(A1) | 2006-11-01 | Judge et al. | Applicant |
| US2006/0277259(A1) | 2006-12-01 | Murphy et al. | Applicant |
| US2006/0277264(A1) | 2006-12-01 | Rainisto | Applicant |
| US2007/0002831(A1) | 2007-01-01 | Allen et al. | Applicant |
| US2007/0019235(A1) | 2007-01-01 | Lee | Applicant |
| US2007/0025304(A1) | 2007-02-01 | Leelahakriengkrai et al. | Applicant |
| US2007/0027992(A1) | 2007-02-01 | Judge et al. | Applicant |
| US2007/0028301(A1) | 2007-02-01 | Shull et al. | Applicant |
| US2007/0043738(A1) | 2007-02-01 | Morris et al. | Applicant |
| US2007/0078675(A1) | 2007-04-01 | Kaplan | Applicant |
| US2007/0124803(A1) | 2007-05-01 | Taraz | Applicant |
| US2007/0130350(A1) | 2007-06-01 | Alperovitch et al. | Applicant |
| US2007/0130351(A1) | 2007-06-01 | Alperovitch et al. | Applicant |
| US2007/0168394(A1) | 2007-07-01 | Vivekanand | Applicant |
| US2007/0195753(A1) | 2007-08-01 | Judge et al. | Applicant |
| US2007/0195779(A1) | 2007-08-01 | Judge et al. | Applicant |
| US2007/0199070(A1) | 2007-08-01 | Hughes | Applicant |
| US2007/0203997(A1) | 2007-08-01 | Ingerman et al. | Applicant |
| US2007/0208817(A1) | 2007-09-01 | Lund et al. | Applicant |
| US2007/0208853(A1) | 2007-09-01 | Yang | Applicant |
| US2007/0214151(A1) | 2007-09-01 | Thomas et al. | Applicant |
| US2007/0233787(A1) | 2007-10-01 | Pagan | Applicant |
| US2007/0239642(A1) | 2007-10-01 | Sindhwani et al. | Applicant |
| US2007/0253412(A1) | 2007-11-01 | Batteram et al. | Applicant |
| US2007/0260691(A1) | 2007-11-01 | Kallqvist et al. | Applicant |
| US2008/0004048(A1) | 2008-01-01 | Cai et al. | Applicant |
| US2008/0005108(A1) | 2008-01-01 | Ozzie et al. | Applicant |
| US2008/0005223(A1) | 2008-01-01 | Flake et al. | Applicant |
| US2008/0022384(A1) | 2008-01-01 | Yee et al. | Applicant |
| US2008/0047009(A1) | 2008-02-01 | Overcash et al. | Applicant |
| US2008/0077517(A1) | 2008-03-01 | Sappington | Applicant |
| US2008/0082662(A1) | 2008-04-01 | Dandliker et al. | Applicant |
| US2008/0091765(A1) | 2008-04-01 | Gammage et al. | Applicant |
| US2008/0103843(A1) | 2008-05-01 | Goeppert et al. | Applicant |
| US2008/0104180(A1) | 2008-05-01 | Gabe | Applicant |
| US2008/0104235(A1) | 2008-05-01 | Oliver et al. | Applicant |
| US2008/0123823(A1) | 2008-05-01 | Pirzada et al. | Applicant |
| US2008/0159632(A1) | 2008-07-01 | Oliver et al. | Applicant |
| US2008/0175226(A1) | 2008-07-01 | Alperovitch et al. | Applicant |
| US2008/0175266(A1) | 2008-07-01 | Alperovitch et al. | Applicant |
| US2008/0177684(A1) | 2008-07-01 | Laxman et al. | Applicant |
| US2008/0177691(A1) | 2008-07-01 | Alperovitch et al. | Applicant |
| US2008/0178259(A1) | 2008-07-01 | Alperovitch et al. | Applicant |
| US2008/0178288(A1) | 2008-07-01 | Alperovitch et al. | Applicant |
| US2008/0256622(A1) | 2008-10-01 | Neystadt et al. | Applicant |
| US2008/0301755(A1) | 2008-12-01 | Sinha et al. | Applicant |
| US2008/0303689(A1) | 2008-12-01 | Iverson | Applicant |
| US2009/0003204(A1) | 2009-01-01 | Okholm et al. | Applicant |
| US2009/0089279(A1) | 2009-04-01 | Jeong et al. | Applicant |
| US2009/0103524(A1) | 2009-04-01 | Mantripragada et al. | Applicant |
| US2009/0113016(A1) | 2009-04-01 | Sen et al. | Applicant |
| US2009/0119740(A1) | 2009-05-01 | Alperovitch et al. | Applicant |
| US2009/0122699(A1) | 2009-05-01 | Alperovitch et al. | Applicant |
| US2009/0125980(A1) | 2009-05-01 | Alperovitch et al. | Applicant |
| US2009/0164582(A1) | 2009-06-01 | Dasgupta et al. | Applicant |
| US2009/0192955(A1) | 2009-07-01 | Tang et al. | Applicant |
| US2009/0254499(A1) | 2009-10-01 | Deyo | Applicant |
| US2009/0254572(A1) | 2009-10-01 | Redlich et al. | Applicant |
| US2009/0254663(A1) | 2009-10-01 | Alperovitch et al. | Applicant |
| US2009/0282476(A1) | 2009-11-01 | Nachenberg et al. | Applicant |
| US2010/0115040(A1) | 2010-05-01 | Sargent et al. | Applicant |
| US2010/0306846(A1) | 2010-12-01 | Alperovitch et al. | Applicant |
| US2011/0053513(A1) | 2011-03-01 | Papakostas et al. | Applicant |
| US2011/0280160(A1) | 2011-11-01 | Yang | Applicant |
| US2011/0296519(A1) | 2011-12-01 | Ide et al. | Applicant |
| US2012/0011252(A1) | 2012-01-01 | Alperovitch et al. | Applicant |
| US2012/0084441(A1) | 2012-04-01 | Alperovitch et al. | Applicant |
| US2012/0110672(A1) | 2012-05-01 | Judge et al. | Applicant |
| US2012/0174219(A1) | 2012-07-01 | Hernandez et al. | Applicant |
| US2012/0204265(A1) | 2012-08-01 | Judge | Applicant |
| US2012/0216248(A1) | 2012-08-01 | Alperovitch et al. | Applicant |
| US2012/0239751(A1) | 2012-09-01 | Alperovitch et al. | Applicant |
| US2012/0240228(A1) | 2012-09-01 | Alperovitch et al. | Applicant |
| US2012/0271890(A1) | 2012-10-01 | Judge et al. | Applicant |
| AU2005304883 | 2006-05-01 | Applicant | |
| AU2006315184 | 2007-05-01 | Applicant | |
| AU2008207924 | 2008-07-01 | Applicant | |
| AU2008207926 | 2008-07-01 | Applicant | |
| AU2008207930 | 2008-07-01 | Applicant | |
| AU2008323779 | 2009-05-01 | Applicant | |
| AU2008323784 | 2009-05-01 | Applicant | |
| AU2008323922 | 2009-05-01 | Applicant | |
| AU2009203095 | 2009-08-01 | Applicant | |
| CA2478299 | 2003-09-01 | Applicant | |
| CA2564533 | 2005-12-01 | Applicant | |
| CA2586709 | 2006-05-01 | Applicant | |
| CA2628189 | 2007-05-01 | Applicant | |
| CA2654796 | 2007-12-01 | Applicant | |
| CN1363899 | 2002-08-01 | Applicant | |
| CN1471098 | 2004-01-01 | Applicant | |
| CN10140166 | 2009-04-01 | Applicant | |
| CN101443736 | 2009-05-01 | Applicant | |
| CN101730892 | 2010-06-01 | Applicant | |
| CN101730904 | 2010-06-01 | Applicant | |
| CN101730903 | 2012-11-01 | Applicant | |
| CN103095672 | 2013-05-01 | Applicant | |
| EP375138(A2) | 1990-06-01 | Applicant | |
| EP413537(A2) | 1991-02-01 | Applicant | |
| EP420779(A2) | 1991-04-01 | Applicant | |
| EP720333(A2) | 1996-07-01 | Applicant | |
| EP838774(A2) | 1998-04-01 | Applicant | |
| EP869652(A2) | 1998-10-01 | Applicant | |
| EP907120(A2) | 1999-04-01 | Applicant | |
| EP1326376 | 2003-07-01 | Applicant | |
| EP1488316 | 2004-12-01 | Applicant | |
| EP1271846 | 2005-07-01 | Applicant | |
| EP1672558 | 2006-06-01 | Applicant | |
| EP1820101 | 2007-08-01 | Applicant | |
| EP1819108 | 2008-06-01 | Applicant | |
| EP1982540 | 2008-10-01 | Applicant | |
| EP2036246 | 2009-03-01 | Applicant | |
| EP2115642 | 2009-11-01 | Applicant | |
| EP2115689 | 2009-11-01 | Applicant | |
| EP2213056 | 2010-08-01 | Applicant | |
| EP2218215 | 2010-08-01 | Applicant | |
| EP2223258 | 2010-09-01 | Applicant | |
| EP2562975 | 2013-02-01 | Applicant | |
| EP2562976 | 2013-02-01 | Applicant | |
| EP2562986 | 2013-02-01 | Applicant | |
| EP2562987 | 2013-02-01 | Applicant | |
| GB2271002 | 1994-03-01 | Applicant | |
| GB2357932 | 2001-07-01 | Applicant | |
| IN3279-DELNP-2007 | 2007-08-01 | Applicant | |
| IN4233-DELNP-2007 | 2008-08-01 | Applicant | |
| IN4842/CHENP/2009 | 2010-01-01 | Applicant | |
| IN4763/CHENP/2009 | 2010-07-01 | Applicant | |
| JP2000-148276 | 2000-05-01 | Applicant | |
| JP2000-215046 | 2000-08-01 | Applicant | |
| JP2001-028006 | 2001-01-01 | Applicant | |
| JP2003-150482 | 2003-05-01 | Applicant | |
| JP2004-533677 | 2004-11-01 | Applicant | |
| JP2004-537075 | 2004-12-01 | Applicant | |
| JP2005-520230 | 2005-07-01 | Applicant | |
| JP2006-268544 | 2006-10-01 | Applicant | |
| JP2006-350870 | 2006-12-01 | Applicant | |
| JP18350870 | 2006-12-01 | Applicant | |
| JP2007-540073 | 2008-06-01 | Applicant | |
| JP2009-516269 | 2009-04-01 | Applicant | |
| KR10-0447082 | 2004-09-01 | Applicant | |
| KR2006-0012137 | 2006-02-01 | Applicant | |
| KR2006-0028200 | 2006-03-01 | Applicant | |
| KR2006-028200 | 2006-03-01 | Applicant | |
| KR1020060041934 | 2006-05-01 | Applicant | |
| KR10-0699531 | 2007-03-01 | Applicant | |
| KR699531 | 2007-03-01 | Applicant | |
| KR10-0737523 | 2007-07-01 | Applicant | |
| KR737523 | 2007-07-01 | Applicant | |
| KR10-0750377 | 2007-08-01 | Applicant | |
| KR750377 | 2007-08-01 | Applicant | |
| KR447082 | 2009-12-01 | Applicant | |
| SG106744 | 2004-11-01 | Applicant | |
| SG142513 | 2008-06-01 | Applicant | |
| WO96/35994 | 1996-11-01 | Applicant | |
| WO99/05814 | 1999-02-01 | Applicant | |
| WO99/33188 | 1999-07-01 | Applicant | |
| WO99/37066 | 1999-07-01 | Applicant | |
| WO/07312 | 2000-02-01 | Applicant | |
| WO/08543 | 2000-02-01 | Applicant | |
| WO/42748 | 2000-07-01 | Applicant | |
| WO/59167 | 2000-10-01 | Applicant | |
| WO1/17165 | 2001-03-01 | Applicant | |
| WO1/022686 | 2001-03-01 | Applicant | |
| WO1/50691 | 2001-07-01 | Applicant | |
| WO1/76181 | 2001-10-01 | Applicant | |
| WO1/80480 | 2001-10-01 | Applicant | |
| WO1/88834 | 2001-11-01 | Applicant | |
| WO2/13469 | 2002-02-01 | Applicant | |
| WO2/13489 | 2002-02-01 | Applicant | |
| WO2/15521 | 2002-02-01 | Applicant | |
| WO2/075547 | 2002-09-01 | Applicant | |
| WO2/082293 | 2002-10-01 | Applicant | |
| WO2/091706 | 2002-11-01 | Applicant | |
| WO3/077071 | 2003-09-01 | Applicant | |
| WO2004/061698 | 2004-07-01 | Applicant | |
| WO2004/061703 | 2004-07-01 | Applicant | |
| WO2004/081734 | 2004-09-01 | Applicant | |
| WO2004/088455 | 2004-10-01 | Applicant | |
| WO2005/006139 | 2005-01-01 | Applicant | |
| WO2005/086437 | 2005-09-01 | Applicant | |
| WO2005/116851 | 2005-12-01 | Applicant | |
| WO2005/119485 | 2005-12-01 | Applicant | |
| WO2005/119488 | 2005-12-01 | Applicant | |
| WO2006/029399 | 2006-03-01 | Applicant | |
| WO2006/119509 | 2006-03-01 | Applicant | |
| WO2006/052736 | 2006-05-01 | Applicant | |
| WO2007/030951 | 2007-03-01 | Applicant | |
| WO2007/059428 | 2007-05-01 | Applicant | |
| WO2007/146690 | 2007-12-01 | Applicant | |
| WO2007/146696 | 2007-12-01 | Applicant | |
| WO2007/146701 | 2007-12-01 | Applicant | |
| WO2008/008543 | 2008-01-01 | Applicant | |
| WO2008/091980 | 2008-07-01 | Applicant | |
| WO2008/091982 | 2008-07-01 | Applicant | |
| WO2008/091986 | 2008-07-01 | Applicant | |
| WO2009/146118 | 2009-02-01 | Applicant | |
| WO2009/061893 | 2009-05-01 | Applicant | |
| WO2009/062018 | 2009-05-01 | Applicant | |
| WO2009/062023 | 2009-05-01 | Applicant |
Non-Patent Literature (121)
- Japanese Examiner Koji Tamaki, Office Action in JP App. Ser. No. 2007-540073, dated Dec. 16, 2010, 4 pages.Applicant
- Article entitled “An Example-Based Mapping Method for Text Categorization and Retrieval” by Yang et. al., in ACM Transactions on Information Systems, Jul. 1994, vol. 12, No. 3, pp. 252-277.Applicant
- Article entitled “A Comparison of Two Learning Algorithms for Text Categorization” by Lewis et al., in Third Annual Symposium on Document Analysis and Information Retrieval, Apr. 11-13, 1994, pp. 81-92.Applicant
- Article entitled “Learning Limited Dependence Bayesian Classifiers” by Sahami, in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, 1996, pp. 335-338.Applicant
- Article entitled “An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task” by Lewis, in 15th Ann Int'l SIGIR, Jun. 1992, pp. 37-50.Applicant
- Book entitled Machine Learning by Mitchell, 1997, pp. 180-184.Applicant
- Article entitled “Learning Rules that Classify E-mail” by Cohen, pp. 1-8. Date unknown.Applicant
- Article entitled “Hierarchically classifying documents using very few words” by Koller et. al., in Proceedings of the Fourteenth International Conference on Machine Learning, 1997.Applicant
- Article entitled “Classification of Text Documents” by Li et. al., in The Computer Journal, vol. 41, No. 8, 1998, pp. 537-546.Applicant
- Article entitled “Issues when designing filters in messaging systems” by Palme et. al., in 19 Computer Communications, 1996, pp. 95-101.Applicant
- Article entitled “Text Categorization with Support Vector Machines: Learning with Many Relevant Features” by Joachins in Machine Learning: ECML-98, Apr. 1998, pp. 1-14.Applicant
- Article entitled “Hierarchical Bayesian Clustering for Automatic Text Classification” by Iwayama et al. in Natural Language, pp. 1322-1327. Date unknown.Applicant
- Article entitled “Smokey: Automatic Recognition of Hostile Messages” by Spertus in Innovative Applications 1997, pp. 1058-1065.Applicant
- Article entitled “A Comparison of Classifiers and Document Representations for the Routing Problem” by Schutze. Date unknown.Applicant
- Article entitled “CAFE: A Conceptual Model for Managing Information in Electronic Mail” by Takkinen et al. In Proc. 31st Annual Hawaii International Conference on System Sciences, 1998, pp. 44-53.Applicant
- Article entitled “A Comparative Study on Feature Selection in Text Categorization” by Yang et. al. Date unknown.Applicant
- Article entitled “Spam!” by Cranor et. al. in Communications of the ACM, vol. 41, No. 8, Aug. 1998, pp. 74-83.Applicant
- Article entitled “Sendmail and Spam” by LeFebvre in Performance Computing, Aug. 1998, pp. 55-58.Applicant
- Article entitled “Implementing a Generalized Tool for Network Monitoring” by Ranum et. al. in LISA XI, Oct. 26-31, 1997, pp. 1-8.Applicant
- Article entitled “Method for Automatic Contextual Transposition Upon Receipt of Item of Specified Criteria” printed Feb. 1994 in IBM Technical Disclosure Bulletin, vol. 37, No. 2B, p. 333.Applicant
- Article entitled “Toward Optimal Feature Selection” by Koller et al., in Machine Learning: Proc. of the Thirteenth International Conference, 1996.Applicant
- Website: Technical Focus—Products—Entegrity AssureAccess. www2.entegrity.com.Applicant
- Website: Create Secure Internet Communication Channels—Atabok Homepage. www.atabok.com.Applicant
- Website: ATABOK VCNMAIL™ Secure Email Solution—Atabok Related Produces. www.atabok.com.Applicant
- Website: ATABOK VCN Auto-Exchange™—Atabok Related Produces. www.atabok.com.Applicant
- Website: Controlling Digital Assets is a Paramount Need for All Business—Atabok Related Produces. www.atabok.com.Applicant
- Website: Control Your Confidential Communications with ATABOK—Atabok Related Produces. www.atabok.com.Applicant
- Website: Entrust Entelligence—Entrust Homepage. www.entrust.com.Applicant
- Website: E-mail Plug-in—Get Technical/Interoperability—Entrust Entelligence. www.entrust.com.Applicant
- Website: E-mail Plug-in—Get Technical/System Requirements—Entrust Entelligence. www.entrust.com.Applicant
- Website: E-mail Plug-in—Features and Benefits—Entrust Entelligence. www.entrust.com.Applicant
- Website: Internet Filtering Software—Internet Manager Homepage. www.elronsw.com.Applicant
- Website: ESKE—Email with Secure Key Exchange—ESKE. www.danu.ie.Applicant
- Website: Terminet—ESKE. www.danu.ie.Applicant
- Website: Baltimore Focus on e-Security—Baltimore Technologies. www.baltimore.com.Applicant
- Article entitled “Securing Electronic Mail Systems” by Serenelli et al., in Communications-Fusing Command Control and Intelligence: MILCOM '92, 1992, pp. 677-680.Applicant
- Article entitled “Integralis' Minesweeper defuses E-mail bombs” by Kramer et. al., in PC Week, Mar. 18, 1996, p. N17-N23.Applicant
- Article entitled “A Toolkit and Methods for Internet Firewalls” by Ranum et. al., in Proc. of USENIX Summer 1994 Technical Conference, Jun. 6-10, 1994, pp. 37-44.Applicant
- Article entitled “Firewall Systems: The Next Generation” by McGhie, in Integration Issues Large Commercial Media Delivery Systems: Proc. of SPIE-The in International Society for Optical Engineering, Oct. 23-24, 1995, pp. 270-281.Applicant
- Article entitled “Design of the TTI Prototype Trusted Mail Agent” by Rose et. al., in Computer Message Systems-85: Proc. of the IFIP TC 6 International Symposium on Computer Message Systems, Sep. 5-7, 1985, pp. 377-399.Applicant
- Article entitled “Designing an Academic Firewall: Policy, Practice, and Experience with SURF” by Greenwald et. al., in Proc. of the 1996 Symposium on Network and Distributed Systems Security, 1996, pp. 1-14.Applicant
- Article entitled “X Through the Firewall, and Other Application Relays” by Treese et. al. in Proc. of the USENIX Summer 1993 Technical Conference, Jun. 21-25, 1993, pp. 87-99.Applicant
- Article entitled “Firewalls for Sale” by Bryan, in BYTE, Apr. 1995, pp. 99-104.Applicant
- Article entitled “A DNS Filter and Switch for Packet-filtering Gateways” by Cheswick et al., in Proc. of the Sixth Annual USENIX Security Symposium: Focusing on Applications of Cryptography, Jul. 22-25, 1996, pp. 15-19.Applicant
- Article entitled “Safe Use of X Window System Protocol Across a Firewall” by Kahn, in Proc. of the Fifth USENIX UNIX Security Symposium, Jun. 5-7, 1995, pp. 105-116.Applicant
- Article entitled “Automating the OSI to Internet Management Conversion Through the Use of an Object-Oriented Platform” by Pavlou et al., in Proc. of the IFIP TC6/WG6.4 International Conference on Advanced Information Processing Techniques for LAN and MAN Management, Apr. 7-9, 1993, pp. 245-260.Applicant
- Article entitled “A Secure Email Gateway (Building an RCAS External Interface)” by Smith, in Tenth Annual Computer Security Applications Conference, Dec. 5-9, 1994, pp. 202-211.Applicant
- Article entitled “Secure External References in Multimedia Email Messages” by Wiegel, in 3rd ACM Conference on Computer and Communications Security, Mar. 14-16, 1996, pp. 11-18.Applicant
- Memo entitled “SOCKS Protocol Version 5” by Leech et. al., in Standards Track, Mar. 1996, pp. 1-9.Applicant
- Article entitled “Securing the Web: fire walls, proxy servers, and data driver attacks” by Farrow in InfoWorld, Jun. 19, 1995, vol. 17, No. 25, p. 103.Applicant
- Website: Go Secure! for Microsoft Exchange—Products/Services—Verisign, Inc. www.verisign.com.Applicant
- Article entitled “MIMEsweeper defuses virus network, 'net mail bombs” by Avery, in Info World, May 20, 1996, vol. 12, No. 21, p. N1.Applicant
- Article entitled “Stomping out mail viruses” by Wilkerson, in PC Week, Jul. 15, 1996, p. N8.Applicant
- Lane, Terran et al., “Sequence Matching and Learning in Anomaly Detection for Computer Security,” AAAI Technical Report WS-97-07, 1997, p. 43 to 49.Applicant
- Feitelson et al., “Self-Tuning Systems”, Mar./Apr. 1999, IEEE, 0740-7459/99, pp. 52-60.Applicant
- Natsev, Apostol et al., “WALRUS: A Similarity Retrieval Algorithm for Image Databases,” Mar. 2004.Applicant
- Schleimer, Saul, et al., “Winnowing: Local Algorighms for Document Fingerprinting.” Jun. 2003.Applicant
- Anklesaria, F. et al., “The Internet Gopher Protocol”, RFC 1436, Mar. 1993.Applicant
- Berners-Lee, T. et al., “Uniform Resource Identifiers (URI): Generic Syntax”, RFC 2396, Aug. 1998.Applicant
- Crispin, M., “Internet Message Access Protocol—Version 4rev1”, RFC 2060, Dec. 1996.Applicant
- Franks, J. et al., “HITP Authentication: Basic and Digest Access Authentication”, RFC 2617, Jun. 1999.Applicant
- Klensin, J. et al., “SMTP Service Extensions”, RFC 1869, Nov. 1995.Applicant
- Moats, R., “URN Syntax”, RFC 2141, May 1997.Applicant
- Moore, K., “SMTP Service Extension for Delivery Status Notifications”, RFC 1891, Jan. 1996.Applicant
- Myers, J. et al., “Post Office Protocol—Version 3”, RFC 1939, May 1996.Applicant
- Nielsen, H., et al., “An HTTP Extension Framework”, RFC 2774, Feb. 2000.Applicant
- Postel, J., “Simple Mail Transfer Protocol”, RFC 821, Aug. 1982.Applicant
- Braden, R., “Requirements for Internet Hosts—Application and Support”, RFC 1123, Oct. 1989, 98 pages.Applicant
- Fielding, R. et al., “Hypertext Transfer Protocol—HTTP/1.1”, RFC 2616, Jun. 1999, 114 pages.Applicant
- Yuchun Tang, “Granular Support Vector Machines Based on Granular Computing, Soft Computing and Statistical Learning.” Georgia State University: May 2006.Applicant
- Drucker et al; “Support Vector Machines for Spam Categorization”; 1999; IEEE Transactions on Neural Networks; vol. 10, No. 5; pp. 1048-1054.Applicant
- Graf et al.; “Parallel Support Vector Machines: The Cascade SVM”; 2005; pp. 1-8.Applicant
- Rokach, Lior et al.; “Decomposition methodology for classification tasks”; 2005; Springer-Verlag London Limited; Pattern Analysis & Applications; pp. 257-271.Applicant
- Krishnaswamy et al—Verity: A QoS Metric for Selecting Web Services and Providers, Proceedings of the Fourth International Conference on Web Information Systems Engineering Workshops (WISEW'03), IEEE, 2004.Applicant
- Kamvar et al., The EigenTrust Algorithm for Reputation Management in P2P Networks, ACM, WWW2003, Budapest, Hungary, May 20-24, 2003, pp. 640-651.Applicant
- Luk, W., et al. “Incremental Development of Hardware Packet Filters”, Proc. International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA). Jan. 1, 2001. pp. 115-118. XP055049950. Retrieved from the Internet: URL:www.doc.ic.ac.uk/-sy99/c1.ps.Applicant
- Georgopoulos, C. et al., “A Protocol Processing Architecture Backing TCP/IP-based Security Applications in High Speed Networks”. Interworking 2000. Oct. 1, 2000. XP055049972. Bergen. Norway Available online at <URL:http://pelopas.uop.gr/-fanis/html—files/pdf—files/papers/invited/I2—IW2002.pdf>.Applicant
- “Network Processor Designs for Next-Generation Networking Equipment”. White Paper Ezchip Technologies. XX. XX. Dec. 27, 1999. pp 1-4. XP002262747.Applicant
- Segal, Richard, et al. “Spam Guru: An Enterprise Anti-Spam Filtering System”, IBM, 2004 (7 pages).Applicant
- Nilsson, Niles J., “Introduction to Machine Learning, an Early Draft of a Proposed Textbook”, Nov. 3, 1998; XP055050127; available online at <URL http://robotics.stanford.edu/˜nilsson/MLBOOK. pdf >.Applicant
- Androutsopoulos, Ion et al., “Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach”; Proceedings of the Workshop “Machine Learning and Textual Information Access”; 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD-2000). Sep. 1, 2000 [XP055050141] Lyon, France; available online at <URL http://arxiv.org/ftp/cs/papers/0009/0009009.pdf>.Applicant
- Rennie, J D M, “iFile: An application of Machine Learning to E-Mail Filtering”; Workshop on Text Mining; Aug. 1, 2000. [XP002904311]. pp. 1-6.Applicant
- Ando, Ruo, “Real-time neural detection with network capturing”, Study report from Information Processing Society of Japan, vol. 2002, No. 12, IPSJ SIG Notes, Information Processing Society of Japan, 2002, Feb. 15, 2002, p. 145-150.Applicant
- Aikawa, Narichika, “Q&A Collection: Personal computers have been introduced to junior high schools and accessing to the Internet has been started; however, we want to avoid the students from accessing harmful information. What can we do?”, DOS/V Power Report, vol. 8, No. 5, Japan, Impress Co., Ltd., May 1, 1998, p. 358 to 361.Applicant
- Shishibori, Masami, et al., “A Filtering Method for Mail Documents Using Personal Profiles”, IEICE Technical Report, The Institute of Electronics, Information and Communication Engineers, vol. 98, No. 486, Dec. 17, 1998, pp. 9-16.Applicant
- Sobottka, K., et al., “Text Extraction from Colored Book and Journal Covers”, 2000 (pp. 163-176).Applicant
- Thomas, R., et al., “The Game Goes On: An Analysis of Modern SPAM Techniques,” 2006.Applicant
- IronMail™ Version 2.1, User's Manual. © 2001, published by CipherTrust, Inc., 114 pages.Applicant
- IronMail™ version 2.5, User's Manual, © 2001, published by CipherTrust, Inc., 195 pages.Applicant
- IronMail™ version 2.5.1, User's Manual, © 2001, published by CipherTrust, Inc., 203 pages.Applicant
- IronMail™ version 3.0, User's Manual, © 2002, published by CipherTrust, Inc., 280 pages.Applicant
- IronMail™ version 3.0.1, User's Manual, © 2002, published by CipherTrust, Inc., 314 pages.Applicant
- IronMail™ version 3.1, User's Manual, published by CipherTrust, Inc., 397 pages.Applicant
- Website: Exchange Business Information Safely & Quickly—Without Compromising Security or Reliability—Atabok Secure Data Solutions, Feb. 19, 2002, 2 pages.Applicant
- Wang, Jigang et al.; “Training Data Selection for Support Vector Machines”; 2005; ICNC 2005, LNCS 3610; pp. 554-564.Applicant
- Skurichina, Marina et al.; Bagging, Boosting and the Random Subspace Method for Linear Classifiers; 2002; Springer-Verlag London Limited; pp. 121-135.Applicant
- Tao, Dacheng et al.; “Asymmetric Bagging and Random Subspace for Support Vector Machines-Based Relevance Feedback in Image Retrieval”; 2006; IEEE Computer Society; pp. 1088-1099.Applicant
- Kotsiantis, S. B. et al.; “Machine learning: a review of classification and combining techniques”; 2006; Springer; Artificial Intelligence Review; pp. 159-190.Applicant
- Kane, Paul J. et al. “Quantification of Banding, Streaking and Grain in Flat Field Images”, 2000.Applicant
- Kim, JiSoo et al. “Text Locating from Natural Scene Images Using Image Intensities”, 2005 IEEE.Applicant
- Gupta, et al., “A Reputation System for Peer-to-Peer Networks,” ACM (2003) Golbeck, et al., “Inferring Reputation on the Semtnatic Web,” ACM, 2004.Applicant
- Abika.com, “Trace IP address, email or IM to owner or user” http://www.abika.com/help/IPaddressmap.htm, 3 pp. (Jan. 25, 2006).Applicant
- Abika.com, “Request a Persons Report”, http://www.abika.com/forms/Verifyemailaddress.asp, 1 p. (Jan. 26, 2006).Applicant
- Lough et al., “A Short Tutorial on Wireless LANs and IEEE 802.11”, printed on May 27, 2002, in the IEEE Computer Society's Student Newsletter, Summer 1997, vol. 5, No. 2.Applicant
- Golbeck, et al., “Inferring Reputation on the Semtantic Web,” ACM, 2004.Applicant
- Blum, Richard, Open Source E-Mail Security, SAMS XP009166200, ISBN 978-0-672-32237-2, Oct. 20, 2001 (pp. 139-158).Applicant
- Clayton, Richard, “Good Practice for Combating Unsolicited Bulk Email,” Demon Internet, May 18, 1999 (16 pages).Applicant
- Okumura, Motonobu, “E-Mail Filtering by Relation Learning”, IEICE Technical Report, vol. 103, No. 603, The Institute of Electronics, Information and Communication Engineers, Jan. 19, 2004, vol. 103, p. 1-5 [English Abstract Only].Applicant
- Inoue, Naomi, “Computer and Communication: Recent State of Filtering Software,” ISPJ Magazine, vol. 40, No. 10, Japan, The Institute of Electronics, Information and Communication Engineers, Oct. 15, 1999, vol. 40 p. 1007-1010 [English Abstract Only].Applicant
- Australian Patent Office Examination Report in Australian Patent Application Serial No. 2005304883 mailed on Apr. 16, 2010.Applicant
- Canadian Patent Office Action in Canadian Patent Application Serial No. 2586709 mailed on Mar. 20, 2013.Applicant
- China, State Intellectual Property Office, P.R. China, First Office Action in Chinese Patent Application Serial No. 20050046047 mailed on Mar. 1, 2010.Applicant
- China, State Intellectual Property Office, P.R. China, Second Office Action in Chinese Patent Application Serial No. 20050046047 mailed on Dec. 7, 2010.Applicant
- China, State Intellectual Property Office, P.R. China, Decision on Rejecton in Chinese Patent Application Serial No. 20050046047 mailed on Jun. 27, 2011.Applicant
- European Patent Office Supplementary Search Report and Written Opinion in EP Application Serial No. 05823134.1 mailed on Jun. 3, 2013.Applicant
- Japanese Patent Office Action in JP Application No. 2007-540073 dated Jul. 7, 2011 (with uncertified translation).Applicant
- PCT International Search Report and Written Opinion in PCT Application Serial No. PCT/US2005/039978 mailed on Jul. 8, 2008.Applicant
- PCT International Preliminary Report on Patentability in PCT Application Serial No. PCT/US2005/039978 mailed on May 5, 2009.Applicant
- China, State Intellectual Property Third Office Action in Chinese Patent Application Serial No. 200580046047 mailed on Aug. 30, 2013.Applicant
- Wu, Ching-Tung, et al., “Using Visual Features for Anti-Spam Filtering,” Image Processing, 2005. ICIP 2005, IEEE International Conference on vol. 3, IEEE 2005.Applicant
- Davis, C., et al., “A Means for Expressing Location Information in the Domain Name System,” RFC 1876, Jan. 1996.Applicant