The claimed subject matter relates to enterprise data leakage protection (DLP), and more particularly, to decrypting encrypted files in order to provide data leakage protection (DLP).
To ensure that confidential data will not leak out through a means of electronic communication, for example, the Internet, enterprises use a data leakage protection (DLP) mechanism to check for confidential data in their outbound communication contents. See Check Point DLP Software Blade produced by Check Point Software Technologies Ltd.
To conduct the DLP checkup thoroughly, it is necessary to decrypt encrypted files whenever the encrypted files are discovered in communication contents. Related prior art discloses attempting to decrypt encrypted files by a brute-force attack, though this approach is conceivably time-consuming. Furthermore, US Pub. 2012/0216046 discloses parsing text contents of emails to create a dictionary required for a brute-force attack.
It is an aspect of the claimed subject matter to provide techniques for collecting in advance passwords entered during a file encryption procedure performed at a terminal within an enterprise network, storing the passwords collected, creating a password list, and attempting to decrypt according to the password list whenever it is necessary to decrypt encrypted files, so as to perform a DLP checkup within the enterprise network.
Most of the encrypted files to be sent out of an enterprise network have already undergone a file encryption procedure performed at a terminal within the enterprise network. Hence, the aforesaid techniques enhance the accuracy of passwords greatly and dispenses with the hassle of attempting to decrypt indiscriminately by a brute-force attack.
Another aspect of the claimed subject matter is to provide techniques for creating a short list of collected passwords in contrast with a dictionary for use in a brute-force attack to thereby solve a problem, that is, passwords which are conceivable by business users and adapted for use in encryption within an enterprise network are relatively scarce. Conceivably, in the course or attempting to decrypt, a DLP checkup conducted with a password list created in accordance with the claimed subject matter takes less time than one conducted with a dictionary according to the prior art; hence, the claimed subject matter shortens the duration of service interruption and thus enables a real-time DLP checkup.
Yet another aspect of the claimed subject matter is to provide techniques whereby passwords entered by users are efficiently identified by monitoring a specific application (such as 7-Zip or Microsoft Word) executed at a terminal within an enterprise network and a file encryption procedure performed by means of the application. In so doing, the techniques of the claimed subject matter dispense with the hassle of monitoring all the operations performed or data entered by users at the terminal all the time. Hence, the techniques of the claimed subject matter not only prevent privacy infringement, but also reduce the required system resources greatly.
The techniques of the claimed subject matter provides, in an embodiment thereof, techniques for collecting decrypting passwords for encrypted files within an enterprise network. The techniques comprise:
The claimed subject matter provides, in another embodiment thereof, techniques for decrypting an encrypted file within an enterprise network. The techniques comprise:
The claimed subject matter provides, in another embodiment thereof, techniques for decrypting an encrypted file within an enterprise network. The techniques comprise:
The claimed subject matter further provides, in yet another embodiment thereof, an apparatus and a computer-readable medium or a computer program product for implementing the aforesaid techniques.
Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the claimed subject matter should be or are in any single embodiment of the claimed subject matter. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the claimed subject matter. Thus, discussion of the features and advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same embodiment.
Furthermore, the described features, advantages, and characteristics of the claimed subject matter may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the claimed subject matter may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the claimed subject matter.
The following description, the appended claims, and the embodiments of the claimed subject matter further illustrate the features and advantages of the claimed subject matter.
In order that the advantages of the claimed subject matter will be readily understood, a more particular description of the claimed subject matter briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the claimed subject matter and are not therefore to he considered to be limiting of its scope, the claimed subject matter will be described and explained with additional specificity and detail through the use of the accompanying drawings.
Reference throughout this specification to “one embodiment,” “an embodiment,” or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the claimed subject matter. Thus, appearances of the phrases “in one embodiment,” “in an embodiment,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.
As will be appreciated by one skilled in the art, the claimed subject matter may be embodied as an apparatus, a method or a computer program product. Accordingly, the claimed subject matter 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, the claimed subject matter may take the form of a computer program product embodied in any tangible medium of expression haying computer-usable program code embodied in the medium.
Any combination of one or more computer usable or computer readable medium(s) may be utilized. The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a non-exhaustive list) of the computer-readable 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 storage device, a transmission media such as those supporting the Internet or an intranet, or a magnetic storage device. Note that the computer-usable or computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-usable medium may include a propagated data signal with the computer-usable program code embodied therewith, either in baseband or as part of a carrier wave. The computer usable program code may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc.
Computer program code for carrying out operations of the claimed subject matter may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Small talk, 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 or server 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).
The claimed subject matter is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the claimed subject matter. 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 or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means 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 or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus 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.
Referring now to
<System Architecture>
Referring to
Details of password collecting module 30 and DLP module 40 are further illustrated with
<Password Collecting Module>
Password collecting module 30 is preferably provided in the form of software, for example, in the form of a daemon operating on terminal 20; the claimed subject matter is not restrictive thereof, as password collecting module 30 of the claimed subject matter can also be provided in the form of standalone hardware, such as an apparatus. Referring to
In this embodiment, password collecting module 30 communicates with the operating system (for example, the task manager in the Windows operating system) of terminal 20, so as to be informed of any application to be executed on the terminal 20.
Before this block, it is feasible to register, optionally, any concerned applications, especially any applications susceptible to an encryption procedure such as 7-Zip, Microsoft Word, WinRAR, and Microsoft Outlook, with password collecting module 30 beforehand; hence, password collecting module 30 can ignore those applications which are not registered, thereby saving system resources.
In this embodiment, password collecting module 30 is capable of detecting a processing process of the application or an action of a graphical user interface (GUI) object to thereby determine a procedure currently being performed by the application. For more information, make reference to Spy++ developed by Microsoft.
When performing a file encryption procedure, an application typically provides a specific user interface message or prompt and requests the user to enter a password. Hence, password collecting module 30 detects the specific user interface message or prompt to thereby determine a file encryption procedure currently being executed by the application.
In another embodiment, password collecting module 30 not only identifies passwords, but also identifies meta data related to the passwords, including, but not limited to, time and date of file encryption, application name, encrypted file format (such as a filename extension), hash value of an encrypted file, and to user ID for use in the login of the application. Password collecting module 30 sends the meta data and the passwords together to DLP module 40, such that the meta data and the passwords are stored in the password table PT, as shown in
<DLP Module>
Terminal 20, password collecting module 30, and DLP module 40 are disposed in enterprise network 10 and communicate with each other via the network-based connection, including a fixed LAN or WAN, or any means of connection other than wired connection and wireless connection, provided by enterprise network 10.
DLP module 40 is preferably provided in the form of an apparatus and integrated into an existing access point, router, switch, gateway, firewall device, proxy, or intrusion prevention system (IPS) device, for example.
DLP module 40 provided in the form of an apparatus comprises a memory 42 and a processor 44. Memory 42 is a computer magnetic disk, hard disk drive, random-access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), compact disk, optical storage device, or magnetic storage device. Memory 42 stores a program code and, for example, the password table PT shown in
In another embodiment, a plugin module for use with the application operates on terminal 20. For more information, refer to the operation principle of plugin modules for use with an existing Web browser or word processing software.
Referring to
In this block, if the password table PT contains multiple passwords, DLP module 40 will further tidy up and sort the password table PT. The password table PT in the embodiment illustrated with
In another embodiment, DLP module 40 calculates the degree of match between an encrypted file and each password according to a comparison of meta data of the encrypted file and meta data of each password collected by password collecting module 30, so as to determine the priority given to a decryption attempt. DLP module 40 determines the way of calculating the degree of match as needed, or adjusts the weight assigned to each item in the meta data for the purpose of calculating the degree of match, of which the claimed subject matter is not restrictive. For instance, DLP module 40 may assign a greater weight to file format than to user ID in calculating the degree of match.
The foregoing preferred embodiments are provided to illustrate and disclose the technical features of the claimed subject matter, and are not intended to be restrictive of the scope of the claimed subject matter. Hence, all equivalent variations or modifications made to the foregoing embodiments without departing from the spirit embodied in the disclosure of the claimed subject matter should fall within the scope of the claimed subject matter as set forth in the appended claims.
Number | Date | Country | Kind |
---|---|---|---|
101151161 A | Dec 2012 | TW | national |
The present application is a continuation and claims the benefit of the filing date of an application entitled, “Decrypting Files for Data Leakage Protection in an Enterprise Network” Ser. No. 14/142,155, filed Dec. 27, 2013, assigned to the assignee of the present application, and herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4827512 | Hirokawa | May 1989 | A |
5097118 | Iijima | Mar 1992 | A |
5584023 | Hsu | Dec 1996 | A |
5991402 | Jia et al. | Nov 1999 | A |
7526834 | Coleman | May 2009 | B2 |
7681048 | Starr | Mar 2010 | B2 |
7836310 | Gutnik | Nov 2010 | B1 |
7917946 | Lindholm et al. | Mar 2011 | B2 |
7991747 | Upadhyay | Aug 2011 | B1 |
8224796 | Shinde | Jul 2012 | B1 |
8438630 | Clifford | May 2013 | B1 |
8510369 | Ekke | Aug 2013 | B1 |
8542823 | Nguyen | Sep 2013 | B1 |
8726396 | Dodke | May 2014 | B1 |
8752180 | Barile | Jun 2014 | B2 |
8776249 | Margolin | Jul 2014 | B1 |
8918633 | Yoshihiro | Dec 2014 | B2 |
8943546 | Khetawat | Jan 2015 | B1 |
8948633 | Sasaki | Feb 2015 | B2 |
8984646 | Ohno | Mar 2015 | B2 |
9003475 | Jaiswal | Apr 2015 | B1 |
9081974 | Schumacher | Jul 2015 | B2 |
20030005322 | Kiiveri | Jan 2003 | A1 |
20030074567 | Charbonneau | Apr 2003 | A1 |
20030084279 | Campagna | May 2003 | A1 |
20030200459 | Seeman | Oct 2003 | A1 |
20050022012 | Bluestone et al. | Jan 2005 | A1 |
20050066167 | Asano | Mar 2005 | A1 |
20050086196 | Peterson | Apr 2005 | A1 |
20060059350 | Cantwell et al. | Mar 2006 | A1 |
20060206432 | Russell | Sep 2006 | A1 |
20070217609 | Sudo | Sep 2007 | A1 |
20080222631 | Bhatia et al. | Sep 2008 | A1 |
20100079571 | Hayashi | Apr 2010 | A1 |
20100082364 | Taub | Apr 2010 | A1 |
20100115614 | Barile | May 2010 | A1 |
20100125891 | Baskaran | May 2010 | A1 |
20100210126 | Everett | Aug 2010 | A1 |
20100268934 | Hinton et al. | Oct 2010 | A1 |
20110010550 | Sun | Jan 2011 | A1 |
20110083190 | Brown et al. | Apr 2011 | A1 |
20110239306 | Avni | Sep 2011 | A1 |
20120131336 | Price et al. | May 2012 | A1 |
20120137375 | Ramachandran et al. | May 2012 | A1 |
20120203880 | Kluyt et al. | Aug 2012 | A1 |
20120216046 | McDougal | Aug 2012 | A1 |
20120222110 | Huang et al. | Aug 2012 | A1 |
20130111219 | Avanch | May 2013 | A1 |
20130227280 | Quinlan | Aug 2013 | A1 |
20130238901 | Wise | Sep 2013 | A1 |
20130340031 | Amit | Dec 2013 | A1 |
20150074405 | Zucker | Mar 2015 | A1 |
Number | Date | Country |
---|---|---|
EP0526054 | Feb 1993 | GB |
4918638 | Apr 2012 | JP |
200522650 | Jul 2005 | TW |
200905516 | Feb 2009 | TW |
201030557 | Aug 2010 | TW |
2012109533 | Aug 2012 | WO |
Entry |
---|
SECAAS Implementation Guidance Catagory 2// Data Loss Prevention, Jul. 2012, pp. 1-22, Cloud Security Alliance, United States. |
Demystifying Data Loss Prevention, 2010, pp. 1-11, McAfee, Inc, United States. |
Code Green Networks, Integrating Data Loss Prevention & Email Encyption, 2011,pp. 1-2, Zixcorp, United States. |
Data Loss Prevention, White Paper, 2012, pp. 1-8, CDW, United States. |
Checkpoint Software Technologies, Inc; “Data Loss Prevention Software Blade,” downloaded from <https://www.checkpoint.com/products/dlp-software-blade/> on Mar. 3, 2016. |
Number | Date | Country | |
---|---|---|---|
20140344573 A1 | Nov 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14142155 | Dec 2013 | US |
Child | 14336216 | US |