WO2007127287A2 - Association de codes executables a une application logicielle - Google Patents

Association de codes executables a une application logicielle Download PDF

Info

Publication number
WO2007127287A2
WO2007127287A2 PCT/US2007/010102 US2007010102W WO2007127287A2 WO 2007127287 A2 WO2007127287 A2 WO 2007127287A2 US 2007010102 W US2007010102 W US 2007010102W WO 2007127287 A2 WO2007127287 A2 WO 2007127287A2
Authority
WO
WIPO (PCT)
Prior art keywords
host
stub
code
block
host code
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2007/010102
Other languages
English (en)
Other versions
WO2007127287A3 (fr
Inventor
Andres M. Torrubia
Miguel A. Roman
Ivan Gadea
Pau Sanchez
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Adeia Media LLC
Original Assignee
Macrovision Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from EP06380096A external-priority patent/EP1850260A1/fr
Application filed by Macrovision Corp filed Critical Macrovision Corp
Publication of WO2007127287A2 publication Critical patent/WO2007127287A2/fr
Publication of WO2007127287A3 publication Critical patent/WO2007127287A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformation of program code
    • G06F8/54—Link editing before load time
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G06F21/12—Protecting executable software
    • G06F21/121—Restricting unauthorised execution of programs
    • G06F21/125—Restricting unauthorised execution of programs by manipulating the program code, e.g. source code, compiled code, interpreted code, machine code

Definitions

  • This disclosure relates to digital rights management methods and systems. More particularly, the present disclosure relates to binding digital rights management executable code to a software application.
  • Wrapping consists of adding a security and verification layer or a digital rights management layer (wrapper code) on top of an unprotected executable
  • the wrapper code verifies that a set of conditions are met when the protected executable first starts and then allows it to run normally if everything is as expected. For example, in a try-before-you-buy scenario, the wrapping code might first check the current date. If the current date is greater than the trial period's end, the software will display an expiration screen. Conversely, if the software is allowed to run, the wrapped code will be unencrypted and executed. At the moment when the host software is unencrypted, the software is vulnerable.
  • Figure 1 depicts the usual flow for wrapped software.
  • Figures 2 A and 2B illustrate an embodiment of the improved wrapping process.
  • Figures 3 A and 3B illustrate an embodiment of the improved wrapping process where the host code block is retained.
  • Figures 4A and 4B illustrate an embodiment of the improved wrapping process where a security block is provided.
  • Figures 5 A and 5B illustrate an embodiment of the improved wrapping process where the stub code is transformed.
  • Figures 6-9 are flow diagrams illustrating the processing steps in various embodiments.
  • Figures 10a and 10b are block diagrams of a computing system on which an embodiment may operate and in which embodiments may reside.
  • a computer-implemented method and system for binding digital rights management executable code to a software application are disclosed.
  • numerous specific details are set forth. However, it is understood that embodiments may be practiced without these specific details. In other instances, well-known processes, structures and techniques have not been shown in detail in order not to obscure the clarity of this description.
  • Various embodiments include a mechanism to bind digital rights management executable code to an application (host software) without requiring code changes to the application. Some of the application blocks are copied to the code section where the digital rights management code resides, making removal of the digital rights management code more difficult to automate.
  • a code section e.g. a host code section or a stub code section simply refers to a contiguous block of code and does not mean to imply the use of particular data or code structures provided or defined by a particular software or operating system developer.
  • Block 110 represents a software component, including an encrypted executable code portion 112 and a wrapping code portion 114.
  • Executable code 112 can be host application software typically developed by a third party software developer and/or distributor.
  • Wrapping code 114 comprises security or validation software, or software for enforcing digital rights management policies in relation to executable code 112.
  • Software component 110 is typically made available for purchase or license by end-users through various distribution means such as network downloads or software available on computer readable media.
  • wrapping code 114 can execute various business rules and/or digital rights management rules, such as try-before-you-buy policies. For example, based upon a particular set of rules and associated conditions, wrapping code 114 may determine that a particular user may be allowed to access and use executable code 112 as purchased software or trial software. In this case, path 150 is taken as shown in figure 1 to a different portion of wrapping code 124. The different portion of wrapping code 124 decrypts executable code 112 to produce unencrypted executable code 122.
  • Wrapping code 124 then jumps to the unencrypted executable code 122 as shown by path 152 and the user is then able to use host application software 122. Conversely, if wrapping code 114 determines that the user is not allowed to access executable code 112, path 154 is taken to another portion of wrapping code 134, where wrapping code 134 halts execution and shows the user an informational message indicating that access to executable code 112 is not allowed. In this manner, conventional wrappers can be used to protect a related executable code component.
  • the improved wrapping process consists of identifying blocks within the host code that can be moved across the boundary between the executable code and the wrapper. This process involves picking a block of code from the stub whose size is equal or less than the host block, copying the host block to the memory section of the stub, adjusting inbound and outbound memory references to and from the host block to other blocks or locations within the host, copying the stub block to the memory section of the host, and adjusting inbound and outbound memory references to and from the host block to other blocks or locations within the stub.
  • the identification of host blocks can be done using conventional code disassemblers as well known to those of ordinary skill in the art.
  • code disassemblers There are commercial programs such as IDA Pro (www.datarescue.com) that provide tools for the disassembling of executable code for multiple processors. These conventional code disassembly techniques can be automated using various methods.
  • Figure 2 A illustrates an example of one host executable 250 in which a host block 252 has been identified at offset 0x40A4C7.
  • Block 252 of the host code contains one outbound reference 254 (a call to location 0x40A4D0) and two inbound references 256 and 258 (from locations 0x4080A0 and 0x40D012, respectively).
  • Figure 2B shows the final executable 260 produced as a result of various embodiments.
  • host block 252 has been moved to the stub code section 261 at location 262 and the inbound and outbound references have been corrected accordingly.
  • outbound reference 254 has been re-routed as outbound reference 264.
  • Inbound reference 256 has been re-routed as inbound reference 266.
  • Inbound reference 258 has been re-routed as inbound reference 268.
  • the host code block at location 265 (same location as block 252) has been overwritten with random instructions.
  • a flow diagram illustrates the processing steps performed in one embodiment.
  • a host code block in the host code section is identified.
  • a copy of the host code block is written to a stub code block in the stub code section.
  • at least one reference of the host code block is re-routed to be a reference of the stub code block.
  • outbound and inbound references are corrected in the manner described above.
  • the improved wrapping process consists of identifying blocks within the host code that can be moved across the boundary between the executable code and the wrapper. This process involves copying the host block to the memory section of the stub and adjusting inbound and outbound memory references to and from the host block to other blocks or locations within the host.
  • Figure 3 A illustrates an example of one host executable 350 in which a host block 352 has been identified at offset 0x40A4C7.
  • Block 352 the host code contains one outbound reference 354 (a call to location 0x40 A4D0) and two inbound references 356 and 358 (at locations 0x4080A0 and 0x40D012, respectively).
  • Figure 3 B shows the final executable 360 produced as a result of various embodiments. In executable 360, a copy of host block 352 has been moved to the stub code section 361 at location 362 and the inbound and outbound references have been corrected accordingly.
  • outbound reference 354 has been re-routed as outbound reference 364.
  • Inbound reference 356 has been re-routed as inbound reference 366.
  • Inbound reference 358 has been re-routed as inbound reference 368.
  • the original copy of the host block 352 has been left in the original location 365 within the host code, so the unknown reference 369 to location 0x40A4C7 continues to render consistent results as the reference 359 in the original copy of the host block 352 that remains at location 0x40 A4C7.
  • a copy of the host code block is written to a stub code block in the stub code section.
  • at least one reference of the host code block is re-routed to be a reference of the stub code block. In various embodiments, outbound and inbound references are corrected in the manner described above.
  • at least one reference of the host code block is retained to remain a reference of the host code block.
  • another embodiment consists of identifying blocks within the host code that can be moved across the boundary between the executable code and the wrapper. This process involves, copying an identified host block to the memory section of the stub, adjusting outbound memory references from the host block to other blocks or locations within the host, and pointing the inbound blocks to a stub routine that performs security checks, such as CRC verifications, debugger detections, optical disc signature verifications (e.g. U.S. Patent Nos.
  • FIG. 4A illustrates an example of one host executable 450 in which a host block 452 has been identified at offset Ox40A4C7.
  • Block 452 of the host code contains one outbound reference 454 (a call to location 0x40A4D0) and two inbound references 456 and 458 (at locations Ox4080AO and 0x40D012, respectively).
  • Figure 4B shows the final executable 460 produced as a result of various embodiments.
  • host block 452 has been moved to the stub code section 461 at location 462 and outbound references have been corrected accordingly.
  • outbound reference 454 has been re-routed as outbound reference 464.
  • the inbound references 456 and 458 to host block 452 have been re-routed to a stub routine 463 contained within the stub code section 461 and located at offset 0x490010 as shown in Figure 4B as location 463.
  • the host code block at location 465 (same location as block 452) has been overwritten with random instructions.
  • stub routine 463 can be any of a variety of security, authorization, verification, digital rights management, access control, and/or tamper-proofing routines that can be executed prior to or after enabling access to the host code.
  • Inbound reference 456 has been re-routed to stub routine 463 as inbound reference 466.
  • Inbound reference 458 has been re-routed to stub routine 463 as inbound reference 468.
  • stub routine 463 has completed execution, processing control is transferred back from stub routine 463 to the copy of host block 462 at location 0x481 A25 on path 469.
  • the stub code section 461 has completed a desired level of security and/or access checking by virtue of the execution of stub routine 463.
  • a flow diagram illustrates the processing steps performed in one embodiment.
  • a host code block in the host code section is identified.
  • a copy of the host code block is written to a stub code block in the stub code section.
  • a stub routine is provided in the stub code section.
  • the stub routine can be any of the security, authorization, verification, digital rights management, access control, and/or tamper-proofing routines described above.
  • at least one reference of the host code block is re-routed to be a reference of the stub routine.
  • at least one reference of the stub routine is re-routed to be a reference of the stub code block. In various embodiments, outbound and inbound references are corrected in the manner described above.
  • code transformation is obfuscating the host function code at the assembly language level.
  • U.S. Patent No. 6,591,415 describes how to obfuscate functions at the assembly code level. It will be apparent to those of ordinary skill in the art that other forms of code transformation could similarly be used.
  • Figure 5A illustrates an example of one host executable 550 in which a host block 552 has been identified at offset 0x40 A4C7.
  • Block 552 of the host code contains one outbound reference 554 (a call to location 0x40A4D0) and two inbound references 556 and 558 (at locations 0x4080A0 and 0x40D012, respectively).
  • Figure 5B shows the final executable 560 produced as a result of various embodiments.
  • host block 552 has been moved to the stub code section 561 at location 562 and outbound references have been corrected accordingly.
  • outbound reference 554 has been re-routed as outbound reference 564.
  • the inbound references 556 and 558 to host block 552 have been re-routed to a stub routine 563 contained within the stub code section 561 and located at offset 0x490010 as shown in Figure 5B as location 563.
  • the host code block at location 565 (same location as block 552) has been overwritten with random instructions.
  • stub routine 563 can be any of a variety of security, authorization, verification, digital rights management, access control, and/or tamper-proofing routines that can be executed prior to or after enabling access to the host code.
  • Inbound reference 556 has been re-routed to stub routine 563 as inbound reference 566.
  • Inbound reference 558 has been re-routed to stub routine 563 as inbound reference 568.
  • stub routine 563 has completed execution, processing control is transferred back from stub routine 563 to the copy of host block 562 at location 0x481 A25 on path 569.
  • the stub code section 561 has completed a desired level of security and/or access checking by virtue of the execution of stub routine 563.
  • the copy of host block 552 has been code transformed (e.g. obfuscated) using conventional techniques and the transformed code has been moved to the stub code section 561 at location 562.
  • the outbound references have been corrected accordingly.
  • the inbound references have been re-directed to the stub routine 563 contained within the stub code section 561.
  • the transformed host block 562 is difficult for potential attackers to find and detach or disable from the host code.
  • a flow diagram illustrates the processing steps performed in one embodiment.
  • a host code block in the host code section is identified.
  • a copy of the host code block is written to a stub code block in the stub code section.
  • a stub routine is provided in the stub code section.
  • the stub routine can be any of the security, authorization, verification, digital rights management, access control, and/or tamper-proofing routines described above.
  • at least one reference of the host code block is re-routed to be a reference of the stub routine.
  • At processing block 920 at least one reference of the stub routine is re-routed to be a reference of the stub code block. In various embodiments, outbound and inbound references are corrected in the manner described above.
  • the stub code block is transformed (e.g. obfuscated).
  • Performing security checks can take a few milliseconds to be executed.
  • host functions are divided into two categories: 1) functions that are not performance sensitive and thus may contain security checks, and 2) functions that are performance sensitive and thus should not contain security checks. There are multiple methods of categorizing the host functions.
  • performance-sensitive functions can be identified by having a pre-defined list of known performance-sensitive functions that a disassembler can readily identify.
  • Run-time functions such as /close, malloc, etc. that are statically linked to the host executable (and thus form the host executable) can be detected by commercial tools such as IDA Pro FLIRT.
  • performance-sensitive functions can be identified by profiling the host executable and collecting information about function execution.
  • performance-sensitive functions can be determined interactively prompting the user at wrapping time.
  • the improved wrapping process consists of identifying blocks within the host code that can be moved across the boundary between the executable code and the wrapper. This process involves copying the host block to the memory section of the stub, adjusting outbound memory references from the host block to other blocks or locations within the host, and pointing the inbound blocks to a stub routine that performs security responses based on previously executed security checks. Such security responses may include showing messages to the end-user, shutting down the application, modifying registers or function return values, or any action that modifies the expected application behavior.
  • FIGS. 10a and 10b show an example of a computer system 200 illustrating an exemplary client or server computer system in which the features of an example embodiment may be implemented.
  • Computer system 200 is comprised of a bus or other communications means 214 and 216 for communicating information, and a processing means such as processor 220 coupled with bus 214 for processing information.
  • Computer system 200 further comprises a random access memory (RAM) or other dynamic storage device 222 (commonly referred to as main memory), coupled to bus 214 for storing information and instructions to be executed by processor 220.
  • Main memory 222 also may be used for storing temporary variables or other intermediate information during execution of instructions by processor 220.
  • Computer system 200 also comprises a read only memory (ROM) and /or other static storage device 224 coupled to bus 214 for storing static information and instructions for processor 220.
  • ROM read only memory
  • An optional data storage device 228 such as a magnetic disk or optical disk and its corresponding drive may also be coupled to computer system 200 for storing information and instructions.
  • Computer system 200 can also be coupled via bus 216 to a display device 204, such as a cathode ray tube (CRT) or a liquid crystal display (LCD), for displaying information to a computer user. For example, image, textual, video, or graphical depictions of information may be presented to the user on display device 204.
  • a display device 204 such as a cathode ray tube (CRT) or a liquid crystal display (LCD), for displaying information to a computer user. For example, image, textual, video, or graphical depictions of information may be presented to the user on display device 204.
  • an alphanumeric input device 208 is coupled to bus 216 for communicating information and/or command selections to processor 220.
  • cursor control device 206 such as a conventional mouse, trackball, or other type of cursor direction keys for communicating direction information and command selection to processor 220 and for controlling cursor movement on display 204.
  • a communication device 226 may also be coupled to bus 216 for accessing remote computers or servers, such as a web server, or other servers via the Internet, for example.
  • the communication device 226 may include a modem, a network interface card, or other well-known interface devices, such as those used for interfacing with Ethernet, Token-ring, wireless, or other types of networks.
  • the computer system 200 may be coupled to a number of servers via a conventional network infrastructure.
  • the system of an example embodiment includes software, information processing hardware, and various processing steps, as described above.
  • the features and process steps of example embodiments may be embodied in machine or computer executable instructions.
  • the instructions can be used to cause a general purpose or special purpose processor, which is programmed with the instructions to perform the steps of an example embodiment.
  • the features or steps may be performed by specific hardware components that contain hard- wired logic for performing the steps, or by any combination of programmed computer components and custom hardware components. While embodiments are described with reference to the Internet, the method and apparatus described herein is equally applicable to other network infrastructures or other data communications systems.
  • a software program can be launched from a computer-readable medium in a computer-based system to execute the functions defined in the software program described above.
  • One of ordinary skill in the art will further understand the various programming languages that may be employed to create one or more software programs designed to implement and perform the methods disclosed herein.
  • the programs may be structured in an object-orientated format using an object-oriented language such as Java, Smalltalk, or C++.
  • the programs can be structured in a procedure-orientated format using a procedural language, such as assembly or C.
  • the software components may communicate using any of a number of mechanisms well known to those of ordinary skill in the art, such as application program interfaces or inter-process communication techniques, including remote procedure calls.
  • application program interfaces or inter-process communication techniques, including remote procedure calls.
  • remote procedure calls The teachings of various embodiments are not limited to any particular programming language or environment, including HTML and XML.
  • Figures 10a and 10b illustrate block diagrams of an article of manufacture according to various embodiments, such as a computer 200, a memory system 222, 224, and 228, a magnetic or optical disk 212, some other storage device 228, and/or any type of electronic device or system.
  • the article 200 may include a computer 202 (having one or more processors) coupled to a computer-readable medium 212, and/or a storage device 228 (e.g., fixed and/or removable storage media, including tangible memory having electrical, optical, or electromagnetic conductors) or a carrier wave through communication device 226, having associated information (e.g., computer program instructions and/or data), which when executed by the computer 202, causes the computer 202 to perform the methods described herein.
  • a computer 202 having one or more processors
  • a storage device 228 e.g., fixed and/or removable storage media, including tangible memory having electrical, optical, or electromagnetic conductors
  • a carrier wave e.g., fixed and/or removable storage media, including tangible memory having electrical, optical, or electromagnetic conductors
  • associated information e.g., computer program instructions and/or data

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Technology Law (AREA)
  • Computer Hardware Design (AREA)
  • Storage Device Security (AREA)

