The present disclosure relates to data security through application of multiple security measures.
Interpreted executable code, such as bytecode, is notoriously vulnerable to malicious methods that override the intended behavior. As used herein, bytecode refers to instructions that are executed by way of interpretation, such as through a software interpreter or virtual machine. Such code can be de-compiled, by which underlying mechanisms, which may be secret, are revealed. Moreover, such code can be modified to invoke behavior on a target machine that is outside that which was intended by the author. While code obfuscation is often employed to hide programmed procedures, skilled programmers can, with some effort, trace the code through such obfuscation and ultimately derive the underlying processes.
Defense-in-depth security assembles a collection of files that includes a file that is executable on a processor and another file that is executable through an interpretation process, such as a virtual machine. The executable file includes processor instructions that are native to the processor to execute a defense-in-depth process. The defense-in-depth process performs a sequence of tasks, the failure of any of which prohibits allocation of processor resources for the interpretation process. The interpreter-executable file may be provided to the interpretation process upon the allocation of the resources therefor.
Referring to
The tasks of DiD process 200 may be graduated, i.e., the launching and performance of one task relies on the performance of another task. Such conditioning may establish that one task must complete its goal, e.g., operate the system into a predetermined processing state on which the launching, performance of another task is contingent. DiD security succeeds in prohibiting malicious access to code or unauthorized execution of target process 250 by requiring the graduated processes achieve respective goals in a sequence that ultimately establishes the conditions for successful launching and/or execution thereof.
In
Completion of tasks 210, 220, 230, 240 places DiD process 200 in respective states 202, 204, 206, 208, a prescribed sequence of which must occur for target process 250 to be executed. If all tasks in DiD process 200 complete in the prescribed sequence, then target process 250 is allowed to execute to completion and, once such completion has been achieved, process 250 returns control to the system through a graceful exiting of DiD process 200, as illustrated at return operation 270. If, on the other hand, any one task fails to complete, DiD process 200 is terminated without proceeding beyond the point of failure, as illustrated at the termination operation 260. In certain implementations, a state of DiD process 200 may rely on completion of more than one task. For example, as illustrated in
A network 300, which may embody DiD security is illustrated in
Network 300 may implement a data delivery/installation process 360 by which packaged data are downloaded over communication link 320 from source data processing unit 310 and installed on destination data processing unit 350. The ordinarily skilled artisan will recognize numerous such installation processes and DiD security can be achieved regardless of the techniques used. Data delivery/installation process 360 may download the data in a package from source data processing unit 310 to destination data processing unit 350, unpack the data at destination data processing unit 350, such as by decompression and decoding, into a predetermined file structure and/or in a prescribed unpacking sequence, and automatically launch a process, such as an implementation of DiD security process 200 described herein. When so implemented, certain files may be stored on persistent storage 358 in a secured state, such as by encryption, and be decrypted only from within DiD security process 200, thereby providing a secured process 370.
It is to be understood that data delivery from source to destination may be performed by means other than through communication link 320. For example, data delivery may be achieved by storing a data package on a portable memory device, such as a CD, DVD, flash memory or the like, and physically transporting the portable memory device to destination data processing unit 350.
In
DiD security system 470 may perform graduated security tasks 472, 474, 476 to extract and execute the bytecode of target process 460 from a binary package 480. As used herein, a binary package is a collection of data files assembled for delivery and in accordance with a predetermined DiD security process. In the DiD security example of
Files 510 may include a set of supporting files 512, which may be software libraries and the like. In certain implementations, supporting files 512, while not necessarily requiring high data security, may nevertheless be vulnerable to tampering for the purposes of exposing protected bytecode. To ensure that delivered supporting files 512 have not been tampered with, each file in file set 512 may be provided to a hash computation process 520, such as by a computer implementation of the MD5 algorithm. Files 510 may additionally include a plurality of bytecode files 514 that are to be executed only in a secured environment. Bytecode files 514 may be provided to an encryption process 540, whereby the files are suitably encrypted, such as through a computer implementation of the Advanced Encryption Standard (AES). The encryption key 542 may be encoded by coding process 525 so as to be converted into unreadable data.
The encoded hash keys, encryption key and file structure description may be provided to a source code file 530 that is compliant with a computer programming language, such as C. In addition to the encoded keys and file structure, source code file 530 may include obfuscation measures, such as dummy constants of readable strings, representatively illustrated at line 532. Source code file 530 may include software code by which control of DiD security process is achieved, such as by suitably programmed instructions to perform specific security tasks and to establish the order in which such security tasks should be executed. Source code file 530 may be provided to a compiler/linker 535 to generate natively executable instructions that may be automatically launched upon installation at the destination end. The native code, encrypted bytecode files 514 and supporting files 512 may be provided to an installation packaging process 545, and the binary package resulting therefrom may be stored on a tangible medium 550 for delivery.
As an example outermost task, the hash values for supporting files 512′ may be computed, representatively illustrated in block 565, and compared with hash keys 572. Upon a determination that supporting files 512′ are indeed unaltered duplicates of supporting files 512, DiD security process 505 may transition into a state in which an inner task may be performed. In the example of
It is to be noted and appreciated that bytecode 584 is decrypted within the virtual machine 582 that was instantiated only after the graduated tasks of DiD security process 505 completed in a prescribed sequence. That is, the executable byte code 584 is decrypted within runtime environment 580, the security of which is ensured via DiD security process 505. Moreover, the bytecode, when external to runtime environment 580, is stored as an encrypted file, thus protecting vulnerable bytecode from malicious access.
Binary package constructed in accordance with DiD security described herein may be stored on and transferred through read only memory (ROM), random access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Processing platform 400, which may form a portion of source data processing unit 310 and/or destination data processing unit 350 is, for example, a microprocessor or microcontroller that executes instructions for the DiD security logic as well as the installation and packaging logic discussed herein. Thus, in general, the memory representatively illustrated by medium 550 may comprise one or more tangible (e.g., non-transitory) computer readable storage media (e.g., a memory device) encoded with software comprising computer executable instructions and when the software is executed (by the processor 140) it is operable to perform the operations described herein in connection with DiD security processes.
The above description is intended by way of example only.
The present application claims benefit of U.S. Provisional Patent Application 61/429,146 entitled, “Pari Encryption Framework for Encrypting Java Applications,” filed on Jan. 2, 2011, the entire disclosure of which is incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6138236 | Mirov et al. | Oct 2000 | A |
| 7533422 | Matthews et al. | May 2009 | B2 |
| 7574450 | Plouffe, Jr. | Aug 2009 | B2 |
| 7660798 | Ludwig et al. | Feb 2010 | B1 |
| 7814317 | Matthews et al. | Oct 2010 | B1 |
| 7823135 | Horning et al. | Oct 2010 | B2 |
| 7987510 | Kocher et al. | Jul 2011 | B2 |
| 8412945 | Sweet et al. | Apr 2013 | B2 |
| 20020053020 | Teijido et al. | May 2002 | A1 |
| 20030110396 | Lewis et al. | Jun 2003 | A1 |
| 20040054907 | Chateau et al. | Mar 2004 | A1 |
| 20040230949 | Talwar et al. | Nov 2004 | A1 |
| 20050125407 | Kraus et al. | Jun 2005 | A1 |
| 20050210263 | Levas et al. | Sep 2005 | A1 |
| 20060041761 | Neumann et al. | Feb 2006 | A1 |
| 20060265446 | Elgressy et al. | Nov 2006 | A1 |
| 20070204336 | Teijido et al. | Aug 2007 | A1 |
| 20070283417 | Smolen et al. | Dec 2007 | A1 |
| 20080125217 | Pavlovski | May 2008 | A1 |
| 20090094673 | Seguin et al. | Apr 2009 | A1 |
| 20090113110 | Chen et al. | Apr 2009 | A1 |
| 20090113111 | Chen et al. | Apr 2009 | A1 |
| 20090113424 | Chen et al. | Apr 2009 | A1 |
| 20090222674 | Leichsenring et al. | Sep 2009 | A1 |
| 20090228718 | Manferdelli et al. | Sep 2009 | A1 |
| 20090254572 | Redlich et al. | Oct 2009 | A1 |
| 20090323972 | Kohno et al. | Dec 2009 | A1 |
| 20100174921 | Abzarian et al. | Jul 2010 | A1 |
| 20100250932 | Dill et al. | Sep 2010 | A1 |
| 20110138465 | Franklin et al. | Jun 2011 | A1 |
| 20110145579 | Shin et al. | Jun 2011 | A1 |
| 20110173693 | Wysopal et al. | Jul 2011 | A1 |
| 20110246778 | Duane | Oct 2011 | A1 |
| 20110255690 | Kocher et al. | Oct 2011 | A1 |
| 20110282678 | Chapman | Nov 2011 | A1 |
| 20120131638 | Bellwood et al. | May 2012 | A1 |
| 20120216242 | Uner et al. | Aug 2012 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20120173497 A1 | Jul 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61429146 | Jan 2011 | US |