System, method and computer program product for obtaining a reputation associated with a file

Information

  • Patent Grant
  • 8701196
  • Patent Number
    8,701,196
  • Date Filed
    Friday, March 31, 2006
    18 years ago
  • Date Issued
    Tuesday, April 15, 2014
    10 years ago
Abstract
A reputation system, method and computer program product are provided. In use, a file associated with a first computer is identified. Thereafter, a reputation associated with the file stored at a second computer is obtained.
Description
FIELD OF THE INVENTION

The present invention relates to security applications, and more particularly to reputation rating systems.


BACKGROUND

Increasingly, computer systems have needed to protect themselves against undesirable code. Such undesirable computer code has generally taken the form of viruses, worms, Trojan horses, spyware, adware, and so forth. The damage and/or inconvenience capable of being incurred by these types of undesirable code has ranged from mild interference with a program, such as the display of an unwanted political message in a dialog box, to the complete destruction of contents on a hard drive, and even the theft of personal information.


Many mechanisms have been created in order to provide the much needed protection from such undesirable code and the affects thereof. For example, prior art systems are capable of identifying a “reputation” of a web site. This is traditionally accomplished by reviewing various files that are available from the site. If such files are determined to be free of malware, spyware, etc., the foregoing systems assume that the entity providing such content is “good” and can perhaps be trusted in other areas such as data accuracy, authenticity, etc. On the other hand, however, if the available files are determined to contain undesirable code that proves to be harmful or otherwise hinder normal computer operation, etc., the entity and associated site providing such files can be assumed to be “bad.”


Unfortunately, such prior art systems only provide the “reputation” of web sites, as opposed to individual files. Thus, the “good” or “bad” rating of files associated with a given on-line site is typically done manually by a computer user. For example, such user may either hear that a new music download site has files infected with spyware and, as a result, the user will not download such files. In more serious situations, such person may empirically learn of the “bad” nature of the files by personally downloading one or more of the files and becoming infected, a truly undesirable situation.


There is thus a need for overcoming these and/or other problems associated with the prior art.


SUMMARY

A reputation system, method and computer program product are provided. In use, a file associated with a first computer is identified. Thereafter, a reputation associated with the file stored at a second computer is obtained.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a network architecture, in accordance with one embodiment.



FIG. 2 shows a representative hardware environment that may be associated with the server computers and/or client computers of FIG. 1, in accordance with one embodiment.



FIG. 3 shows a method for obtaining a reputation associated with a file, in accordance with one embodiment.



FIG. 4 shows a method for generating a reputation database in an automated manner, in accordance with one embodiment.



FIG. 5 shows a method for using a reputation database, in accordance with one embodiment.



FIG. 6 shows a method for generating a reputation database in a distributed manner, in accordance with another embodiment.





DETAILED DESCRIPTION


FIG. 1 illustrates a network architecture 100, in accordance with one embodiment. As shown, a plurality of networks 102 is provided. In the context of the present network architecture 100, the networks 102 may each take any form including, but not limited to a local area network (LAN), a wireless network, a wide area network (WAN) such as the Internet, peer-to-peer network, etc.


Coupled to the networks 102 are server computers 104 which are capable of communicating over the networks 102. Also coupled to the networks 102 and the server computers 104 is a plurality of client computers 106. Such server computers 104 and/or client computers 106 may each include a desktop computer, lap-top computer, hand-held computer, mobile phone, hand-held computer, peripheral (e.g. printer, etc.), any component of a computer, and/or any other type of logic. In order to facilitate communication among the networks 102, at least one gateway 108 is optionally coupled therebetween.



FIG. 2 shows a representative hardware environment that may be associated with the server computers 104 and/or client computers 106 of FIG. 1, in accordance with one embodiment. Such figure illustrates a typical hardware configuration of a workstation in accordance with one embodiment having a central processing unit 210, such as a microprocessor, and a number of other units interconnected via a system bus 212.


The workstation shown in FIG. 2 includes a Random Access Memory (RAM) 214, Read Only Memory (ROM) 216, an I/O adapter 218 for connecting peripheral devices such as disk storage units 220 to the bus 212, a user interface adapter 222 for connecting a keyboard 224, a mouse 226, a speaker 228, a microphone 232, and/or other user interface devices such as a touch screen (not shown) to the bus 212, communication adapter 234 for connecting the workstation to a communication network 235 (e.g., a data processing network) and a display adapter 236 for connecting the bus 212 to a display device 238.


The workstation may have resident thereon any desired operating system. It will be appreciated that an embodiment may also be implemented on platforms and operating systems other than those mentioned. One embodiment may be written using JAVA, C, and/or C++ language, or other programming languages, along with an object oriented programming methodology. Object oriented programming (OOP) has become increasingly used to develop complex applications.


Our course, the various embodiments set forth herein may be implemented utilizing hardware, software, or any desired combination thereof. For that matter, any type of logic may be utilized which is capable of implementing the various functionality set forth herein.



FIG. 3 shows a method 300 for obtaining a reputation associated with a file, in accordance with one embodiment. As an option, the method 300 may be implemented in the context of the architecture and environment of FIGS. 1 and/or 2. Of course, however, the method 300 may be carried out in any desired environment.


As shown, in operation 301, a file associated with a first computer is identified. In the context of the present description, a file may refer to a text file, a word processing file, a spreadsheet file, a picture file, an executable file, a script file, a library file, a control file, a component of a file, and/or any other collection of data and/or code capable of having a reputation as will soon be set forth. Still yet, the first computer may refer to a client or server computer (e.g. see, for example, computers 102 and 104 of FIG. 1, etc.), and/or any desired device. Even still, the aforementioned association between the file and computer may refer to the fact that the file is stored in memory of the computer, the file is controlled/managed by the computer, and/or any other desired association.


Of course, the file may be identified in any desired manner. Just by way of example, the file may be identified upon being selected for downloading and/or opening (e.g. during the course of an on-access scan, etc.), during the course of an on-demand scan, and/or by any other technique that results in the identification of the file.


To this end, a reputation associated with the file stored at a second computer may be obtained. See operation 302. Similar to the first computer, the second computer may refer to a client or server computer (e.g. see, for example, computers 102 and 104 of FIG. 1, etc.), and/or any desired device, as long as the second computer is separate from the first computer. In the context of the present description, the term reputation may refer to any information relating to any characteristic or trait associated with the file. More information regarding one exemplary way the reputation may be obtained in the spirit of the present embodiment will be set forth during reference to FIG. 5.


In one optional embodiment, the reputation may be obtained utilizing a database identifying a plurality of files and a reputation associated with each of the files. Of course, such database may be situated on any desired computer (e.g. the aforementioned second computer, etc.). In another embodiment, the reputation may even be obtained from a computer that is the same as that associated with the file. Thus, during use, the database is accessible by a computer attempting to download the file, and/or otherwise identifies the same.