Abstract

La présente invention concerne un procédé et un système informatisés pour l'association de codes exécutables de gestion des droits numériques à une application logicielle. le procédé et le système comprennent l'identification d'un bloc de codes hôtes dans la section de codes hôtes, la copie du bloc de codes hôtes depuis la section de codes hôtes vers un bloc de codes souches (stub) dans la section de codes souches et le reroutage d'au moins une référence du bloc de codes hôtes pour en faire une référence du bloc de codes souches (stub).
PCT/US2007/010102 2006-04-26 2007-04-24 Association de codes executables a une application logicielle Ceased WO2007127287A2 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
EP06380096.5 2006-04-26
EP06380096A EP1850260A1 (fr) 2006-04-26 2006-04-26 Procédé et système mis en oeuvre par ordinateur permettant de lier du code exécutable de gestion de droits numériques avec une application logicielle
US11/598,318 US8516447B2 (en) 2006-04-26 2006-11-13 Computer-implemented method and system for binding digital rights management executable code to a software application
US11/598,318 2006-11-13

Publications (2)

Publication Number Publication Date
WO2007127287A2 true WO2007127287A2 (fr) 2007-11-08
WO2007127287A3 WO2007127287A3 (fr) 2008-10-02

Family

ID=38656171

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2007/010102 Ceased WO2007127287A2 (fr) 2006-04-26 2007-04-24 Association de codes executables a une application logicielle

