The invention relates to computer data access control and privacy in general.
Many organizations maintain documents that include information, such as of a medical or financial nature, that is deemed sensitive and whose exposure to individuals is restricted by company policy, or even by law. Such organizations may employ document redaction software that removes sensitive information from documents before they are shown to individuals requesting access to such documents. Document redaction software typically removes sensitive information from documents automatically according to a set of predefined rules, such as where a rule dictates that a number that appears to be a credit card number be redacted from a document before it is provided to a recipient. Such rules may be further adapted based on the role of the recipient, such where a rule dictates that a credit card number be left in a document that is provided to an accounts receivable clerk and redacted from the document before the document is provided to recipients in other roles.
In one aspect of the invention a document redaction method is provided where the method includes identifying within a computer-based document stored on a non-transitory computer-readable medium, a candidate redaction element that is of a predefined redaction element type, identifying an evaluation element that is of a predefined evaluation element type and that is associated with the candidate redaction element, identifying a predefined logic expression that is associated with the redaction element type and that operates on the evaluation element type, evaluating the logic expression, thereby resulting in a value, identifying a predefined permission expression that is associated with the logic expression, that operates on the value, and that is associated with a recipient role, evaluating the permission expression, thereby identifying a redaction directive, and applying the redaction directive to the candidate redaction element within the computer-based document prior to the computer-based document being provided to a recipient having the recipient role.
Systems and computer-program products embodying the invention are also provided.
The term “document” as used herein refers to any data file that may be stored on a computer-readable data storage device, such as word processing files, database files, image files, audio files, etc.
The invention will be understood and appreciated more fully from the following detailed description taken in conjunction with the appended drawings in which:
The invention is now described within the context of one or more embodiments, although the description is intended to be illustrative of the invention as a whole, and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical data storage device, a magnetic data storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Reference is now made to
An evaluation element identifier 104 is configured to identify one or more evaluation elements that are associated with the candidate redaction element identified by redaction candidate identifier 100, where an evaluation element is of a predefined evaluation element type. Continuing with the previous example, evaluation element identifier 104 may be configured to identify a date that is associated with “Bob Smith,” such as his birth date, as an evaluation element. Evaluation element identifier 104 may identify evaluation elements within the same computer-readable document where a candidate redaction element is found. Additionally or alternatively, evaluation element identifier 104 may identify evaluation elements from other sources. For example, evaluation element identifier 104 may lookup Bob Smith's birth date from a database responsive to redaction candidate identifier 100 finding the name “Bob Smith” in a computer-readable document. Or evaluation element identifier 104 may lookup Bob Smith's birth date from the database responsive to finding another element associated with Bob Smith, such as a Social Security Number for Bob Smith, on the same computer-readable document where redaction candidate identifier 100 found “Bob Smith.” That is, for example, in one embodiment evaluation element identifier 104 associates a social security number to an adjacent (or at least proximate) personal name in a free text document. In another embodiment, there may be an external mapping (e.g., in a database between names and social security numbers, so that evaluation elements identifier 104 retrieves, for a name in a document, a social security number associated with the name according to that map.
An expression selector 106 is configured to identify one or more predefined logic expressions that are associated with redaction elements of the type identified by redaction candidate identifier 100 and that operate on evaluation elements of the type identified by evaluation element identifier 104. The predefined logic expressions may reside in a logic repository 108 stored on a computer-readable data storage device, and may include Boolean logic or other known logic. Continuing with the previous example, a logic expression may have been derived from a company policy or legal regulation that dictates that the name of an individual may or may not require redaction from a computer-based document based at least partly on the individual's age. As such, the logic expression is associated with redaction elements that are names and operates on dates that are birth dates. Expression selector 106 may thus identify the logic expression based on the candidate redaction element “Bob Smith” and his identified birth date as the evaluation element. Expression selector 106 is also preferably configured to evaluate the identified logic expression, where the evaluation results in (i.e., generates) one or more values. For example, where the logic expression defines a criteria concerning whether the age identified by evaluation element identifier 104 of the individual “Bob Smith” identified by candidate identifier 100 is less than 18 years old, the value generated by expression selector 106 may be “true” or “false.” In another example, where candidate identifier 100 indicates that a candidate redaction element type is a person's name and an associated logic expression indicates that the person has a birth date identified by evaluation element identifier 104, the value generated by expression selector 106 may be a name in the computer readable document of a person having that birth date, e.g., “Bob Smith.” In this case, expression selector 106 generates the specific candidate redaction element itself.
A permission selector 110 is configured to identify one or more predefined permission expressions responsive to a recipient role and the value resulting from the expression selector 106 evaluation of the logic expression. The predefined permission expressions may reside in a permission repository 112 stored on a computer-readable data storage device. Continuing with the previous example, permission selector 110 may be configured to identify a permission expression that is associated with the logic expression identified by expression selector 106, that operates on the value resulting from the evaluation of the logic expression, and that is associated with the recipient role “visiting nurse.” Permission selector 110 is also preferably configured to evaluate the permission expression, where the evaluation results in a redaction directive that determines whether or not the candidate redaction element is redacted from the computer-readable document. For example, the redaction directive may indicate that the candidate redaction element is to be allowed to remain unaltered within the document where the document recipient is a visiting nurse and the individual is 18 years old or older, or may indicate that the candidate redaction element is to be redacted from the document in accordance with conventional techniques where the individual is less than 18 years old.
A document processor 114 is configured to apply the redaction directive identified by permission selector 110 to the candidate redaction element within the computer-based document, whereupon the computer-based document may be provided to a recipient having the recipient role, such as to a visiting nurse as in the previous example. Document processor 114 may be configured to provide a redaction profile for human review, where the redaction profile for a candidate redaction element includes information regarding any of the elements, types, logic expressions, permission expressions, evaluation result values, redaction directives, roles, and recipients described hereinabove, enabling the reviewer to approve or disapprove of the application of the redaction directive to the computer-based document.
Any of the elements shown in
Reference is now made to
The system of
Referring now to
As shown, the techniques for controlling access to at least one resource may be implemented in accordance with a processor 410, a memory 412, I/O devices 414, and a network interface 416, coupled via a computer bus 418 or alternate connection arrangement.
It is to be appreciated that the term “processor” as used herein is intended to include any processing device, such as, for example, one that includes a CPU (central processing unit) and/or other processing circuitry. It is also to be understood that the term “processor” may refer to more than one processing device and that various elements associated with a processing device may be shared by other processing devices.
The term “memory” as used herein is intended to include memory associated with a processor or CPU, such as, for example, RAM, ROM, a fixed memory device (e.g., hard drive), a removable memory device (e.g., diskette), flash memory, etc. Such memory may be considered a computer readable storage medium.
In addition, the phrase “input/output devices” or “I/O devices” as used herein is intended to include, for example, one or more input devices (e.g., keyboard, mouse, scanner, etc.) for entering data to the processing unit, and/or one or more output devices (e.g., speaker, display, printer, etc.) for presenting results associated with the processing unit.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It will be appreciated that any of the elements described hereinabove may be implemented as a computer program product embodied in a computer-readable medium, such as in the form of computer program instructions stored on magnetic or optical storage media or embedded within computer hardware, and may be executed by or otherwise accessible to a computer (not shown).
While the methods and apparatus herein may or may not have been described with reference to specific computer hardware or software, it is appreciated that the methods and apparatus described herein may be readily implemented in computer hardware or software using conventional techniques.
While the invention has been described with reference to one or more specific embodiments, the description is intended to be illustrative of the invention as a whole and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
5619648 | Canale | Apr 1997 | A |
5664109 | Johnson | Sep 1997 | A |
5940843 | Zucknovich | Aug 1999 | A |
6052682 | Miller | Apr 2000 | A |
6161084 | Messerly | Dec 2000 | A |
6178439 | Feit | Jan 2001 | B1 |
6226635 | Katariya | May 2001 | B1 |
6330610 | Docter | Dec 2001 | B1 |
6336117 | Massarani | Jan 2002 | B1 |
6453327 | Nielsen | Sep 2002 | B1 |
6539371 | Bleizeffer et al. | Mar 2003 | B1 |
6640010 | Seeger et al. | Oct 2003 | B2 |
6820082 | Cook et al. | Nov 2004 | B1 |
6820237 | Abu-Hakima et al. | Nov 2004 | B1 |
6879977 | Huffman et al. | Apr 2005 | B2 |
6928618 | Kohls et al. | Aug 2005 | B2 |
6931403 | Agrawal et al. | Aug 2005 | B1 |
6952720 | Guedalia et al. | Oct 2005 | B2 |
7028049 | Shelton | Apr 2006 | B1 |
7181495 | Skladman et al. | Feb 2007 | B2 |
7194693 | Cragun et al. | Mar 2007 | B2 |
7206814 | Kirsch | Apr 2007 | B2 |
7243097 | Agrawal | Jul 2007 | B1 |
7293017 | Hurst-Hiller et al. | Nov 2007 | B2 |
7316032 | Tayebi | Jan 2008 | B2 |
7412605 | Raley | Aug 2008 | B2 |
7523135 | Bradford et al. | Apr 2009 | B2 |
7730010 | Kishore et al. | Jun 2010 | B2 |
7748027 | Patrick | Jun 2010 | B2 |
7752566 | Nelson | Jul 2010 | B1 |
7802305 | Leeds | Sep 2010 | B1 |
7805673 | der Quaeler | Sep 2010 | B2 |
7873838 | Staddon et al. | Jan 2011 | B2 |
20020165201 | Binderup et al. | Nov 2002 | A1 |
20040054918 | Duri | Mar 2004 | A1 |
20040061716 | Cheung et al. | Apr 2004 | A1 |
20040073461 | Pappas | Apr 2004 | A1 |
20040139043 | Lei et al. | Jul 2004 | A1 |
20040240735 | Medina | Dec 2004 | A1 |
20050140572 | Kahan | Jun 2005 | A1 |
20050283471 | Ahmed | Dec 2005 | A1 |
20060026159 | Dettinger | Feb 2006 | A1 |
20060031301 | Herz | Feb 2006 | A1 |
20060053097 | King | Mar 2006 | A1 |
20060136985 | Ashley | Jun 2006 | A1 |
20060156222 | Chi et al. | Jul 2006 | A1 |
20060259954 | Patrick | Nov 2006 | A1 |
20060259977 | Patrick | Nov 2006 | A1 |
20070030528 | Quaeler et al. | Feb 2007 | A1 |
20070094284 | Bradford et al. | Apr 2007 | A1 |
20070094594 | Matichuk et al. | Apr 2007 | A1 |
20070118534 | Hayes et al. | May 2007 | A1 |
20070192734 | Berstis et al. | Aug 2007 | A1 |
20070203776 | Austin | Aug 2007 | A1 |
20070239653 | Kiehn | Oct 2007 | A1 |
20070255704 | Baek | Nov 2007 | A1 |
20070271212 | Jones | Nov 2007 | A1 |
20070274478 | Crawford, III | Nov 2007 | A1 |
20070276649 | Schubert | Nov 2007 | A1 |
20080016341 | Staddon et al. | Jan 2008 | A1 |
20080016372 | Staddon et al. | Jan 2008 | A1 |
20080046757 | Staddon et al. | Feb 2008 | A1 |
20080052759 | Kronlund et al. | Feb 2008 | A1 |
20080072290 | Metzer | Mar 2008 | A1 |
20080204788 | Kelly et al. | Aug 2008 | A1 |
20080250021 | Boys | Oct 2008 | A1 |
20080320604 | Nakajima et al. | Dec 2008 | A1 |
20090037222 | Kuo | Feb 2009 | A1 |
20090089663 | Rebstock et al. | Apr 2009 | A1 |
20090094675 | Powers et al. | Apr 2009 | A1 |
20090132419 | Grammer et al. | May 2009 | A1 |
20090164878 | Cottrille | Jun 2009 | A1 |
20090164881 | Segarra et al. | Jun 2009 | A1 |
20090192941 | Fournier | Jul 2009 | A1 |
20090265316 | Poulin et al. | Oct 2009 | A1 |
20090276701 | Nurmi | Nov 2009 | A1 |
20090296166 | Schrichte | Dec 2009 | A1 |
20090299853 | Jones | Dec 2009 | A1 |
20090323087 | Luo | Dec 2009 | A1 |
20100010912 | Jones | Jan 2010 | A1 |
20100046015 | Whittle | Feb 2010 | A1 |
20100070396 | Schrichte | Mar 2010 | A1 |
20100082652 | Jones | Apr 2010 | A1 |
20100229246 | Warrington et al. | Sep 2010 | A1 |
20100241844 | Hussain et al. | Sep 2010 | A1 |
20110055932 | Fox et al. | Mar 2011 | A1 |
20110066606 | Fox et al. | Mar 2011 | A1 |
20110119361 | Issa et al. | May 2011 | A1 |
20110119576 | Aumann | May 2011 | A1 |
20110162084 | Fox et al. | Jun 2011 | A1 |
20110179352 | Treadwell et al. | Jul 2011 | A1 |
20110239113 | Hung et al. | Sep 2011 | A1 |
20110247081 | Shelton | Oct 2011 | A1 |
20120159296 | Rebstock et al. | Jun 2012 | A1 |
20120192066 | Fox et al. | Jul 2012 | A1 |
20120239380 | Cumby et al. | Sep 2012 | A1 |
20120304304 | Avrahami et al. | Nov 2012 | A1 |
20130117802 | Fendt | May 2013 | A1 |
20130144901 | Ho et al. | Jun 2013 | A1 |
20130151346 | Schoen | Jun 2013 | A1 |
20140136941 | Avrahami et al. | May 2014 | A1 |
Number | Date | Country |
---|---|---|
1077421 | Feb 2001 | EP |
1638032 | Mar 2006 | EP |
1818807 | Aug 2007 | EP |
2375353 | Oct 2011 | EP |
2375353 | Oct 2011 | EP |
2004252773 | Sep 2004 | JP |
2006026159 | Mar 2006 | WO |
2006041318 | Apr 2006 | WO |
WO2006041318 | Apr 2006 | WO |
2006104810 | Oct 2006 | WO |
WO2006104810 | Oct 2006 | WO |
WO2006104810 | Oct 2006 | WO |
WO2007044970 | Apr 2007 | WO |
WO2008005017 | Jan 2008 | WO |
2008122825 | Oct 2008 | WO |
WO2008122825 | Oct 2008 | WO |
Entry |
---|
Cumby, Chad M., and Rayid Ghani. “A Machine Learning Based System for Semi-Automatically Redacting Documents.” in IAAI. 2011. |
U.S. Appl. No. 12/648,413—Feb. 1, 2013—ResponseNonfinalRejection. |
PCT/IB2013/050355—May 3, 2013—InternationalSearchReportAndWrittenOpinion. |
U.S. Appl. No. 12/548,123—Jul. 5, 2013—FinalRejection. |
U.S. Appl. No. 12/648,413—Aug. 8, 2013—FinalRejection. |
Stolfo, et al., “PARULEL: Parallel Rule Processing Using Meta-rules for Redaction,” Department of Computer Science, Columbia University, New York, NY 10027, Jun. 25, 1991, pp. 1-47. |
Damiani, Ernesto et al., “A Fine-Grained Access Control System for XML Documents,” SCM Transactions on Information and System Security, vol. 5, No. 2, May 2002, pp. 169-202. |
IBM, “Privacy for Instant-Message or Email Popups”, IP.Com, Mar. 16, 2009, https://priorart.ip.com/download/IPCOM000180738D/IPCOM000180738D.pdf. |
“Google Hacking,” Wikipedia, the Free Encyclopedia, (retrieved Jun. 16, 2010), http://en.wikipedia.org/wiki/Google—hacking. |
Rogers, G., “Googling Google: Google Gives Malware the Finger,” ZDNet, CBS Interactive, Inc., Aug. 4, 2006, (retrieved Jun. 16, 2010), http://www.zdnet.com/blog/google/google-gives-malware-the-finger/283. |
“Turn Desktop Alerts on or off,” Microsoft Office Support, Outlook 2007, downloaded Apr. 26, 2012, http://office.microsoft.com/en-us/outlook-help/turn-desktop-alerts-on-or-off-HA010098670.aspx. |
Kazem Taghva, et al., Information Science Research Institute University of Nevada, Las Vegas, “Identification and Redaction of Privacy Information in Scanned Documents,” The 5th International Conference on Information Technology and Applications (ICITA 2008). |
Wong, Alexander, et al., Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario, Canada, “Expert Knowledge Based Automatic Regions-of-Interest (ROI) Selection in Scanned Documents for Digital Image Encryption,” Proceedings of the 3rd Canadian Conference on Computer and Robot Vision (CRV'06). |
U.S. Appl. No. 12/559,720—Mar. 1, 2012—NonfinalRejection. |
U.S. Appl. No. 12/559,720—Jun. 1, 2012—ResponseToNonfinalRejection. |
U.S. Appl. No. 12/548,123—May. 8, 2012—NonfinalRejection. |
U.S. Appl. No. 12/559,720—Aug. 27, 2012—FinalRejection. |
U.S. Appl. No. 12/648,413—Sep. 27, 2012—NonfinalRejection. |
Bier, Eric, et al., “The Rules of redaction: identify, protect, review (and repeat),” Palo Alto Research Center, 2009 IEEE. |
Porat, Sara et al., “Masking gateway for enterprises,” IBM Haifa Research Lab, Spinger-Verlag Berlin Heidelberg 2009. |
IBM, “InfoSphere Guardium Data Redaction”, Solution Brief, IBM Software, Jul. 2012. |
Redact-It Overview, http://www.redact.com/overview, downloaded Feb. 10, 2012. |
U.S. Department of Energy Office of Science, The Office of Science Graduate Fellowship Program, “Resources for Handling Transcripts,” downloaded Sep. 30, 2012, http://scgf.orau.gov/transcripts-resources.html. |
ZyLAB, “Use Intelligent Redaction Tools to Secure Your Data”, downloaded on Sep. 24, 2012. |
U.S. Appl. No. 12/548,123—IL920090018US1—Oct. 8, 2012—ResponseNonfinalRejection. |
U.S. Appl. No. 12/548,123—IL920090018US1—Oct. 30, 2012—SupplementalResponse. |
U.S. Appl. No. 12/559,720—IL920090033US1—Dec. 27, 2012—ResponseToFinalRejection(RCE. |
Preliminary Remarks, dated Oct. 2, 2009, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 3 pgs. |
Office Action, dated May 8, 2012, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 19 pgs. |
Response to Office Action, dated Oct. 8, 2012, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 14 pgs. |
Supplemental Amendment, dated Oct. 30, 2012, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 6 pgs. |
Final Office Action, dated Jul. 5, 2013, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 14 pgs. |
Response to Final Office Action, dated Nov. 5, 2013, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 11 pages. |
OA3 for dated Dec. 20, 2013, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 13 pages. |
Response to Office Action, dated Apr. 4, 2014, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, entitled “Method for Detecting End Point of Plasma Etching and Plasma Etching Apparatus”, invented by Joshua Fox et al., Total 4 pages. |
Office Action, dated Mar. 1, 2012, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 32 pages. |
Response to Office Action, dated May 9, 2012, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 8 pgs. |
Supplemental Amendment, dated Jun. 1, 2012, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 19 pgs. |
Final Office Action, dated Aug. 27, 2012, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 34 pages. |
Response to Final Office Action, dated Dec. 27, 2012, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 21 pgs. |
Notice of Allowance, dated Jun. 20, 2014, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, entitled, “Search Engine With Privacy Protection”, invented by Joshua Fox et al., Total 15 pages. |
Preliminary Amendment, dated Mar. 27, 2012, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009,entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 6 pages. |
Office Action, dated Sep. 27, 2012, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 19 pages. |
Response to Office Action, dated Feb. 1, 2013, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 12 pages. |
Final Office Action, dated Aug. 8, 2013, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 34 pages. |
Response to Final Office Action, dated Nov. 8, 2013, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 15 pages |
Office Action, dated Dec. 5, 2013, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 37 pages. |
Response to Office Action, dated Apr. 4, 2014, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 14 pages. |
Preliminary Amendment, dated Mar. 27, 2012, for U.S. Appl. No. 13/431,032, filed Mar. 27, 2012, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 6 pages. |
Office Action, dated Mar. 7, 2014, for U.S. Appl. No. 13/431,032, filed Mar. 27, 2012, entitled, “Selecting Portions of Computer-Accessible Documents for Post-Selection Processing”, invented by Joshua Fox et al., Total 36 pages. |
International Search Report and Written Opinion, dated May 3, 2013, for International Application No. PCT/IB2013/050355, filed Jan. 15, 2013,Total 9 pages. |
Deguillaume, F. et al., “Protocols for Data-Hiding Based Text Document Security and Automatic Processing”, Downloaded on Sep. 22, 2009 from IEEE Xplore, Computer Science Department, CUI-University of Geneva, Total 12 pages. |
IBM Corporation, “InfoSphere Guardium Data Redaction”, dated Jul. 2012, Solution Brief, IBM Software, Total 6 pages. |
Taghva, K., et al., “Identification and Redaction of Privacy Information in Scanned Documents”, dated 2008, Information Science Research, Institute University of Nevada, Las Vegas, The 5th International Conference on Information Technology Applications, Total 8 pages. |
“Redact-It Overview”, (online), downloaded on Feb. 10, 2012 from URL>http://www.redact.com/overview, Total 3 pages. |
“Turn Desktop Alerts On or Off” (online) Microsoft Office Support, Outlook 2007, downloaded Apr. 26, 2012 at URL>http:office.microsoft.com/en-us/outlook-help/turn-desktop-alerts-on-or-offHA010098670.aspx, Total 4 pages. |
US Department of Energy Office of Science, The Office of Science Graduate Fellowship Program, “Resourses of Handling Transcripts”, downloaded Sep. 30, 2012, http://scgf.orau.gov/transcripts-resources.html, Total 3 pages. |
Wong, A. et al , “Expert Knowledge Based Automatic Regions-of-Interst (ROU) Selection in Scanned Documents for Digital Image Encryption”,Department of Electrical and Computer Engineering University of Waterloo, Ontario, Canada, Total 8 pages. |
ZyLAB, “Use Intelligent Redaction Tools to Secure Your Data”, retrieved from the Internet on Sep. 24, 2012 at URL>http:www.zylab.com/Solutions/Redact/Secure.aspx, Total 2 pages. |
Damiani et al. A Fine-Grained Access Control System for XML Documents, dated May 2002, ACM transactions on Information and System Security, vol. 6, pp. 169-202, document No. XP0026245587. |
U.S. Appl. No. 14/228,246, filed Mar. 26, 2014, entitled “Focused Personal Identifying Information Redaction”, invented by Joshua Fox et al, Total 27 pages. |
Wong, A. et al , “Expert Knowledge Based Automatic Regions-of-Interst (ROU) Selection in Scanned Documents for Digital Image Encryption”, dated 2006, Department of Electrical and Computer Engineering University of Waterloo, Ontario, Canada, Total 8 pages. |
“Document Technology Systems Redaction Overview”, Document Technology Systems, dated Apr. 28, 2006, (online) retrieved from the Internet at URL>http:www.dts-doc.com, Total 2 pages. |
“Intellidact Intelligent Redaction Software”, dated 2008, Computing Systems Innovations Inc., Total 2 pages. |
Notice of Allowance, dated Jan. 3015, for U.S. Appl. No. 12/559,720, filed Sep. 15, 2009, invented by Joshua Fox, total 10 pages. |
Final Office Action, dated Feb. 5, 2015, for U.S. Appl. No. 14/499,563, filed Sep. 15, 2014, invented by Joshua Fox, total 20 pages. |
Office Action, dated Mar. 26, 2015, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, invented by Joshua Fox, Total 15 pages. |
Response to Office Action, dated Jun. 22, 2015, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, invented by Joshua Fox, Total 7 pages. |
Response to Office Action, dated Apr. 28, 2015, for U.S. Appl. No. 13/676,712, filed Nov. 14, 2012, invented by Joshua Fox, Total 9 pages. |
Final Office Action, dated Jun. 10, 2015, for U.S. Appl. No. 13/676,712, filed on Nov. 14, 2012 by S. Avrahami et al., Total 25 pages. |
Notice of Allowance, dated Jun. 19, 2015, for U.S. Appl. No. 12/559,720, filed on Sep. 15, 2009, invented by Joshua Fox, Total 13 pages. |
Office Action, dated Apr. 10, 2015, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, invented by Joshua Fox, Total 45 pages. |
Response to Final Office Action, dated Apr. 28, 2015, for U.S. Appl. No. 13/431,032, filed Mar. 27, 2012, invented by Joshua Fox, Total 9 pages. |
Response to Office Action, dated Jul. 10, 2015, for U.S. Appl. No. 12/648,413, filed Dec. 29, 2009, invented by Joshua Fox , Total 14 pages. |
Office Action, dated Jul. 22, 2015, for U.S. Appl. No. 13/431,032, filed Mar. 27, 2012, invented by Joshua Fox, Total 30 pages. |
US Patent Application, dated Sep. 1, 2015, for U.S. Appl. No. 14/842,731, filed Sep. 1, 2015, invented by Joshua Fox, Total 38 pages. |
Final Office Action, dated Sep. 2, 2015, for U.S. Appl. No. 12/548,123, filed Aug. 26, 2009, invented by Joshua Fox, Total 14 pages. |
Number | Date | Country | |
---|---|---|---|
20130185634 A1 | Jul 2013 | US |