Of course, the database may be generated in any desired manual and/or automated manner. Just by way of example, an Internet-crawling technique may be employed. Still yet, in other embodiments, each file may first be identified at a particular computer during the use thereof, such that a reputation associated with the file may be determined and stored at another computer. More information regarding such ways of building a reputation database will be set forth during reference to FIGS. 4 and 6.


Again, more illustrative information will now be set forth regarding various optional architectures and features with which the foregoing technique may or may not be implemented, per the desires of the user. It should be strongly noted that the following information is set forth for illustrative purposes and should not be construed as limiting in any manner. Any of the following features may be optionally incorporated with or without the exclusion of other features described.



FIG. 4 shows a method 400 for generating a reputation database in an automated manner, in accordance with one embodiment. As an option, the method 400 may be implemented in the context of the architecture and environment of FIGS. 1-2. Of course, however, the method 400 may be carried out in any desired environment. It should also be noted that the aforementioned definitions may apply during the present description.


As shown, in operation 402, a network (e.g. the Internet, etc.) may be crawled in the search of sites (e.g. web sites, etc.) with files stored in associated therewith. Of course, this may be accomplished in any desired manner. Just by way of example, one or more search agents may search the network for different sites and process the same in the following manner. To this end, a plurality of files associated with a plurality of sites on a network are inspected.


Specifically, in decision 404, it is first determined whether a site is found. If so, a file stored at the site is retrieved. See operation 406. Such retrieval may be effected by downloading the file to a computer (e.g. see, for example, computers 102 and 104 of FIG. 1, etc.) other than that on which the site resides, for the purpose of executing the following operations. Of course, other embodiments are contemplated whereby such downloading is not necessary and the following operations are performed at the site.


With continuing reference to FIG. 4, such processing includes the scanning and/or use of the file, as set forth in operation 408. The present scanning may involve the comparison of the file with a plurality of signatures, patterns, etc. that are known to be associated with at least potentially undesirable characteristics. Of course, such undesirable characteristics may be indicative of any at least potentially undesirable code including, but not limited to malware (e.g. viruses, worms, Trojan horses, etc.) spyware, adware, spam, etc. Of course, any other processing may be employed that is capable of identifying at least one undesirable characteristic associated with the file (if it exists).


In addition to or instead of the aforementioned scanning, the file may also be used to determine whether any undesirable characteristic is exhibited. Such use may take the form of simply opening the file, executing the file in an isolated environment, and/or any other type of use that is capable of prompting the file to exhibit an undesirable characteristic (again, if it exists).


It should be strongly noted that additional techniques may be employed other than the above scanning and use. Just by way of example, any type of emulation, heuristics, loading, etc. may be employed. Still yet, other techniques may be utilized as a function of a type of the file. For example, in the case of a compressed file (e.g. a file in a ZIP format, etc.), the file may first be decompressed, etc.


To this end, it may be determined in decision 410 as to whether any undesirable characteristics are exhibited. If so, the file may be identified as having at least a potentially “bad” reputation. On the other hand, if it is determined in decision 410 that undesirable characteristics are not exhibited in association with an instant file, it may be determined in decision 414 as to whether any additional files exist with respect to the current site.


If it is determined in decision 414 that at least one additional file exists with respect to the current site, the operations 406-410 may be repeated, as necessary. To this end, if each of the files are scanned and/or used, and no undesirable characteristics are exhibited per decision 410, each file (and potentially the entire site) may be identified as having at least a potentially “good” reputation. Conversely, if at least one of the files associated with the site is determined to have the bad reputation, at least the file exhibiting the undesirable characteristic (and/or all of the files of the site) may be designated with such negative reputation. Thus, in one embodiment (shown in FIG. 4), the existence of at least one bad file may result in the entire site (and associated files) as having a bad reputation. Of course, however, in other embodiments, each file may be individually given a good or bad reputation.


Next, in operation 418, results of the foregoing operations may be stored in a database. In one embodiment, such database may include a remote central database which may or may not be distributed among a plurality of servers, etc. Of course, other embodiments are envisioned where the database is stored locally.


Of course, the identification of the appropriate reputation may be implemented in any desired manner. Just by way of example, Table 1 illustrates one exemplary data structure that may be used in association with the foregoing database.














TABLE 1










File name_l
Good_Reputation





File name_2
Bad_Reputation





File name_3
Good_Reputation





File name_4
Bad_Reputation





File name_5
Good_Reputation










Such data structure, of course, should not be construed as limiting in any manner. For example, more than two possible reputations may be contemplated, thereby providing more granularity as to file reputation. Further, the files may be identified using additional file-related information including, but not limited to a time stamp, file size, hash (e.g. checksum, etc.), and/or any other desired file attribute.


With the foregoing database populated, the database may be used in a situation where the file is subsequently opened and/or used, for enhancing security. More information will now be set forth regarding one exemplary method of use of the database in such manner.



FIG. 5 shows a method 500 for using a reputation database, in accordance with one embodiment. As an option, the method 500 may be implemented in the context of the architecture and environment of FIGS. 1-4. Of course, however, the method 500 may be carried out in any desired environment. Again, the aforementioned definitions may equally apply during the present description.


As shown, it is determined, in decision 502, whether a file is to be (or has been) downloaded over a network. While a downloading scenario is described herein, it should be noted that the file may be identified in response to any attempt to obtain, open, use, execute, etc. the file. As shown, in decision 502, the method 500 polls until such identification is made.


Upon it being determined that a file is to be (or has been) downloaded over the network, per decision 502, the file is looked up in a remote database. See operation 504. Such remote database may, in one embodiment, take the form of that set forth during reference to Table 1 above, and may further be generated in accordance with FIG. 4. To accomplish the functionality of the present method 500, an agent may be loaded onto each computer on which protection is desired, where such agent is capable of the present operations as is further equipped with the location of the remote database.


Once the look-up is complete, it may be determined whether the file has a good or bad rating. See decision 508. If the file has a good rating, the file may simply be opened by the user without further intervention. Note operation 514. Of course, the file may optionally be subjected to supplementary scanning, etc. prior to opening in operation 514.


On the other hand, if it is determined, in decision 508, that the file has a bad rating, it may then be determined whether a policy associated with the computer, network, and/or user downloading the file is prohibited from accessing files with such bad reputation. See operation 510. If so, the method 500 may be restarted without opening the file. In various embodiments, the policy may be set by an administrator and/or be user-configurable per the desires of the user.


If, in contrast, the policy does not necessarily prohibit access to files with a bad reputation, the user may be simply notified of the reputation. See operation 512. To this end, the user may make a manual determination as to whether the file is safe to open. In addition to or instead of such notification, additional scanning, etc. may be carried out, for security purposes. Of course, any desired response (or lack thereof) may be employed as function of both the policy and the bad or good reputation.


By this design, in one example of use, a may user observe, through a rating display interface or the like, that the file being downloaded may have previously done harm to another computer, in which case the user may wish to abort or clean the file before use and/or execution. Still yet, upon determining such condition, the user may be inhibited from completing or using the download via the aforementioned policy, thus providing a way for an enterprise to protect employees with policy-based actions, etc.