Country Status (1)

Country Link
WO (1) WO2007127287A2 (fr)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6006328A (en) * 1995-07-14 1999-12-21 Christopher N. Drake Computer software authentication, protection, and security system
US6981262B1 (en) * 2000-06-27 2005-12-27 Microsoft Corporation System and method for client interaction in a multi-level rights-management architecture
US6795964B2 (en) * 2001-06-18 2004-09-21 Hewlett-Packard Development Company, L.P. Edge profiling for executable program code having branches through stub code segments
US7360097B2 (en) * 2003-09-30 2008-04-15 Check Point Software Technologies, Inc. System providing methodology for securing interfaces of executable files

Also Published As

Publication number Publication date
WO2007127287A3 (fr) 2008-10-02

Similar Documents

Publication Publication Date Title
US8458673B2 (en) Computer-implemented method and system for binding digital rights management executable code to a software application
JP4067757B2 (ja) プログラム配布システム
US10002239B2 (en) Data protection systems and methods
US8271803B2 (en) Anti-debugging protection of binaries with proxy code execution
US8499349B1 (en) Detection and restoration of files patched by malware
US8380634B2 (en) First computer process and second computer process proxy-executing code on behalf of first process
US20060048223A1 (en) Method and system for providing tamper-resistant software
US20070016914A1 (en) Kernel validation layer
US20080133928A1 (en) A computer-implemented method and system for embedding and authenticating ancillary information in digitally signed content
JPH10313309A (ja) 国際暗号法フレームワークでアプリケーションが一定のサービスクラスを合法的に実行することを認証する装置
CN103827881A (zh) 用于设备操作系统中的动态平台安全的方法和系统
US12373603B2 (en) Methods and systems for recursive descent parsing
US8892894B2 (en) Computer-implemented method and system for embedding and authenticating ancillary information in digitally signed content
Dong et al. AdSentry: comprehensive and flexible confinement of JavaScript-based advertisements
US20120174090A1 (en) Patch and dot release licensing
US8516447B2 (en) Computer-implemented method and system for binding digital rights management executable code to a software application
KR101604892B1 (ko) 안드로이드 기반 어플리케이션의 부정사용 방지 방법 및 장치
Egners et al. Hackers in your pocket: A survey of smartphone security across platforms
WO2007127287A2 (fr) Association de codes executables a une application logicielle
HK1108948A (en) A computer-implemented method and system for binding digital rights management executable code to a software application
WO2009016426A1 (fr) Procédé et système mis en oeuvre par ordinateur permettant d'intégrer et d'authentifier des informations auxiliaires dans un contenu signé numériquement
EP2202661B1 (fr) Appareil et procédé pour protéger un composant d'un système informatique
WO2025015325A1 (fr) Contre-mesures basées sur le contexte pour menaces de cybersécurité
CN119312318A (zh) 一种工业场景下阻止勒索病毒的方法、系统、介质及电子设备
CN118094597A (zh) 一种应用于Android虚拟框架的加密系统及方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07776239

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 4305/KOLNP/2008

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07776239

Country of ref document: EP

Kind code of ref document: A2