Alternatively, when a good rating is found, the user may be able to proceed in downloading, opening, saving, running, etc. the file. In summary, in the case of a good rating, the user may feel safer using the referenced file; and, in the case of a bad rating, the user may be discouraged or even inhibited from using the referenced file.



FIG. 6 shows a method 600 for generating a reputation database in a distributed manner, in accordance with one embodiment. As an option, the method 600 may be implemented in the context of the architecture and environment of FIGS. 1-5 and, in particular, be used instead of or in conjunction with the method 400 of FIG. 4, for building a reputation database. Of course, however, the method 600 may be carried out in any desired environment. Yet again, the aforementioned definitions may equally apply during the present description.


As shown, an initial set of operations 601 may each be carried out utilizing an agent loaded onto a computer where one or more files are being accessed, used, etc. While only one set of operations 601 is shown in FIG. 6, it should be noted that such set of operations 601 may be carried out on a plurality of separate computers. To this end, such set of computers may feed a service provider which, in turn, processes results of such sets of operations 601 during the course of a subsequent set of operations 609, in a manner that will soon be set forth.


In particular, one or more files are monitored at the one or more computers. Note operation 602. It should be noted that such monitoring may refer to any of the aforementioned processing (e.g. see, for example, operation 408 of FIG. 4, etc.) that is capable of identifying undesirable characteristics. See decision 606.


If, at any time, any undesirable characteristics are found in association with any one or more files, information relating to such processing may be sent to a service provider. Note operation 608. In one embodiment, such service provider may include MCAFEE, INC. Further, it should be noted that the information may include an identification of the file along with the undesirable characteristics and/or a determination as to whether the file has a good or bad reputation, etc. (depending on where such determination is to take place).


Thus, in operation 610, the service provider may receive such information from a plurality of different computers for aggregation purposes. By aggregating the information, such information may be compared and/or correlated in order to provide a more certain determination regarding the reputation thereof. See operation 612. Thus, such overall reputation may, in turn, be sent to a remote database. Of course, the computer (e.g. server, etc.) on which the service provider operates may or may not be that on which the database resides.


Thus, in one example of use, a “community rating system” may be provided to augment or replace the aforementioned automatic download-and-detect method described during reference to FIG. 4. Here, in one embodiment, a software agent running on a computer may indicate a user experience with a downloaded file; if the downloaded file eventually demonstrates undesirable characteristics (e.g. found through experience to contain harmful malware of any type, etc.). In such case, the user is able to automatically or manually submit such findings in a controlled manner to a central service provider and a related network reputation database, thus providing additional indicators that are used to ultimately determine the rating of a given file.


In one embodiment, terrorism may be countered utilizing the aforementioned technology. According to the U.S. Federal Bureau of Investigation, cyber-terrorism is any “premeditated, politically motivated attack against information, computer systems, computer programs, and data which results in violence against non-combatant targets by sub-national groups or clandestine agents.” A cyber-terrorist attack is designed to cause physical violence or extreme financial harm. According to the U.S. Commission of Critical Infrastructure Protection, possible cyber-terrorist targets include the banking industry, military installations, power plants, air traffic control centers, and water systems. Thus, by optionally incorporating the present technology into the cyber-frameworks of the foregoing potential targets, terrorism may be countered by identifying code as including malware, etc., which may be used to combat cyber-terrorism.


While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. For example, any of the network elements may employ any of the desired functionality set forth hereinabove. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims
  • 1. A method, comprising: identifying a file associated with a first computer;obtaining an overall reputation associated with the file stored at a second computer, wherein the overall reputation comprises at least one characteristic associated with the file that includes undesirable code identified through a scanning activity, and wherein the overall reputation is determined by receiving information on the reputation of the file from each of a plurality of computers and aggregating the information received from each of the plurality of computers to produce the overall reputation associated with the file, and wherein the information on the reputation of the file received from each of the plurality of computers is based upon a respective determination of a reputation of the file by each of the plurality of computers; andidentifying a policy, wherein an agent provisioned in the first computer prohibits downloading of the file based on whether the reputation complies with configurable reputation settings provided in the policy, and wherein the policy is configured for indicating that additional scanning is to be carried out based on the reputation of the file.
  • 2. The method of claim 1, wherein the overall reputation associated with the file is determined automatically by inspecting a plurality of files associated with a plurality of sites on a network.
  • 3. The method of claim 2, wherein a plurality of the reputations associated with the plurality of files are stored in a database at the second computer, from which the overall reputation is obtained.
  • 4. The method of claim 1, wherein the overall reputation associated with the file is determined based on an identification of an undesirable characteristic during at least one of scanning and using the file.
  • 5. The method of claim 1, wherein information on the overall reputation associated with the file is identified at a third computer during use of the file.
  • 6. The method of claim 1, wherein the overall reputation is obtained by looking up the overall reputation in a central database.
  • 7. A non-transitory computer-readable medium, comprising one or more instructions that when executed on a processor configure the processor to: identify a file associated with a first computer;obtain an overall reputation associated with the file stored at a second computer, wherein the overall reputation comprises at least one characteristic associated with the file that includes undesirable code identified through a scanning activity, and wherein the overall reputation is determined by receiving information on the reputation of the file from each of a plurality of computers and aggregating the information received from each of the plurality of computers to produce the overall reputation associated with the file, and wherein the information on the reputation of the file received from each of the plurality of computers is based upon a respective determination of a reputation of the file by each of the plurality of computers; andidentify a policy, wherein an agent provisioned in the first computer prohibits downloading of the file based on whether the reputation complies with configurable reputation settings provided in the policy, and wherein the policy is configured for indicating that additional scanning is to be carried out based on the reputation of the file.
  • 8. The computer-readable medium of claim 7, wherein the reputation includes at least one of a good reputation and a bad reputation.
  • 9. The computer-readable medium of claim 8, wherein the policy is set by an administrator and indicates that the access to the file with the bad reputation is prohibited based on the policy.
  • 10. The computer-readable medium of claim 7, wherein the policy further indicates that the file should be executed in an isolated environment to determine if any undesirable characteristic is exhibited by the file.
  • 11. The computer-readable medium of claim 7, wherein the policy further indicates that the file should be emulated to determine if any undesirable characteristic is exhibited by the file.
  • 12. The computer-readable medium of claim 7, wherein the overall reputation associated with the file is determined automatically by inspecting a plurality of files associated with a plurality of sites on a network.
  • 13. The computer-readable medium of claim 12, wherein a plurality of the reputations associated with the plurality of files are stored in a database at the second computer, from which the overall reputation is obtained.
  • 14. The computer-readable medium of claim 7, wherein the overall reputation associated with the file is determined based on an identification of an undesirable characteristic during at least one of scanning and using the file.
  • 15. The computer-readable medium of claim 7, wherein information on the overall reputation associated with the file is identified at a third computer during use of the file.
  • 16. The computer-readable medium of claim 7, wherein the file is identified in response to an attempt to download the file over a network.
  • 17. The computer-readable medium of claim 7, wherein the overall reputation is obtained by looking up the overall reputation in a central database.
  • 18. An apparatus, comprising: a processor operable to execute computer program instructions; anda memory coupled to the processor and operable to store computer program instructions executable by the processor such that the system is configured to:identify a file associated with a first computer;obtain an overall reputation associated with the file stored at a second computer, wherein the overall reputation comprises at least one characteristic associated with the file that includes undesirable code identified through a scanning activity, and wherein the overall reputation is determined by receiving information on the reputation of the file from each of a plurality of computers and aggregating the information received from each of the plurality of computers to produce the overall reputation associated with the file, and wherein the information on the reputation of the file received from each of the plurality of computers is based upon a respective determination of a reputation of the file by each of the plurality of computers; andidentify a policy, wherein an agent provisioned in the first computer prohibits downloading of the file based on whether the reputation complies with configurable reputation settings provided in the policy, and wherein the policy is configured for indicating that additional scanning is to be carried out based on the reputation of the file.
  • 19. The apparatus of claim 18, wherein the overall reputation associated with the file is determined automatically by inspecting a plurality of files associated with a plurality of sites on a network.
  • 20. The apparatus of claim 19, wherein a plurality of the reputations associated with the plurality of files are stored in a database at the second computer, from which the overall reputation is obtained.
  • 21. The apparatus of claim 18, wherein the overall reputation associated with the file is determined based on an identification of an undesirable characteristic during at least one of scanning and using the file.
  • 22. A system, comprising: a first computer configured to identify a file associated with the first computer; anda second computer configured to provide an overall reputation associated with the file stored at the second computer to the first computer, wherein the overall reputation comprises at least one characteristic associated with the file that includes undesirable code identified through a scanning activity, and wherein the overall reputation is determined by receiving information on the reputation of the file from each of a plurality of computers and aggregating the information received from each of the plurality of computers to produce the overall reputation associated with the file, and wherein the information on the reputation of the file received from each of the plurality of computers is based upon a respective determination of a reputation of the file by each of the plurality of computers; andwherein the first computer is further configured to identify a policy, wherein an agent provisioned in the first computer prohibits downloading of the file based on whether the reputation complies with configurable reputation settings provided in the policy, and wherein the policy is configured for indicating that additional scanning is to be carried out based on the reputation of the file.
  • 23. The system of claim 22, wherein the overall reputation associated with the file is determined automatically by inspecting a plurality of files associated with a plurality of sites on a network.
  • 24. The system of claim 23, wherein a plurality of the reputations associated with the plurality of files are stored in a database at the second computer, from which the overall reputation is obtained.
  • 25. The system of claim 22, wherein the overall reputation associated with the file is determined based on an identification of an undesirable characteristic during at least one of scanning and using the file.
US Referenced Citations (186)
Number Name Date Kind
5274819 Blomfield-Brown Dec 1993 A
5742763 Jones Apr 1998 A
5870559 Leshem et al. Feb 1999 A
5892904 Atkinson et al. Apr 1999 A
5949419 Domine et al. Sep 1999 A
5978917 Chi Nov 1999 A
5987610 Franczek et al. Nov 1999 A
6018724 Arent Jan 2000 A
6065055 Hughes et al. May 2000 A
6073142 Geiger et al. Jun 2000 A
6219786 Cunningham et al. Apr 2001 B1
6285999 Page Sep 2001 B1
6321334 Jerger et al. Nov 2001 B1
6356937 Montville et al. Mar 2002 B1
6366912 Wallent et al. Apr 2002 B1
6367012 Atkinson et al. Apr 2002 B1
6460050 Pace et al. Oct 2002 B1
6539430 Humes Mar 2003 B1
6606659 Hegli et al. Aug 2003 B1
6647400 Moran Nov 2003 B1
6658394 Khaishgi et al. Dec 2003 B1
6708205 Sheldon et al. Mar 2004 B2
6742128 Joiner May 2004 B1
6748422 Morin et al. Jun 2004 B2
6772345 Shetty Aug 2004 B1
6785732 Bates et al. Aug 2004 B1
6826697 Moran Nov 2004 B1
6856963 Hurwitz Feb 2005 B1
6886102 Lyle Apr 2005 B1
6907533 Sorkin et al. Jun 2005 B2
6938003 Harpale Aug 2005 B2
7003734 Gardner et al. Feb 2006 B1
7024630 Himmel et al. Apr 2006 B2
7084760 Himberger et al. Aug 2006 B2
7096493 Liu Aug 2006 B1
7100122 Blaschke et al. Aug 2006 B2
7114177 Rosenberg et al. Sep 2006 B2
7136875 Anderson et al. Nov 2006 B2
7143139 Burbeck et al. Nov 2006 B2
7171470 Doyle et al. Jan 2007 B2
7207480 Geddes Apr 2007 B1
7216360 Nakao et al. May 2007 B2
7231395 Fain et al. Jun 2007 B2
7254573 Burke Aug 2007 B2
7257549 Karaoguz et al. Aug 2007 B2
7313691 Bantz et al. Dec 2007 B2
7370188 Rothman et al. May 2008 B2
7380267 Arai et al. May 2008 B2
7506155 Stewart et al. Mar 2009 B1
7562304 Dixon et al. Jul 2009 B2
7603718 Rounthwaite et al. Oct 2009 B2
7634810 Goodman et al. Dec 2009 B2
7694135 Rowan et al. Apr 2010 B2
7756930 Brahms et al. Jul 2010 B2
7765481 Dixon et al. Jul 2010 B2
7809650 Bruesewitz et al. Oct 2010 B2
7822620 Dixon et al. Oct 2010 B2
7831611 Roberts et al. Nov 2010 B2
7831915 Averbuch et al. Nov 2010 B2
8065720 Ebrahimi et al. Nov 2011 B1
8296664 Dixon et al. Oct 2012 B2
8321791 Dixon et al. Nov 2012 B2
8429545 Dixon et al. Apr 2013 B2
8438499 Dixon et al. May 2013 B2
20010007098 Hinrichs et al. Jul 2001 A1
20010011284 Humpleman et al. Aug 2001 A1
20010014164 Daniels et al. Aug 2001 A1
20010027450 Shinoda et al. Oct 2001 A1
20010029532 Kato et al. Oct 2001 A1
20010042931 Anderson et al. Nov 2001 A1
20010044744 Rhoads Nov 2001 A1
20010044809 Parasnis et al. Nov 2001 A1
20010044901 Grawrock Nov 2001 A1
20010054152 Nakao et al. Dec 2001 A1
20010056550 Lee Dec 2001 A1
20020012443 Rhoads et al. Jan 2002 A1
20020019831 Wade Feb 2002 A1
20020046041 Lang Apr 2002 A1
20020052934 Doherty May 2002 A1
20020059364 Coulthard et al. May 2002 A1
20020069129 Akutsu et al. Jun 2002 A1
20020103801 Lyons Aug 2002 A1
20020138402 Zacharia et al. Sep 2002 A1
20020143885 Ross Oct 2002 A1
20020178381 Lee et al. Nov 2002 A1
20020180778 Proudler Dec 2002 A1
20020194483 Wenocur et al. Dec 2002 A1
20020198950 Leeds Dec 2002 A1
20020199120 Schmidt Dec 2002 A1
20030018585 Butler et al. Jan 2003 A1
20030023878 Rosenberg et al. Jan 2003 A1
20030055737 Pope et al. Mar 2003 A1
20030055962 Freund et al. Mar 2003 A1
20030088577 Thurnhofer et al. May 2003 A1
20030097591 Pham et al. May 2003 A1
20030158888 Bjorklund et al. Aug 2003 A1
20030172166 Judge et al. Sep 2003 A1
20030182421 Faybishenko et al. Sep 2003 A1
20030220912 Fain et al. Nov 2003 A1
20040006532 Lawrence et al. Jan 2004 A1
20040059705 Wittke et al. Mar 2004 A1
20040088369 Yeager et al. May 2004 A1
20040093506 Grawrock et al. May 2004 A1
20040107363 Monteverde Jun 2004 A1
20040122926 Moore et al. Jun 2004 A1
20040123117 Berger Jun 2004 A1
20040123157 Alagna et al. Jun 2004 A1
20040143753 Hernacki et al. Jul 2004 A1
20040148281 Bates et al. Jul 2004 A1
20040153414 Khaishgi et al. Aug 2004 A1
20040153512 Friend Aug 2004 A1
20040167980 Doyle et al. Aug 2004 A1
20040168121 Matz Aug 2004 A1
20040169678 Oliver Sep 2004 A1
20040199606 Brown et al. Oct 2004 A1
20040205173 Hall Oct 2004 A1
20040205354 Gabriel et al. Oct 2004 A1
20040210602 Hillis et al. Oct 2004 A1
20040250115 Gemmel et al. Dec 2004 A1
20050005111 Brebner et al. Jan 2005 A1
20050015506 Padborg Jan 2005 A1
20050022018 Szor Jan 2005 A1
20050033991 Crane Feb 2005 A1
20050044423 Mellmer et al. Feb 2005 A1
20050052998 Oliver et al. Mar 2005 A1
20050071684 Sorkin et al. Mar 2005 A1
20050076222 Olkin et al. Apr 2005 A1
20050091514 Fukumoto et al. Apr 2005 A1
20050114709 Moore et al. May 2005 A1
20050165680 Keeling et al. Jul 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050216454 Diab et al. Sep 2005 A1
20050235343 Stephens Oct 2005 A1
20050240576 Piscitello et al. Oct 2005 A1
20050251756 Tamaki Nov 2005 A1
20050256866 Lu et al. Nov 2005 A1
20060004713 Korte et al. Jan 2006 A1
20060009994 Hogg et al. Jan 2006 A1
20060015722 Rowan et al. Jan 2006 A1
20060041508 Pham et al. Feb 2006 A1
20060069618 Milener et al. Mar 2006 A1
20060095404 Adelman et al. May 2006 A1
20060095586 Adelman et al. May 2006 A1
20060106866 Green et al. May 2006 A1
20060106914 Plow et al. May 2006 A1
20060117389 Pool Jun 2006 A1
20060123478 Rehfuss et al. Jun 2006 A1
20060174343 Duthie et al. Aug 2006 A1
20060179157 Huang Aug 2006 A1
20060212925 Shull et al. Sep 2006 A1
20060218403 Sauve et al. Sep 2006 A1
20060235796 Johnson et al. Oct 2006 A1
20060239430 Gue et al. Oct 2006 A1
20060242026 Crespo et al. Oct 2006 A1
20060253458 Dixon et al. Nov 2006 A1
20060253578 Dixon et al. Nov 2006 A1
20060253579 Dixon et al. Nov 2006 A1
20060253580 Dixon et al. Nov 2006 A1
20060253581 Dixon et al. Nov 2006 A1
20060253582 Dixon et al. Nov 2006 A1
20060253583 Dixon et al. Nov 2006 A1
20060253584 Dixon et al. Nov 2006 A1
20060265417 Amato et al. Nov 2006 A1
20060282795 Clark et al. Dec 2006 A1
20070028291 Brennan et al. Feb 2007 A1
20070028304 Brennan Feb 2007 A1
20070039038 Goodman et al. Feb 2007 A1
20070074125 Platt et al. Mar 2007 A1
20070083929 Sprosts et al. Apr 2007 A1
20070088652 Firmage et al. Apr 2007 A1
20070118898 Morgan et al. May 2007 A1
20070130350 Alperovitch et al. Jun 2007 A1
20070203884 Nichols et al. Aug 2007 A1
20080028029 Hart Jan 2008 A1
20080109473 Dixon et al. May 2008 A1
20080114709 Dixon et al. May 2008 A1
20080134084 Clark et al. Jun 2008 A1
20080162225 Malcolm Jul 2008 A1
20080250159 Wang et al. Oct 2008 A1
20090089287 Roberts et al. Apr 2009 A1
20090258253 Hinoue et al. Oct 2009 A1
20090281905 Walton Nov 2009 A1
20100042931 Dixon et al. Feb 2010 A1
20120185942 Dixon et al. Jul 2012 A1
20120311705 Dixon et al. Dec 2012 A1
20130014020 Dixon et al. Jan 2013 A1
Foreign Referenced Citations (12)
Number Date Country
WO 9949380 Sep 1999 WO
WO 0155873 Aug 2001 WO
WO 0155905 Aug 2001 WO
WO 03049403 Jun 2003 WO
WO 03079214 Sep 2003 WO
WO 2004061703 Jul 2004 WO
WO 2005010649 Feb 2005 WO
WO 2005033978 Apr 2005 WO
WO 2005043351 May 2005 WO
WO 2005043416 May 2005 WO
WO 2005043417 May 2005 WO
WO 2006020095 Feb 2006 WO
Non-Patent Literature Citations (223)
Entry
Siteadvisor, http://www.siteadvisor.com/.
Office Action Summary from U.S. Appl. No. 11/905,330 mailed on Dec. 30, 2009.
Final Office Action Summary from U.S. Appl. No. 11/342,319 mailed on Jan. 22, 2010.
Office Action Summary from U.S. Appl. No. 11/342,250 mailed on Feb. 26, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,322 mailed on Mar. 1, 2010.
Final Office Action Summary from U.S. Appl. No. 11/837,067 mailed on Mar. 1, 2010.
Office Action Summary from U.S. Appl. No. 11/837,050 mailed on Sep. 2, 2009.
Final Office Action Summary from U.S. Appl. No. 11/342,318 mailed on Sep. 21, 2009.
Office Action Summary from U.S. Appl. No. 11/342,322 mailed on Oct. 16, 2009.
Office Action Summary from U.S. Appl. No. 11/342,297 mailed on Dec. 28, 2009.
Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Jan. 12, 2010.
Office Action Summary from U.S. Appl. No. 11/342,343 mailed on Jan. 13, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,250 mailed on Dec. 2, 2009.
U.S. Appl. No. 60/588,570, filed Jul. 16, 2004.
U.S. Appl. No. 60/633,464, filed Dec. 6, 2004.
“Advertisement,” Dictionary.com, http://dictionary.reference.com/browse/advertisement, Feb. 11, 2010.
Notice of Allowance from U.S. Appl. No. 11/905,330 mailed on Apr. 30, 2010.
Final Office Action Summary from U.S. Appl. No. 11/837,050 mailed on Apr. 7, 2010.
U.S. Appl. No. 11/281,963, filed Nov. 16, 2005.
Non-Final Office Action Summary from U.S. Appl. No. 11/281,963 mailed on Nov. 13, 2007.
Non-Final Office Summary from U.S. Appl. No. 11/281,963 mailed on Dec. 2, 2008.
Final Office Action Summary from U.S. Appl. No. 11/281,963 mailed on Jun. 10, 2008.
Non-Final Office Summary from U.S. Appl. No. 11/281,963 mailed on Jun. 2, 2009.
Office Action Summary from U.S. Appl. No. 11/281,963 mailed on Mar. 8, 2010.
U.S. Appl. No. 11/852,948, filed Sep. 10, 2007.
Non-Final Office Action Summary from U.S. Appl. No. 11/852,948 mailed on Oct. 7, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,297 mailed on Jul. 9, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,297 mailed on Mar. 17, 2009.
Notice of Allowance from U.S. Appl. No. 11/342,297 mailed on May 26, 2010.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,319 mailed on Sep. 17, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,319 mailed on Mar. 16, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,319 mailed on Aug. 25, 2009.
Advisory Action Summary from U.S. Appl. No. 11/342,319 mailed on Apr. 21, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,250 mailed on Dec. 16, 2008.
Advisory Action Summary from U.S. Appl. No. 11/342,250 mailed on Feb. 25, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,250 mailed on May 28, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,250 mailed on Jun. 20, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,343 mailed on Jul. 14, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,318 mailed on Aug. 18, 2008.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,318 mailed on Mar. 26, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,318 mailed on Mar. 27, 2008.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Jan. 23, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Jan. 24, 2008.
Advisory Action Summary from U.S. Appl. No. 11/342,342 mailed on Nov. 12, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Jul. 22, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Aug. 20, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,320 mailed on May 5, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,320 mailed on Dec. 11, 2008.
Notice of Allowance from U.S. Appl. No. 11/342,320 mailed on Mar. 4, 2009.
Notice of Allowability from U.S. Appl. No. 11/342,320 mailed on Apr. 27, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,322 mailed on Sep. 18, 2008.
Final Office Action Summary from U.S. Appl. No. 11/342,322 mailed on May 15, 2009.
Advisory Action Summary from U.S. Appl. No. 11/342,322 mailed on Aug. 10, 2009.
Non-Final Office Action Summary from U.S. Appl. No. 11/837,067 mailed on Jun. 12, 2009.
Final Office Action Summary from U.S. Appl. No. 11/837,067 mailed on Dec. 31, 2008.
Non-Final Office Action Summary from U.S. Appl. No. 11/837,067 mailed on Jul. 12, 2010.
Non-Final Office Action Summary from U.S. Appl. No. 11/837,067 mailed on Jun. 17, 2008.
U.S. Appl. No. 11/342,250, filed Jan. 26, 2006.
U.S. Appl. No. 11/837,050, filed Aug. 10, 2007.
U.S. Appl. No. 11/342,343, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,297, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,318, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,319, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,320, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,322, filed Jan. 26, 2006.
U.S. Appl. No. 11/342,342, filed Jan. 26, 2006.
U.S. Appl. No. 12/502,158, filed Jul. 13, 2009.
U.S. Appl. No. 11/905,330, filed Sep. 28, 2007.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,322 mailed on Sep. 22, 2010.
Non-Final Office Action Summary from U.S. Appl. No. 11/342,319 mailed on Sep. 13, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,342 mailed on Jul. 26, 2010.
Non-Final Office Action Summary from U.S. Appl. No. 11/837,050 mailed on Aug. 18, 2010.
Final Office Action Summary from U.S. Appl. No. 11/342,250 mailed on Sep. 17, 2010.
Final Office Action Summary from U.S. Appl. No. 11/852,948 mailed on May 26, 2010.
Notice of Allowance form U.S. Appl. No. 11/342,318, dated Feb. 23, 2010.
Bowman, W., The Uniform Computer Information Transactions Act: A Well Built Fence or Barbed Wire Around the Intellectual Commons?, LBJ Journal of Public Affairs, Spring 2001, vol. XIII, pp. 80-91, USA; retrieved form http://uts.cc.utexas.edu/˜lbjjpa/2001/bowman.pdf on Feb. 16, 2011.
Dean et al., DIMACS Workshop on theft in E-Commerce: Content, Identity, and Service, Apr. 14-15, 2005, pp. 1-7, DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ, USA; retrieved from http://dimacs.rutgers.edu/Workshops/Intellectual/abstracts.html on Feb. 16, 2011.
International Search Report and Written Opinion from International Application No. PCT/US06/17335, mailed Nov. 29, 2007.
International Preliminary Report on Patentability from International Application No. PCT/US06/17335, dated Nov. 6, 2007.
International Search Report and Written Opinion from International Application No. PCT/US06/17333, mailed Aug. 18, 2008.
International Preliminary Report on Patentability from International Application No. PCT/US2006/017333, dated Mar. 17, 2009.
International Search Report and Written Opinion from International Application No. PCT/US06/17334, mailed Sep. 25, 2007.
International Preliminary Report on Patentability from International Application No. PCT/US2006/017334, dated Nov. 6, 2007.
Response to Non-Final Action dated Apr. 15, 2011 in U.S. Appl. No. 11/342,250 filed on Jul. 15, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,050 filed on Jul. 12, 2011.
Non-Final Office Action in U.S. Appl. No. 11/837,067 mailed on Jun. 23, 2011.
Response to Non-Final Office Action dated Apr. 14, 2011 in U.S. Appl. No. 12/502,158 filed on Jul. 14, 2011.
Response to Final Office Action dated May 15, 2009 in U.S. Appl. No. 11/342,322 filed on Jul. 15, 200.
Non-Final Office Action in U.S. Appl. No. 11/342,322 mailed on Sep. 2, 2011.
Non-Final Office Action in U.S. Appl. No. 11/342,319 mailed on Sep. 7, 2011.
Response to Non-Final Office Action dated Jun. 9, 2011 in U.S. Appl. No. 11/342,343 filed on Sep. 9, 2011.
Finjan SecureBrowsing™,“Browse fearlessly,” Finjan, Inc. (1996-2007), 2 pages.
Friendster, Inc. “Welcome to Friendster,” www.friendster.com, Copyright 2002-2005, (2 pages).
“How PGP works,” copyright 1990-1999 Networks Associates, Inc., available online at http://www.pgpi.org/doc/pgpintro/.
Response to Non-Final Office Action dated Nov. 13, 2007 in U.S. Appl. No. 11/281,963 filed on Feb. 13, 2008.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/281,963 filed on Sep. 17, 2008.
Response to Non-Final Office Action mailed Dec. 2, 2008 in U.S. Appl. No. 11/281,963 filed on Mar. 2, 2009.
Response to Non-Final Office Action dated Jun. 2, 2009 in U.S. Appl. No. 11/281,963 filed on Sep. 2, 2009.
Notice of Appeal in U.S. Appl. No. 11/281,963 filed on Jul. 8, 2010.
Appeal Brief in U.S. Appl. No. 11/281,963 filed on Feb. 8, 2011.
Examiner's Answer to Appellant's Appeal Brief dated Feb. 8, 2011 in U.S. Appl. No. 11/281,963 mailed on Apr. 28, 2011.
Notice of Appeal in U.S. Appl. No. 11/852,948 filed on Oct. 26, 2010.
Appeal Brief in U.S. Appl. No. 11/852,948 filed on Feb. 23, 2011.
Examiner's Answer to Appellant's Feb. 23, 2011 Appeal Brief in U.S. Appl. No. 11/852,948 mailed on May 13, 2011.
Response to Final Office Action dated Dec. 16, 2008 in U.S. Appl. No. 11/342,250 filed on Feb. 17, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,250 filed on Mar. 16, 2009.
Response to Non-Final Office Action dated May 28, 2009 in U.S. Appl. No. 11/342,250 filed on Aug. 28, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,250 filed on Feb. 2, 2010.
Non-Final Office Action in U.S. Appl. No. 11/342,250 mailed on Feb. 26, 2010.
Response to Non-Final Office Action dated Feb. 26, 2010 in U.S. Appl. No. 11/342,250 filed on Jun. 28, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,250 filed on Feb. 17, 2011.
Non-Final Office Action in U.S. Appl. No. 11/342,250 mailed on Apr. 15, 2011.
Response to Non-Final Office Action dated Sep. 2, 2009 in U.S. Appl. No. 11/837,050 filed on Jan. 4, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,050 filed on Jul. 7, 2010.
Response to Non-Final Office Action dated Aug. 18, 2010 in U.S. Appl. No. 11/837,050 filed on Feb. 28, 2011.
Final Office Action in U.S. Appl. No. 11/837,050 mailed on May 12, 2011.
U.S. Appl. No. 11/837,067, filed Aug. 10, 2007.
Response to Non-Final Office Action dated Jun. 17, 2008 in U.S. Appl. No. 11/837,067 filed on Sep. 17, 2008.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,067 filed on Mar. 30, 2009.
Response to Non-Final Office Action dated Jun. 12, 2009 in U.S. Appl. No. 11/837,067 filed on Nov. 12, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,067 filed on Jun. 1, 2010.
Response to Non-Final Office Action dated Jul. 12, 2010 in U.S. Appl. No. 11/837,067 filed on Jan. 12, 2011.
Final Office Action in U.S. Appl. No. 11/837,067 mailed on Apr. 1, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,067 filed on Jun. 1, 2011.
Response to Non-Final Office Action dated May 5, 2008 in U.S. Appl. No. 11/342,320 filed on Sep. 5, 2008.
Response to Final Office Action dated Dec. 11, 2008 in U.S. Appl. No. 11/342,320 filed on Feb. 11, 2009.
312 Amendment in U.S. Appl. No. 11/342,320 filed on Jun. 4, 2009.
Non-Final Office Action in U.S. Appl. No. 12/502,158 mailed on Apr. 14, 2011.
Response to Non-Final Office Action dated Mar. 27, 2008 in U.S. Appl. No. 11/342,318 filed on May 22, 2008.
Pre-Brief Conference Request and Notice of Appeal in U.S. Appl. No. 11/342,318 filed on Nov. 18, 2008.
Pre-Brief Conference Decision in U.S. Appl. No. 11/342,318 mailed on Dec. 11, 2008.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,318 filed on Feb. 18, 2009.
Response to Non-Final Office Action dated Mar. 26, 2009 in U.S. Appl. No. 11/342,318 filed on Jun. 26, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,318 filed on Jan. 21, 2010.
Response to Non-Final Office Action dated Jan. 24, 2008 in U.S. Appl. No. 11/342,342 filed on Apr. 10, 2008.
Response to Final Office Action dated Jul. 22, 2008 in U.S. Appl. No. 11/342,342 filed on Sep. 17, 2008.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,342 filed on Nov. 24, 2008.
Response to Non-Final Office Action dated Jan. 23, 2009 in U.S. Appl. No. 11/342,342 filed on May 26, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/34,342 filed on Dec. 21, 2009.
Response to Non-Final Office Action dated Jan. 12, 2010 in U.S. Appl. No. 11/342,342 filed on May 12, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,342 filed on Jan. 26, 2011.
Response to Non-Final Office Action dated Sep. 18, 2008 in U.S. Appl. No. 11/342,322 filed on Dec. 18, 2008.
Notice to Applicant regarding Non-Compliant Amendment in U.S. Appl. No. 11/342,322 mailed on Jan. 16, 2009.
Response to Notice dated Jan. 16, 2009 in U.S. Appl. No. 11/342,322 filed on Feb. 17, 2009.
Response to Final Office Action dated May 15, 2009 in U.S. Appl. No. 11/342,322 filed on Jul. 15, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,322 filed on Aug. 12, 2009.
Response to Non-Final Office Action dated Oct. 16, 2009 in U.S. Appl. No. 11/342,322 filed on Jan. 19, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,322 filed on Jun. 1, 2010.
Response to Non-Final Office Action dated Sep. 22, 2010 in U.S. Appl. No. 11/342,322 filed on Feb. 22, 2011.
Final Office Action in U.S. Appl. No. 11/342,322 mailed on Mar. 21, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,322 filed on May 23, 2011.
Response to Non-Final Office Action dated Jul. 9, 2008 in U.S. Appl. No. 11/342,297 filed on Dec. 9, 2008.
Notice of Appeal in U.S. Appl. No. 11/342,297 filed on Jun. 17, 2009.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,297 filed on Nov. 17, 2009.
Response to Non-Final Office Action dated Dec. 28, 2009 in U.S. Appl. No. 11/342,297 filed on Apr. 28, 2010.
Non-Final Office Action in U.S. Appl. No. 11/342,297 mailed on Sep. 24, 2010.
Response to Non-Final Office Action dated Sep. 17, 2008 in U.S. Appl. No. 11/342,319 filed on Dec. 17, 2008.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,319 filed on Jun. 16, 2009.
Response to Non-Final Office Action dated Aug. 25, 2009 in U.S. Appl. No. 11/342,319 filed on Dec. 28, 2009.
Response to Final Office Action dated Jan. 22, 2010 in U.S. Appl. No. 11/342,319 filed on Mar. 22, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,319 filed on Apr. 22, 2010.
Notice of Appeal in U.S. Appl. No. 11/342,319 filed on Feb. 23, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,319 filed on Apr. 25, 2011.
Response to Non-Final Office Action dated Jan. 13, 2010 in U.S. Appl. No. 11/342,343 filed on May 13, 2010.
Notice to Applicant regarding Non-Responsive/Non-Compliant Amendment in U.S. Appl. No. 11/342,343 mailed on May 19, 2010.
Response to Notice dated May 19, 2010 filed in U.S. Appl. No. 11/342,343 filed on Jun. 11, 2010.
Non-Final Office Action in U.S. Appl. No. 11/342,343 mailed on Jun. 9, 2011.
Response to Non-Final Office Action dated Dec. 30, 2009 in U.S. Appl. No. 11/905,330, filed Mar. 30, 2010.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,250 filed on Nov. 30, 2012.
Notice of Allowance in U.S. Appl. No. 11/837,050 mailed on Nov. 27, 2012.
Response to Non-Final Office Action dated Jul. 24, 2012 in U.S. Appl. No. 11/342,322 filed on Oct. 24, 2012.
Response to Non-Final Office Action dated Jul. 24, 2012 in U.S. Appl. No. 11/342,319 filed on Oct. 24, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,250 filed on Feb. 8, 2012.
Non-Final Office Action in U.S. Appl. No. 11/342,250 mailed on Feb. 23, 2012.
Response to Non-Final Office Action dated Nov. 25, 2011 in U.S. Appl. No. 11/837,050 filed on Feb. 24, 2012.
Final Office Action in U.S. Appl. No. 11/837,050 mailed on Mar. 19, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,067 filed on Jan. 17, 2012.
Notice of Allowance in U.S. Appl. No. 11/837,067 mailed on Mar. 7, 2012.
Request for Continued Examination in U.S. Appl. No. 11/837,067 filed on Mar. 23, 2012.
U.S. Appl. No. 13/431,873, filed Mar. 27, 2012, entitled System Method, and Computer Program Product for Presenting an Indicia of Risk Associated with Search Results within a Graphical User Interface, Inventors, Christopher John Dixon et al.
Response to Non-Final Office Action dated Nov. 28, 2011 in U.S. Appl. No. 12/502,158 filed on Feb. 27, 2012.
Response to Non-Final Office Action dated Sep. 22, 2011 in U.S. Appl. No. 11/342,342 filed on Dec. 22, 2011.
Non-Final Office Action in U.S. Appl. No. 11/342,342 mailed on Mar. 2, 2012.
Final Office Action in U.S. Appl. No. 11/342,322 mailed on Jan. 26, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,322 filed on Mar. 26, 2012.
Response to Non-Final Office Action dated Sep. 7, 2011 in U.S. Appl. No. 11/342,319 filed on Dec. 7, 2011.
Final Office Action in U.S. Appl. No. 11/342,319 mailed on Jan. 25, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,319 filed on Mar. 26, 2012.
Response to Non-Final Office Action dated Feb. 23, 2012 in U.S. Appl. No. 11/342,250 filed on May 14, 2012.
Final Office Action in U.S. Appl. No. 11/342,250 mailed on Aug. 30, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/837,050 filed on May 10, 2012.
Notice of Allowance in U.S. Appl. No. 11/837,050 mailed on Jun. 6, 2012.
Request for Continued Examination in U.S. Appl. No. 11/837,050 filed on Sep. 6, 2012.
U.S. Appl. No. 13/568,085, filed Aug. 6, 2012 and entitled “System, Method, and Computer Program Product for Presenting an Indica of Risk Reflecting an Analysis Associated with Search Results within a Graphical User Interface,” Christopher John Dixon et al. inventors.
Notice of Allowance in U.S. Appl. No. 11/837,067 mailed on Jun. 22, 2012.
Notice of Allowance in U.S. Appl. No. 12/502,158 mailed on May 30, 2012.
Request for Continued Examination in U.S. Appl. No. 12/502,158 filed on Aug. 30, 2012.
Notice of Allowance in U.S. Appl. No. 12/502,158 mailed on Oct. 9, 2012.
U.S. Appl. No. 13/621,037, filed Sep. 15, 2012 entitled “Indicating Website Reputations during Website Manipulation of User Information”, Inventors Christopher John Dixon et al.
Response to Non-Final Office Action dated Mar. 2, 2012 in U.S. Appl. No. 11/342,342 filed on Jun. 4, 2012.
Final Office Action in U.S. Appl. No. 11/342,342 mailed on Jul. 2, 2012.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,342 filed on Oct. 2, 2012.
Non-Final Office Action in U.S. Appl. No. 11/342,322 mailed on Jul. 24, 2012.
Non-Final Office Action in U.S. Appl. No. 11/342,319 mailed on Jul. 24, 2012.
Final Office Action in U.S. Appl. No. 11/342,250 mailed on Nov. 8, 2011.
Non-Final Office Action in U.S. Appl. No. 11/837,050 mailed on Nov. 25, 2011.
Response to Non-Final Office Action dated Jun. 23, 2011 in U.S. Appl. No. 11/837,067 filed on Sep. 23, 2011.
Final Office Action in U.S. Appl. No. 11/837,067 mailed on Nov. 17, 2011.
Notice of Allowance in U.S. Appl. No. 12/502,158 mailed on Sep. 27, 2011.
Request for Continued Examination in U.S. Appl. No. 12/502,158 filed on Nov. 7, 2011.
Non-Final Office Action in U.S. Appl. No. 12/502,158 mailed on Nov. 28, 2011.
Non-Final Office Action in U.S. Appl. No. 11/342,342 mailed on Sep. 22, 2011.
Response to Sep. 2, 2011 Non-Final Office Action in U.S. Appl. No. 11/342,322 filed on Dec. 1, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,343 filed on Jan. 14, 2011.
Final Office Action in U.S. Appl. No. 11/342,343 mailed on Sep. 26, 2011.
Request for Continued Examination and Amendment in U.S. Appl. No. 11/342,343 filed on Nov. 28, 2011.
Examiner Interview Summary in U.S. Appl. No. 11/342,343 mailed on Dec. 5, 2011.
Final Office Action in U.S. Appl. No. 11/342,319 mailed on Jan. 4, 2013.
Issue Notification in U.S. Appl. No. 11/837,050 mailed Apr. 3, 2013—Patent No. 8429545.
Non-Final Office Action in U.S. Appl. No. 13/621,037 mailed Dec. 31, 2012.
Notice of Publication in U.S. Appl. No. 13/621,037.
Notice of Allowance in U.S. Appl. No. 11/342,250 mailed on Jan. 10, 2013.
Final Office Action in U.S. Appl. No. 11/342,322 mailed on Jan. 4, 2013.
Related Publications (1)
Number Date Country
20130247129 A1 Sep 2013 US