Patent Grant
7925591
The present invention relates to an architecture for enforcing rights in digital content. More specifically, the present invention relates to such an enforcement architecture that allows access to encrypted digital content only in accordance with parameters specified by license rights acquired by a user of the digital content.
Digital rights management and enforcement is highly desirable in connection with digital content such as digital audio, digital video, digital text, digital data, digital multimedia, etc., where such digital content is to be distributed to users. Typical modes of distribution include tangible devices such as a magnetic (floppy) disk, a magnetic tape, an optical (compact) disk (CD), etc., and intangible media such as an electronic bulletin board, an electronic network, the Internet, etc. Upon being received by the user, such user renders or ‘plays’ the digital content with the aid of an appropriate rendering device such as a media player on a personal computer or the like.
Typically, a content owner or rights-owner, such as an author, a publisher, a broadcaster, etc. (hereinafter “content owner”), wishes to distribute such digital content to a user or recipient in exchange for a license fee or some other consideration. Such content owner, given the choice, would likely wish to restrict what the user can do with such distributed digital content. For example, the content owner would like to restrict the user from copying and re-distributing such content to a second user, at least in a manner that denies the content owner a license fee from such second user.
In addition, the content owner may wish to provide the user with the flexibility to purchase different types of use licenses at different license fees, while at the same time holding the user to the terms of whatever type of license is in fact purchased. For example, the content owner may wish to allow distributed digital content to be played only a limited number of times, only for a certain total time, only on a certain type of machine, only on a certain type of media player, only by a certain type of user, etc.
However, after distribution has occurred, such content owner has very little if any control over the digital content. This is especially problematic in view of the fact that practically every new or recent personal computer includes the software and hardware necessary to make an exact digital copy of such digital content, and to download such exact digital copy to a write-able magnetic or optical disk, or to send such exact digital copy over a network such as the Internet to any destination.
Of course, as part of the legitimate transaction where the license fee was obtained, the content owner may require the user of the digital content to promise not to re-distribute such digital content. However, such a promise is easily made and easily broken. A content owner may attempt to prevent such re-distribution through any of several known security devices, usually involving encryption and decryption. However, there is likely very little that prevents a mildly determined user from decrypting encrypted digital content, saving such digital content in an un-encrypted form, and then re-distributing same.
A need exists, then, for providing an enforcement architecture and method that allows the controlled rendering or playing of arbitrary forms of digital content, where such control is flexible and definable by the content owner of such digital content. A need also exists for providing a controlled rendering environment on a computing device such as a personal computer, where the rendering environment includes at least a portion of such enforcement architecture. Such controlled rendering environment allows that the digital content will only be rendered as specified by the content owner, even though the digital content is to be rendered on a computing device which is not under the control of the content owner.
Further, a need exists for a trusted component running on the computing device, where the trusted component enforces the rights of the content owner on such computing device in connection with a piece of digital content, even against attempts by the user of such computing device to access such digital content in ways not permitted by the content owner. As but one example, such a trusted software component prevents a user of the computing device from making a copy of such digital content, except as otherwise allowed for by the content owner thereof.
In the present invention, a retailer facilitates issuance of a digital license from a licensor to a customer for a corresponding piece of digital content. The retailer receives payment for the license from the customer, where the payment is to be shared with the licensor in a pre-determined manner. The retailer also receives customer-based information from the customer. The retailer then composes an actual license request including the obtained customer-based information, and including retailer-based information identifying the retailer to the licensor and acknowledging to the licensor that the retailer owes a portion of the received payment to the licensor. Thereafter, the retailer forwards the actual license request to the licensor.
The licensor, upon receiving the actual license request as composed by the retailer notes based on the retailer-based information that the retailer identified thereby owes the licensor at least a portion of the forwarded payment. If an individual sends a license request directly to the licensor and thus fails to forward payment for the license to a retailer, the actual license request as composed by the individual fails to include retailer-based information identifying a retailer to the licensor and acknowledging to the licensor that a retailer owes a portion of any received payment to the licensor. Accordingly, the licensor refuses to issue a license as requested based on the lack of retailer-based information.
The foregoing summary, as well as the following detailed description of the embodiments of the present invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there are shown in the drawings embodiments which are presently preferred. As should be understood, however, the invention is not limited to the precise arrangements and instrumentalities shown. In the drawings:
Referring to the drawings in details, wherein like numerals are used to indicate like elements throughout, there is shown in
Computer Environment
As shown in
The personal computer 120 may further include a hard disk drive 127 for reading from and writing to a hard disk (not shown), a magnetic disk drive 128 for reading from or writing to a removable magnetic disk 129, and an optical disk drive 130 for reading from or writing to a removable optical disk 131 such as a CD-ROM or other optical media. The hard disk drive 127, magnetic disk drive 128, and optical disk drive 130 are connected to the system bus 123 by a hard disk drive interface 132, a magnetic disk drive interface 133, and an optical drive interface 134, respectively. The drives and their associated computer-readable media provide non-volatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 120.
Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 129, and a removable optical disk 131, it should be appreciated that other types of computer readable media which can store data that is accessible by a computer may also be used in the exemplary operating environment. Such other types of media include a magnetic cassette, a flash memory card, a digital video disk, a Bernoulli cartridge, a random access memory (RAM), a read-only memory (ROM), and the like.
A number of program modules may be stored on the hard disk, magnetic disk 129, optical disk 131, ROM 124 or RAM 125, including an operating system 135, one or more application programs 136, other program modules 137 and program data 138. A user may enter commands and information into the personal computer 120 through input devices such as a keyboard 140 and pointing device 142. Other input devices (not shown) may include a microphone, joystick, game pad, satellite disk, scanner, or the like. These and other input devices are often connected to the processing unit 121 through a serial port interface 146 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port, or universal serial bus (USB). A monitor 147 or other type of display device is also connected to the system bus 123 via an interface, such as a video adapter 148. In addition to the monitor 147, a personal computer typically includes other peripheral output devices (not shown), such as speakers and printers. The exemplary system of
The personal computer 120 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 149. The remote computer 149 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the personal computer 120, although only a memory storage device 150 has been illustrated in
When used in a LAN networking environment, the personal computer 120 is connected to the LAN 151 through a network interface or adapter 153. When used in a WAN networking environment, the personal computer 120 typically includes a modem 154 or other means for establishing communications over the wide area network 152, such as the Internet. The modem 154, which may be internal or external, is connected to the system bus 123 via the serial port interface 146. In a networked environment, program modules depicted relative to the personal computer 120, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
Architecture
Referring again to
Architecture—Authoring Tool 18
The authoring tool 18 is employed by a content owner to package a piece of digital content 12 into a form that is amenable for use in connection with the architecture 10 of the present invention. In particular, the content owner provides the authoring tool 18 with the digital content 12, instructions and/or rules that are to accompany the digital content 12, and instructions and/or rules as to how the digital content 12 is to be packaged. The authoring tool 18 then produces a digital content package 12p having the digital content 12 encrypted according to an encryption/decryption key, and the instructions and/or rules that accompany the digital content 12.
In one embodiment of the present invention, the authoring tool 18 is instructed to serially produce several different digital content 12 packages 12p, each having the same digital content 12 encrypted according to a different encryption/decryption key. As should be understood, having several different packages 12p with the same digital content 12 may be useful for tracking the distribution of such packages 12p/content 12 (hereinafter simply “digital content 12”, unless circumstances require otherwise). Such distribution tracking is not ordinarily necessary, but may be used by an investigative authority in cases where the digital content 12 has been illegally sold or broadcast.
In one embodiment of the present invention, the encryption/decryption key that encrypts the digital content 12 is a symmetric key, in that the encryption key is also the decryption key (KD). As will be discussed below in more detail, such decryption key (KD) is delivered to a user's computing device 14 in a hidden form as part of a license 16 for such digital content 12. Preferably, each piece of digital content 12 is provided with a content ID (or each package 12p is provided with a package ID), each decryption key (KD) has a key ID, and the authoring tool 18 causes the decryption key (KD), key ID, and content ID (or package ID) for each piece of digital content 12 (or each package 12p) to be stored in the content-key database 20. In addition, license data regarding the types of licenses 16 to be issued for the digital content 12 and the terms and conditions for each type of license 16 may be stored in the content-key database 20, or else in another database (not shown). Preferably, the license data can be modified by the content owner at a later time as circumstances and market conditions may require.
In use, the authoring tool 18 is supplied with information including, among other things:
As is known, a watermark is a hidden, computer-readable signal that is added to the digital content 12 as an identifier. A fingerprint is a watermark that is different for each instance. As should be understood, an instance is a version of the digital content 12 that is unique. Multiple copies of any instance may be made, and any copy is of a particular instance. When a specific instance of digital content 12 is illegally sold or broadcast, an investigative authority can perhaps identify suspects according to the watermark/fingerprint added to such digital content 12.
Data compression may be performed according to any appropriate compression algorithm without departing from the spirit and scope of the present invention. For example, the .mp3 or .wav compression algorithm may be employed. Of course, the digital content 12 may already be in a compressed state, in which case no additional compression is necessary.
The instructions and/or rules that are to accompany the digital content 12 may include practically any appropriate instructions, rules, or other information without departing from the spirit and scope of the present invention. As will be discussed below, such accompanying instructions/rules/information are primarily employed by the user and the user's computing device 14 to obtain a license 16 to render the digital content 12. Accordingly, such accompanying instructions/rules/information may include an appropriately formatted license acquisition script or the like, as will be described in more detail below. In addition, or in the alternative, such accompanying instructions/rules/information may include ‘preview’ information designed to provide a user with a preview of the digital content 12.
With the supplied information, the authoring tool 18 then produces one or more packages 12p corresponding to the digital content 12. Each package 12p may then be stored on the content server 22 for distribution to the world.
In one embodiment of the present invention, and referring now to
As should be understood, such dictionary 28 is easily and quickly modifiable by an operator of the authoring tool 18 (human or machine), and therefore the type of authoring performed by the authoring tool 18 is likewise easily and quickly modifiable in a dynamic manner. In one embodiment of the present invention, the authoring tool 18 includes an operator interface (not shown) displayable on a computer screen to a human operator. Accordingly, such operator may modify the dictionary 28 by way of the interface, and further may be appropriately aided and/or restricted in modifying the dictionary 28 by way of the interface.
In the authoring tool 18, and as seen in
Thereafter, an encryption filter 18c encrypts the encoded digital content 12 in the memory 29c according to the encryption/decryption key (KD) specified in the dictionary 28, and places the encrypted digital content 12 in the memory 29c. A header-filter 18d then adds the header information specified in the dictionary 28 to the encrypted digital content 12 in the memory 29c.
As should be understood, depending on the situation, the package 12p may include multiple streams of temporally aligned digital content 12 (one stream being shown in
It should be noted that in certain circumstances, the type of encoding to be performed will not normally change. Since the type of muxing typically is based on the type of encoding, it is likewise the case that the type of muxing will not normally change, either. If this is in fact the case, the dictionary 28 need not include parameters on the type of encoding and/or the type of muxing. Instead, it is only necessary that the type of encoding be ‘hardwired’ into the encoding filter and/or that the type of muxing be ‘hardwired’ into the mux filter. Of course, as circumstance require, the authoring tool 18 may not include all of the aforementioned filters, or may include other filters, and any included filter may be hardwired or may perform its function according to parameters specified in the dictionary 28, all without departing from the spirit and scope of the present invention.
Preferably, the authoring tool 18 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure.
Architecture—Content Server 22
Referring again to
It will be appreciated that the content server 22 distributes packages 12p without regard to any trust or security issues. As discussed below, such issues are dealt with in connection with the license server 24 and the relationship between such license server 24 and the user's computing device 14. In one embodiment of the present invention, the content server 22 freely releases and distributes packages 12p having digital content 12 to any distributee requesting same. However, the content server 22 may also release and distribute such packages 12p in a restricted manner without departing from the spirit and scope of the present invention. For example, the content server 22 may first require payment of a pre-determined distribution fee prior to distribution, or may require that a distributes identify itself, or may indeed make a determination of whether distribution is to occur based on an identification of the distributee.
In addition, the content server 22 may be employed to perform inventory management by controlling the authoring tool 18 to generate a number of different packages 12p in advance to meet an anticipated demand. For example, the server could generate 100 packages 12p based on the same digital content 12, and serve each package 12p 10 times. As supplies of packages 12p dwindle to 20, for example, the content server 22 may then direct the authoring tool 18 to generate 80 additional packages 12p, again for example.
Preferably, the content server 22 in the architecture 10 has a unique public/private key pair (PU-CS, PR-CS) that is employed as part of the process of evaluating a license 16 and obtaining a decryption key (KD) for decrypting corresponding digital content 12, as will be explained in more detail below. As is known, a public/private key pair is an asymmetric key, in that what is encrypted in one of the keys in the key pair can only be decrypted by the other of the keys in the key pair. In a public/private key pair encryption system, the public key may be made known to the world, but the private key should always be held in confidence by the owner of such private key. Accordingly, if the content server 22 encrypts data with its private key (PR-CS), it can send the encrypted data out into the world with its public key (PU-CS) for decryption purposes. Correspondingly, if an external device wants to send data to the content server 22 so that only such content server 22 can decrypt such data, such external device must first obtain the public key of the content server 22 (PU-CS) and then must encrypt the data with such public key. Accordingly, the content server 22 (and only the content server 22) can then employ its private key (PR-CS) to decrypt such encrypted data.
As with the authoring tool 18, the content server 22 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention, the authoring tool 18 and the content server 22 may reside on a single computer, processor, or other computing machine, each in a separate work space. It should be recognized, moreover, that the content server 22 may in certain circumstances include the authoring tool 18 and/or perform the functions of the authoring tool 18, as discussed above.
Structure of Digital Content Package 12p
Referring now to
With regard to (KD (PU-CS) S (PR-CS)), it is to be understood that such item is to be used in connection with validating the digital content 12 and/or package 12p, as will be explained below. Unlike a certificate with a digital signature (see below), the key (PU-CS) is not necessary to get at (KD (PU-CS)). Instead, the key (PU-CS) is obtained merely by applying the decryption key (KD). Once so obtained, such key (PU-CS) may be employed to test the validity of the signature (S (PR-CS)).
It should also be understood that for such package 12p to be constructed by the authoring tool 18, such authoring tool 18 must already possess the license acquisition information and (KD (PU-CS) S (PR-CS)), presumably as header information supplied by the dictionary 28. Moreover, the authoring tool 18 and the content server 22 must presumably interact to construct (KD (PU-CS) S (PR-CS)). Such interaction may for example include the steps of:
Referring again to
As with the authoring tool 18 and the content server 22, the license server 24 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention the authoring tool 18 and/or the content server 22 may reside on a single computer, processor, or other computing machine together with the license server 24, each in a separate work space.
In one embodiment of the present invention, prior to issuance of a license 16, the license server 24 and the content server 22 enter into an agency agreement or the like, wherein the license server 24 in effect agrees to be the licensing authority for at least a portion of the digital content 12 distributed by the content server 22. As should be understood, one content server 22 may enter into an agency agreement or the like with several license servers 24, and/or one license server 24 may enter into an agency agreement or the like with several content servers 22, all without departing from the spirit and scope of the present invention.
Preferably, the license server 24 can show to the world that it does in fact have the authority to issue a license 16 for digital content 12 distributed by the content server 22. To do so, it is preferable that the license server 24 send to the content server 22 the license server 24 public key (PU-LS), and that the content server 22 then send to the license server 24 a digital certificate containing PU-LS as the contents signed by the content server 22 private key (CERT (PU-LS) S (PR-CS)). As should be understood, the contents (PU-LS) in such certificate can only be accessed with the content server 22 public key (PU-CS). As should also be understood, in general, a digital signature of underlying data is an encrypted form of such data, and will not match such data when decrypted if such data has been adulterated or otherwise modified.
As a licensing authority in connection with a piece of digital content 12, and as part of the licensing function, the license server 24 must have access to the decryption key (KD) for such digital content 12. Accordingly, it is preferable that license server 24 have access to the content-key database 20 that has the decryption key (KD), key ID, and content ID (or package ID) for such digital content 12 (or package 12p).
Architecture—Black Box Server 26
Still referring to
As with the authoring tool 18, the content server 22, and the license server 24, the black box server 26 is implemented on an appropriate computer, processor, or other computing machine by way of appropriate software. The structure and operation of such machine and such software should be apparent based on the disclosure herein and therefore do not require any detailed discussion in the present disclosure. Moreover, in one embodiment of the present invention the license server 24, the authoring tool 18, and/or the content server 22 may reside on a single computer, processor, or other computing machine together with the black box server 26, each in a separate work space. Note, though, that for security purposes, it may be wise to have the black box server 26 on a separate machine.
Architecture—User's Computing Device 14
Referring now to
The content owner for a piece of digital content 12 must trust that the user's computing device 14 will abide by the rules specified by such content owner, i.e. that the digital content 12 will not be rendered unless the user obtains a license 16 that permits the rendering in the manner sought. Preferably, then, the user's computing device 14 must provide a trusted component or mechanism 32 that can satisfy to the content owner that such computing device 14 will not render the digital content 12 except according to the license rules embodied in the license 16 associated with the digital content 12 and obtained by the user.
Here, the trusted mechanism 32 is a Digital Rights Management (DRM) system 32 that is enabled when a user requests that a piece of digital content 12 be rendered, that determines whether the user has a license 16 to render the digital content 12 in the manner sought, that effectuates obtaining such a license 16 if necessary, that determines whether the user has the right to play the digital content 12 according to the license 16, and that decrypts the digital content 12 for rendering purposes if in fact the user has such right according to such license 16. The contents and function of the DRM system 32 on the user's computing device 14 and in connection with the architecture 10 are described below.
DRM System 32
The DRM system 32 performs four main functions with the architecture 10 disclosed herein: (1) content acquisition, (2) license acquisition, (3) content rendering, and (4) black box 30 installation/update. Preferably, any of the functions can be performed at any time, although it is recognized that some of the functions already require that digital content 12 be acquired.
DRM System 32—Content Acquisition
Acquisition of digital content 12 by a user and/or the user's computing device 14 is typically a relatively straight-forward matter and generally involves placing a file having encrypted digital content 12 on the user's computing device 14. Of course, to work with the architecture 10 and the DRM system 32 disclosed herein, it is necessary that the encrypted digital content 12 be in a form that is amenable to such architecture 10 and DRM system 32, such as the digital package 12p as will be described below.
As should be understood, the digital content 12 may be obtained in any manner from a content server 22, either directly or indirectly, without departing from the spirit and scope of the present invention. For example, such digital content 12 may be downloaded from a network such as the Internet, located on an obtained optical or magnetic disk or the like, received as part of an E-mail message or the like, or downloaded from an electronic bulletin board or the like.
Such digital content 12, once obtained, is preferably stored in a manner such that the obtained digital content 12 is accessible by a rendering application 34 (to be described below) running on the computing device 14, and by the DRM system 32. For example, the digital content 12 may be placed as a file on a hard drive (not shown) of the user's computing device 14, or on a network server (not shown) accessible to the computing device 14. In the case where the digital content 12 is obtained on an optical or magnetic disk or the like, it may only be necessary that such disk be present in an appropriate drive (not shown) coupled to the user's computing device 14.
In the present invention, it is not envisioned that any special tools are necessary to acquire digital content 12, either from the content server 22 as a direct distribution source or from some intermediary as an indirect distribution source. That is, it is preferable that digital content 12 be as easily acquired as any other data file. However, the DRM system 32 and/or the rendering application 34 may include an interface (not shown) designed to assist the user in obtaining digital content 12. For example, the interface may include a web browser especially designed to search for digital content 12, links to pre-defined Internet web sites that are known to be sources of digital content 12, and the like.
DRM System 32—Content Rendering, Part 1
Referring now to
Importantly, and in addition, such render command may be embodied as a request to copy the digital content 12 to another form, such as to a printed form, a visual form, an audio form, etc. As should be understood, the same digital content 12 may be rendered in one form, such as on a computer screen, and then in another form, such as a printed document. In the present invention, each type of rendering is performed only if the user has the right to do so, as will be explained below.
In one embodiment of the present invention, the digital content 12 is in the form of a digital file having a file name ending with an extension, and the computing device 14 can determine based on such extension to start a particular kind of rendering application 34. For example, if the file name extension indicates that the digital content 12 is a text file, the rendering application 34 is some form of word processor such as the “MICROSOFT WORD”, distributed by MICROSOFT Corporation of Redmond, Wash. Likewise, if the file name extension indicates that the digital content 12 is an audio, video, and/or multimedia file, the rendering application 34 is some form of multimedia player, such as “MICROSOFT MEDIA PLAYER”, also distributed by MICROSOFT Corporation of Redmond, Wash.
Of course, other methods of determining a rendering application may be employed without departing from the spirit and scope of the present invention. As but one example, the digital content 12 may contain meta-data in an un-encrypted form (i.e., the aforementioned header information), where the meta-data includes information on the type of rendering application 34 necessary to render such digital content 12.
Preferably, such rendering application 34 examines the digital content 12 associated with the file name and determines whether such digital content 12 is encrypted in a rights-protected form (steps 503, 505). If not protected, the digital content 12 may be rendered without further ado (step 507). If protected, the rendering application 34 determines from the encrypted digital content 12 that the DRM system. 32 is necessary to play such digital content 12. Accordingly, such rendering application 34 directs the user's computing device 14 to run the DRM system 32 thereon (step 509). Such rendering application 34 then calls such DRM system 32 to decrypt the digital content 12 (step 511). As will be discussed in more detail below, the DRM system 32 in fact decrypts the digital content 12 only if the user has a valid license 16 for such digital content 12 and the right to play the digital content 12 according to the license rules in the valid license 16. Preferably, once the DRM system 32 has been called by the rendering application 34, such DRM system 32 assumes control from the rendering application 34, at least for purposes of determining whether the user has a right to play such digital content 12 (step 513).
DRM System 32 Components
In one embodiment of the present invention, and referring again to
DRM System 32 Components—License Evaluator 36
The license evaluator 36 locates one or more licenses 16 that correspond to the requested digital content 12, determines whether such licenses 16 are valid, reviews the license rules in such valid licenses 16, and determines based on the reviewed license rules whether the requesting user has the right to render the requested digital content 12 in the manner sought, among other things. As should be understood, the license evaluator 36 is a trusted component in the DRM system 32. In the present disclosure, to be ‘trusted’ means that the license server 24 (or any other trusting element) is satisfied that the trusted element will carry out the wishes of the owner of the digital content 12 according to the rights description in the license 16, and that a user cannot easily alter such trusted element for any purpose, nefarious or otherwise.
The license evaluator 36 has to be trusted in order to ensure that such license evaluator 36 will in fact evaluate a license 16 properly, and to ensure that such license evaluator 36 has not been adulterated or otherwise modified by a user for the purpose of bypassing actual evaluation of a license 16. Accordingly, the license evaluator 36 is run in a protected or shrouded environment such that the user is denied access to such license evaluator 36. Other protective measures may of course be employed in connection with the license evaluator 36 without departing from the spirit and scope of the present invention.
DRM System 32 Components—Black Box 30
Primarily, and as was discussed above, the black box 30 performs encryption and decryption functions in the DRM system 32. In particular, the black box 30 works in conjunction with the license evaluator 36 to decrypt and encrypt certain information as part of the license evaluation function. In addition, once the license evaluator 36 determines that a user does in fact have the right to render the requested digital content 12 in the manner sought, the black box 30 is provided with a decryption key (KD) for such digital content 12, and performs the function of decrypting such digital content 12 based on such decryption key (KD).
The black box 30 is also a trusted component in the DRM system 32. In particular, the license server 24 must trust that the black box 30 will perform the decryption function only in accordance with the license rules in the license 16, and also trust that such black box 30 will not operate should it become adulterated or otherwise modified by a user for the nefarious purpose of bypassing actual evaluation of a license 16. Accordingly, the black box 30 is also run in a protected or shrouded environment such that the user is denied access to such black box 30. Again, other protective measures may be employed in connection with the black box 30 without departing from the spirit and scope of the present invention. Preferably, and like the content server 22 and license server 24, the black box 30 in the DRM system 32 has a unique public/private key pair (PU-BB, PR-BB) that is employed as part of the process of evaluating the license 16 and obtaining a decryption key (KD) for decrypting the digital content 12, as will be described in more detail below.
DRM System 32 Components—License Store 38
The license store 38 stores licenses 16 received by the DRM system 32 for corresponding digital content 12. The license store 38 itself need not be trusted since the license store 38 merely stores licenses 16, each of which already has trust components built thereinto, as will be described below. In one embodiment of the present invention, the license store 38 is merely a sub-directory of a drive such as a hard disk drive or a network drive. However, the license store 38 may be embodied in any other form without departing from the spirit and scope of the present invention, so long as such license store 38 performs the function of storing licenses 16 in a location relatively convenient to the DRM system 32.
DRM System 32 Components—State Store 40
The state store 40 performs the function of maintaining state information corresponding to licenses 16 presently or formerly in the license store 38. Such state information is created by the DRM system 32 and stored in the state store 40 as necessary. For example, if a particular license 16 only allows a pre-determined number of renderings of a piece of corresponding digital content 12, the state store 40 maintains state information on how many renderings have in fact taken place in connection with such license 16. The state store 40 continues to maintain state information on licenses 16 that are no longer in the license store 38 to avoid the situation where it would otherwise be advantageous to delete a license 16 from the license store 38 and then obtain an identical license 16 in an attempt to delete the corresponding state information from the state store 40.
The state store 40 also has to be trusted in order to ensure that the information stored therein is not reset to a state more favorable to a user. Accordingly, the state store 40 is likewise run in a protected or shrouded environment such that the user is denied access to such state store 40. Once again, other protective measures may of course be employed in connection with the state store 40 without departing from the spirit and scope of the present invention. For example, the state store 40 may be stored by the DRM system 32 on the computing device 14 in an encrypted form.
DRM System 32—Content Rendering, Part 2
Referring again to
As a first step, and referring now to
As was discussed above in connection with
Assume now that the DRM system 32 has been requested to render a piece of digital content 12, and one or more licenses 16 corresponding thereto are present in the license store 38. In one embodiment of the present invention, then, the license evaluator 36 of the DRM system 32 proceeds to determine for each such license 16 whether such license 16 itself is valid (steps 603 and 605 of
Assuming that one or more valid licenses 16 are found, for each valid license 16, the license evaluator 36 of the DRM system 32 next determines whether such valid license 16 gives the user the right to render the corresponding digital content 12 in the manner desired (i.e., is enabling) (steps 607 and 609). In particular, the license evaluator 36 determines whether the requesting user has the right to play the requested digital content 12 based on the rights description in each license 16 and based on what the user is attempting to do with the digital content 12. For example, such rights description may allow the user to render the digital content 12 into a sound, but not into a decrypted digital copy.
As should be understood, the rights description in each license 16 specifies whether the user has rights to play the digital content 12 based on any of several factors, including who the user is, where the user is located, what type of computing device 14 the user is using, what rendering application 34 is calling the DRM system 32, the date, the time, etc. In addition, the rights description may limit the license 16 to a pre-determined number of plays, or pre-determined play time, for example. In such case, the DRM system 32 must refer to any state information with regard to the license 16, (i.e., how many times the digital content 12 has been rendered, the total amount of time the digital content 12 has been rendered, etc.), where such state information is stored in the state store 40 of the DRM system 32 on the user's computing device 14.
Accordingly, the license evaluator 36 of the DRM system 32 reviews the rights description of each valid license 16 to determine whether such valid license 16 confers the rights sought to the user. In doing so, the license evaluator 36 may have to refer to other data local to the user's computing device 14 to perform a determination of whether the user has the rights sought. As seen in
Of course, in some instances the user cannot obtain the right to render the digital content 12 in the manner requested, because the content owner of such digital content 12 has in effect directed that such right not be granted. For example, the content owner of such digital content 12 may have directed that no license 16 be granted to allow a user to print a text document, or to copy a multimedia presentation into an un-encrypted form. In one embodiment of the present invention, the digital content 12 includes data on what rights are available upon purchase of a license 16, and types of licenses 16 available. However, it will be recognized that the content owner of a piece of digital content 12 may at any time change the rights currently available for such digital content 12 by changing the licenses 16 available for such digital content 12.
DRM System 32—License Acquisition
Referring now to
In one embodiment of the present invention, such license acquisition information may include (among other things) types of licenses 16 available, and one or more Internet web sites or other site information at which one or more appropriate license servers 24 may be accessed, where each such license server 24 is in fact capable of issuing a license 16 corresponding to the digital content 12. Of course, the license 16 may be obtained in other manners without departing from the spirit and scope of the present invention. For example, the license 16 may be obtained from a license server 24 at an electronic bulletin board, or even in person or via regular mail in the form of a file on a magnetic or optical disk or the like.
Assuming that the location for obtaining a license 16 is in fact a license server 24 on a network, the license evaluator 36 then establishes a network connection to such license server 24 based on the web site or other site information, and then sends a request for a license 16 from such connected license server 24 (steps 701, 703). In particular, once the DRM system 32 has contacted the license server 24, such DRM system 32 transmits appropriate license request information 36 to such license server 24. In one embodiment of the present invention, such license 16 request information 36 may include:
Once the license server 24 has received the license 16 request information 36 from the DRM system 32, the license server 24 may then perform several checks for trust authentication and for other purposes. In one embodiment of the present invention, such license server 24 checks the certificate with the digital signature of the certifying authority to determine whether such has been adulterated or otherwise modified (steps 705, 707). If so, the license server 24 refuses to grant any license 16 based on the request information 36. The license server 24 may also maintain a list of known ‘bad’ users and/or user's computing devices 14, and may refuse to grant any license 16 based on a request from any such bad user and/or bad user's computing device 14 on the list. Such ‘bad’ list may be compiled in any appropriate manner without departing from the spirit and scope of the present invention.
Based on the received request and the information associated therewith, and particularly based on the content ID (or package ID) in the license request information, the license server 24 can interrogate the content-key database 20 (
As mentioned above, multiple types of licenses 16 may be available. For example, for a relatively small license fee, a license 16 allowing a limited number of renderings may be available. For a relatively greater license fee, a license 16 allowing unlimited renderings until an expiration date may be available. For a still greater license fee, a license 16 allowing unlimited renderings without any expiration date may be available. Practically any type of license 16 having any kind of license terms may be devised and issued by the license server 24 without departing from the spirit and scope of the present invention.
In one embodiment of the present invention, the request for a license 16 is accomplished with the aid of a web page or the like as transmitted from the license server 24 to the user's computing device 14. Preferably, such web page includes information on all types of licenses 16 available from the license server 24 for the digital content 12 that is the basis of the license 16 request.
In one embodiment of the present invention, prior to issuing a license 16, the license server 24 checks the version number of the black box 30 to determine whether such black box 30 is relatively current (steps 709, 711). As should be understood, the black box 30 is intended to be secure and protected from attacks from a user with nefarious purposes (i.e., to improperly render digital content 12 without a license 16, or outside the terms of a corresponding license 16). However, it is to be recognized that no system and no software device is in fact totally secure from such an attack.
As should also be understood, if the black box 30 is relatively current, i.e., has been obtained or updated relatively recently, it is less likely that such black box 30 has been successfully attacked by such a nefarious user. Preferably, and as a matter of trust, if the license server 24 receives a license request with request information 36 including a black box 30 version number that is not relatively current, such license server 24 refuses to issue the requested license 16 until the corresponding black box 30 is upgraded to a current version, as will be described below. Put simply, the license server 24 will not trust such black box 30 unless such black box 30 is relatively current.
In the context of the black box 30 of the present invention, the term ‘current’ or ‘relatively current’ may have any appropriate meaning without departing from the spirit and scope of the present invention, consistent with the function of providing trust in the black box 30 based on the age or use thereof. For example, ‘current’ may be defined according to age (i.e., less than one month old). As an alternative example, ‘current’ may be defined based on a number of times that the black box 30 has decrypted digital content 12 (i.e., less than 200 instances of decryption). Moreover, ‘current’ may be based on policy as set by each license server 24, where one license server 24 may define ‘current’ differently from another license server 24, and a license server 24 may further define ‘current’ differently depending on the digital content 12 for which a license 16 is requested, or depending on the type of license 16 requested, among other things.
Assuming that the license server 24 is satisfied from the version number of a black box 30 or other indicia thereof that such black box 30 is current, the license server 24 then proceeds to negotiate terms and conditions for the license 16 with the user (step 713). Alternatively, the license server 24 negotiates the license 16 with the user, then satisfies itself from the version number of the black box 30 that such black box 30 is current (i.e., performs step 713, then step 711). Of course, the amount of negotiation varies depending on the type of license 16 to be issued, and other factors. For example, if the license server 24 is merely issuing a paid-up unlimited use license 16, very little need be negotiated. On the other hand, if the license 16 is to be based on such items as varying values, sliding scales, break points, and other details, such items and details may need to be worked out between the license server 24 and the user before the license 16 can be issued.
As should be understood, depending on the circumstances, the license negotiation may require that the user provide further information to the license server 24 (for example, information on the user, the user's computing device 14, etc.). Importantly, the license negotiation may also require that the user and the license server 24 determine a mutually acceptable payment instrument (a credit account, a debit account, a mailed check, etc.) and/or payment method (paid-up immediately, spread over a period of time, etc.), among other things.
Once all the terms of the license 16 have been negotiated and agreed to by both the license server 24 and user (step 715), a digital license 16 is generated by the license server 24 (step 719), where such generated license 16 is based at least in part on the license request, the black box 30 public key (PU-BB), and the decryption key (KD) for the digital content 12 that is the basis of the request as obtained from the content-key database 20. In one embodiment of the present invention, and as seen in
As should be understood, the aforementioned elements and perhaps others are packaged into a digital file or some other appropriate form. As should also be understood, if the DRL 48 or (PU-BB (KD)) in the license 16 should become adulterated or otherwise modified, the digital signature (S (PR-LS)) in the license 16 will not match and therefore will not validate such license 16. For this reason, the DRL 48 need not necessarily be in an encrypted form (i.e., (KD(DRL)) as mentioned above), although such encrypted form may in some instances be desirable and therefore may be employed without departing from the spirit and scope of the present invention.
Once the digital license 16 has been prepared, such license 16 is then issued to the requestor (i.e., the DRM system 32 on the user's computing device 14) (step 719 of
It is to be understood that a user's computing device 14 may on occasion malfunction, and licenses 16 stored in the license store 38 of the DRM system 32 on such user's computing device 14 may become irretrievably lost. Accordingly, it is preferable that the license server 24 maintain a database 50 of issued licenses 16 (
DRM System 32—Installation/Upgrade of Black Box 30
As was discussed above, as part of the function of acquiring a license 16, the license server 24 may deny a request for a license 16 from a user if the user's computing device 14 has a DRM system 32 with a black box 30 that is not relatively current, i.e., has a relatively old version number. In such case, it is preferable that the black box 30 of such DRM system 32 be upgraded so that the license acquisition function can then proceed. Of course, the black box 30 may be upgraded at other times without departing from the spirit and scope of the present invention.
Preferably, as part of the process of installing the DRM system 32 on a user's computing device 14, a non-unique ‘lite’ version of a black box 30 is provided. Such ‘lite’ black box 30 is then upgraded to a unique regular version prior to rendering a piece of digital content 12. As should be understood, if each black box 30 in each DRM system 32 is unique, a security breach into one black box 30 cannot easily be replicated with any other black box 30.
Referring now to
Thereafter, the black box server 26 generates a new unique black box 30 (step 903). As seen in
Preferably, and as was discussed above, the black box server 26 includes a new unique public/private key pair (PU-BB, PR-BB) with the newly generated unique black box 30 (step 903 of
Most any hiding scheme may be employed without departing from the spirit and scope of the present invention, so long as such hiding scheme in fact performs the function of hiding the private key (PR-BB) from the world. As but one example, the private key (PR-BB) may be split into several sub-components, and each sub-component may be encrypted uniquely and stored in a different location. In such a situation, it is preferable that such sub-components are never assembled in full to produce the entire private key (PR-BB).
In one embodiment of the present invention, such private key (PR-BB) is encrypted according to code-based encryption techniques. In particular, in such embodiment, the actual software code of the black box 30 (or other software code) is employed as encrypting key(s). Accordingly, if the code of the black box 30 (or the other software code) becomes adulterated or otherwise modified, for example by a user with nefarious purposes, such private key (PR-BB) cannot be decrypted.
Although each new black box 30 is delivered with a new public/private key pair (PU-BB, PR-BB), such new black box 30 is also preferably given access to old public/private key pairs from old black boxes 30 previously delivered to the DRM system 32 on the user's computing device 14 (step 905). Accordingly, the upgraded black box 30 can still employ the old key pairs to access older digital content 12 and older corresponding licenses 16 that were generated according to such old key pairs, as will be discussed in more detail below.
Preferably, the upgraded black box 30 delivered by the black box server 26 is tightly tied to or associated with the user's computing device 14. Accordingly, the upgraded black box 30 cannot be operably transferred among multiple computing devices 14 for nefarious purposes or otherwise. In one embodiment of the present invention, as part of the request for the black box 30 (step 901) the DRM system 32 provides hardware information unique to such DRM system 32 and/or unique to the user's computing device 14 to the black box server 26, and the black box server 26 generates a black box 30 for the DRM system 32 based in part on such provided hardware information. Such generated upgraded black box 30 is then delivered to and installed in the DRM system 32 on the user's computing device 14 (steps 907, 909). If the upgraded black box 30 is then somehow transferred to another computing device 14, the transferred black box 30 recognizes that it is not intended for such other computing device 14, and does not allow any requested rendering to proceed on such other computing device 14.
Once the new black box 30 is installed in the DRM system 32, such DRM system 32 can proceed with a license acquisition function or with any other function.
DRM System 32—Content Rendering, Part 3
Referring now to
Once the black box 30 has the decryption key (KD) for the digital content 12 and permission from the license evaluator 36 to render the digital content 12, control may be returned to the rendering application 34 (steps 525, 527). In one embodiment of the present invention, the rendering application 34 then calls the DRM system 32/black box 30 and directs at least a portion of the encrypted digital content 12 to the black box 30 for decryption according to the decryption key (KD) (step 529). The black box 30 decrypts the digital content 12 based upon the decryption key (KD) for the digital content 12, and then the black box 30 returns the decrypted digital content 12 to the rendering application 34 for actual rendering (steps 533, 535). The rendering application 34 may either send a portion of the encrypted digital content 12 or the entire digital content 12 to the black box 30 for decryption based on the decryption key (KD) for such digital content 12 without departing from the spirit and scope of the present invention.
Preferably, when the rendering application 34 sends digital content 12 to the black box 30 for decryption, the black box 30 and/or the DRM system 32 authenticates such rendering application 34 to ensure that it is in fact the same rendering application 34 that initially requested the DRM system 32 to run (step 531). Otherwise, the potential exists that rendering approval may be obtained improperly by basing the rendering request on one type of rendering application 34 and in fact rendering with another type of rendering application 34. Assuming the authentication is successful and the digital content 12 is decrypted by the black box 30, the rendering application 34 may then render the decrypted digital content 12 (steps 533, 535).
Sequence of Key Transactions
Referring now to
Bearing in mind that each license 16 for the digital content 12, as seen in
and also bearing in mind that the package 12p having the digital content 12, as seen in
in one embodiment of the present invention, the specific sequence of key transactions that are performed with regard to a specific one of the licenses 16 for the digital content 12 is as follows:
1. Based on (PU-BB (KD)) from the license 16, the black box 30 of the DRM system 32 on the user's computing device 14 applies its private key (PR-BB) to obtain (KD) (step 1001). (PR-BB (PU-BB (KD))=(KD)). Note, importantly, that the black box 30 could then proceed to employ KD to decrypt the digital content 12 without any further ado. However, and also importantly, the license server 24 trusts the black box 30 not to do so. Such trust was established at the time such license server 24 issued the license 16 based on the certificate from the certifying authority vouching for the trustworthiness of such black box 30. Accordingly, despite the black box 30 obtaining the decryption key (KD) as an initial step rather than a final step, the DRM system 32 continues to perform all license 16 validation and evaluation functions, as described below.
2. Based on (KD (PU-CS) S (PR-CS)) from the digital content 12, the black box 30 applies the newly obtained decryption key (KD) to obtain (PU-CS) (step 1003). (KD (KD (PU-CS))=(PU-CS)). Additionally, the black box 30 can apply (PU-CS) as against the signature (S (PR-CS)) to satisfy itself that such signature and such digital content 12/package 12p is valid (step 1005). If not valid, the process is halted and access to the digital content 12 is denied.
3. Based on (CERT (PU-LS) S (PR-CS)) from the license 16, the black box 30 applies the newly obtained content server 22 public key (PU-CS) to satisfy itself that the certificate is valid (step 1007), signifying that the license server 24 that issued the license 16 had the authority from the content server 22 to do so, and then examines the certificate contents to obtain (PU-LS) (step 1009). If not valid, the process is halted and access to the digital content 12 based on the license 16 is denied.
4. Based on (S (PR-LS)) from the license 16, the black box 30 applies the newly obtained license server 24 public key (PU-LS) to satisfy itself that the license 16 is valid (step 1011). If not valid, the process is halted and access to the digital content 12 based on the license 16 is denied.
5. Assuming all validation steps are successful, and that the DRL 48 in the license 16 is in fact encrypted with the decryption key (KD), the license evaluator 36 then applies the already-obtained decryption key (KD) to (KD(DRL)) as obtained from the license 16 to obtain the license terms from the license 16 (i.e., the DRL 48) (step 1013). Of course, if the DRL 48 in the license 16 is not in fact encrypted with the decryption key (KD), step 1013 may be omitted. The license evaluator 36 then evaluates/interrogates the DRL 48 and determines whether the user's computing device 14 has the right based on the DRL 48 in the license 16 to render the corresponding digital content 12 in the manner sought (i.e., whether the DRL 48 is enabling) (step 1015). If the license evaluator 36 determines that such right does not exist, the process is halted and access to the digital content 12 based on the license 16 is denied.
6. Finally, assuming evaluation of the license 16 results in a positive determination that the user's computing device 14 has the right based on the DRL 48 terms to render the corresponding digital content 12 in the manner sought, the license evaluator 36 informs the black box 30 that such black box 30 can render the corresponding digital content 12 according to the decryption key (KD). The black box 30 thereafter applies the decryption key (KD) to decrypt the digital content 12 from the package 12p (i.e., (KD(KD(CONTENT))=(CONTENT)) (step 1017).
It is important to note that the above-specified series of steps represents an alternating or ‘ping-ponging’ between the license 16 and the digital content 12. Such ping-ponging ensures that the digital content 12 is tightly bound to the license 16, in that the validation and evaluation process can only occur if both the digital content 12 and license 16 are present in a properly issued and valid form. In addition, since the same decryption key (KD) is needed to get the content server 22 public key (PU-CS) from the license 16 and the digital content 12 from the package 12p in a decrypted form (and perhaps the license terms (DRL 48) from the license 16 in a decrypted form), such items are also tightly bound. Signature validation also ensures that the digital content 12 and the license 16 are in the same form as issued from the content server 22 and the license server 24, respectively. Accordingly, it is difficult if not impossible to decrypt the digital content 12 by bypassing the license server 24, and also difficult if not impossible to alter and then decrypt the digital content 12 or the license 16.
In one embodiment of the present invention, signature verification, and especially signature verification of the license 16, is alternately performed as follows. Rather than having a signature encrypted by the private key of the license server 16 (PR-LS), as is seen in
In particular, in such embodiment:
1. the license server 24 provides its public key (PU-LS) to the root entity;
2. the root entity returns the license server public key (PU-LS) to such license server 24 encrypted with the private root key (PR-R) (i.e., (CERT (PU-LS) S (PR-R))); and
3. the license server 24 then issues a license 16 with a signature encrypted with the license server private key (S (PR-LS)), and also attaches to the license the certificate from the root entity (CERT (PU-LS) S (PR-R)).
For a DRM system 18 to validate such issued license 16, then, the DRM system 18:
1. applies the public root key (PU-R) to the attached certificate (CERT (PU-LS) S (PR-R)) to obtain the license server public key (PU-LS); and
2. applies the obtained license server public key (PU-LS) to the signature of the license 16 (S (PR-LS).
Importantly, it should be recognized that just as the root entity gave the license server 24 permission to issue licenses 16 by providing the certificate (CERT (PU-LS) S (PR-R)) to such license server 24, such license server 24 can provide a similar certificate to a second license server 24 (i.e., (CERT (PU-LS2) S (PR-LS1)), thereby allowing the second license server to also issue licenses 16. As should now be evident, a license 16 issued by the second license server would include a first certificate (CERT (PU-LS1) S (PR-R)) and a second certificate (CERT (PU-LS2) S (PR-LS1)). Likewise, such license 16 is validated by following the chain through the first and second certificates. Of course, additional links in the chain may be added and traversed.
One advantage of the aforementioned signature verification process is that the root entity may periodically change the private root key (PR-R), thereby likewise periodically requiring each license server 24 to obtain a new certificate (CERT (PU-LS) S (PR-R)). Importantly, as a requirement for obtaining such new certificate, each license server may be required to upgrade itself. As with the black box 30, if a license server 24 is relatively current, i.e., has been upgraded relatively recently, it is less likely that license server 24 has been successfully attacked. Accordingly, as a matter of trust, each license server 24 is preferably required to be upgraded periodically via an appropriate upgrade trigger mechanism such as the signature verification process. Of course, other upgrade mechanisms may be employed without departing from the spirit and scope of the present invention.
Of course, if the private root key (PR-R) is changed, then the public root key (PU-R) in each DRM system 18 must also be changed. Such change may for example take place during a normal black box 30 upgrade, or in fact may require that a black box 30 upgrade take place. Although a changed public root key (PU-R) may potentially interfere with signature validation for an older license 16 issued based on an older private root key (PR-R), such interference may be minimized by requiring that an upgraded black box 30 remember all old public root keys (PU-R). Alternatively, such interference may be minimized by requiring signature verification for a license 16 only once, for example the first time such license 16 is evaluated by the license evaluator 36 of a DRM system 18. In such case, state information on whether signature verification has taken place should be compiled, and such state information should be stored in the state store 40 of the DRM system 18.
Digital Rights License 48
In the present invention, the license evaluator 36 evaluates a Digital Rights License (DRL) 48 as the rights description or terms of a license 16 to determine if such DRL 48 allows rendering of a corresponding piece of digital content 12 in the manner sought. In one embodiment of the present invention, the DRL 48 may be written by a licensor (i.e., the content owner) in any DRL language.
As should be understood, there are a multitude of ways to specify a DRL 48. Accordingly, a high degree of flexibility must be allowed for in any DRL language. However, it is impractical to specify all aspects of a DRL 48 in a particular license language, and it is highly unlikely that the author of such a language can appreciate all possible licensing aspects that a particular digital licensor may desire. Moreover, a highly sophisticated license language may be unnecessary and even a hindrance for a licensor providing a relatively simple DRL 48. Nevertheless, a licensor should not be unnecessarily restricted in how to specify a DRL 48. At the same time, the license evaluator 36 should always be able to get answers from a DRL 48 regarding a number of specific license questions.
In the present invention, and referring now to
Typically, the language engine 52 is in the form of an executable file or set of files that reside in a memory of the user's computing device 14, such as a hard drive. The language engine 52 assists the license evaluator 36 to directly interrogate the DRL 48, the license evaluator 36 interrogates the DRL 48 indirectly via the language engine 48 acting as an intermediary, or the like. When executed, the language engine 52 runs in a work space in a memory of the user's computing device 14, such as RAM. However, any other form of language engine 52 may be employed without departing from the spirit and scope of the present invention.
Preferably, any language engine 52 and any DRL language supports at least a number of specific license questions that the license evaluator 36 expects to be answered by any DRL 48, as will be discussed below. Accordingly, the license evaluator 36 is not tied to any particular DRL language; a DRL 48 may be written in any appropriate DRL language; and a DRL 48 specified in a new license language can be employed by an existing license evaluator 36 by having such license evaluator 36 obtain a corresponding new language engine 52.
DRL Languages
Two examples of DRL languages, as embodied in respective DRLs 48, are provided below. The first, ‘simple’ DRL 48 is written in a DRL language that specifies license attributes, while the second ‘script’ DRL 48 is written in a DRL language that can perform functions according to the script specified in the DRL 48. While written in a DRL language, the meaning of each line of code should be apparent based on the linguistics thereof and/or on the attribute description chart that follows:
Simple DRL 48:
Script DRL 48:
In the two DRLs 48 specified above, the attributes listed have the following descriptions and data types:
Methods
As was discussed above, it is preferable that any language engine 52 and any DRL language support at least a number of specific license questions that the digital license evaluator 36 expects to be answered by any DRL 48. Recognizing such supported questions may include any questions without departing from the spirit and scope of the present invention, and consistent with the terminology employed in the two DRL 48 examples above, in one embodiment of the present invention, such supported questions or ‘methods’ include ‘access methods’, ‘DRL methods’, and ‘enabling use methods’, as follows:
Access Methods
Access methods are used to query a DRL 48 for top-level attributes.
VARIANT QueryAttribute (BSTR key)
Valid keys include License.Name, License.Id, Content.Name, Content.Id, Content.Type, Owner.Name, Owner.Id, Owner.PublicKey, Licensee.Name, Licensee.Id, Licensee.PublicKey, Description, and Terms, each returning a BSTR variant; and Issued, Validity.Start and Validity.End, each returning a Date Variant.
DRL Methods
The implementation of the following DRL methods varies from DRL 48 to DRL 48. Many of the DRL methods contain a variant parameter labeled ‘data’ which is intended for communicating more advanced information with a DRL 48. It is present largely for future expandability.
Boolean IsActivated(Variant data)
This method returns a Boolean indicating whether the DRL 48/license 16 is activated. An example of an activated license 16 is a limited operation license 16 that upon first play is active for only 48 hours.
Activate(Variant data)
This method is used to activate a license 16. Once a license 16 is activated, it cannot be deactivated.
Variant QueryDRL(Variant data)
This method is used to communicate with a more advanced DRL 48. It is largely about future expandability of the DRL 48 feature set.
Variant GetExpires(BSTR action, Variant data)
This method returns the expiration date of a license 16 with regard to the passed-in action. If the return value is NULL, the license 16 is assumed to never expire or does not yet have an expiration date because it hasn't been activated, or the like.
Variant GetCount(BSTR action, Variant data)
This method returns the number of operations of the passed-in action that are left. If NULL is returned, the operation can be performed an unlimited number of times.
Boolean IsEnabled(BSTR action, Variant data)
This method indicates whether the license 16 supports the requested action at the present time.
Boolean IsSunk(BSTR action, Variant data)
This method indicates whether the license 16 has been paid for. A license 16 that is paid for up front would return TRUE, while a license 16 that is not paid for up front, such as a license 16 that collects payments as it is used, would return FALSE.
Enabling Use Methods.
These methods are employed to enable a license 16 for use in decrypting content.
Boolean Validate (BSTR key)
This method is used to validate a license 16. The passed-in key is the black box 30 public key (PU-BB) encrypted by the decryption key (KD) for the corresponding digital content 12 (i.e., (KD(PU-BB))) for use in validation of the signature of the license 16. A return value of TRUE indicates that the license 16 is valid. A return value of FALSE indicates invalid.
int OpenLicense 16(BSTR action, BSTR key, Variant data)
This method is used to get ready to access the decrypted enabling bits. The passed-in key is (KD(PU-BB)) as described above. A return value of 0 indicates success. Other return values can be defined.
BSTR GetDecryptedEnablingBits (BSTR action, Variant data)
Variant GetDecryptedEnablingBitsAsBinary (BSTR action, Variant Data)
These methods are used to access the enabling bits in decrypted form. If this is not successful for any of a number of reasons, a null string or null variant is returned.
void CloseLicense 16 (BSTR action, Variant data)
This method is used to unlock access to the enabling bits for performing the passed-in action. If this is not successful for any of a number of reasons, a null string is returned.
Heuristics
As was discussed above, if multiple licenses 16 are present for the same piece of digital content 12, one of the licenses 16 must be chosen for further use. Using the above methods, the following heuristics could be implemented to make such choice. In particular, to perform an action (say APLAY@) on a piece of digital content 12, the following steps could be performed:
1. Get all licenses 16 that apply to the particular piece of digital content 12.
2. Eliminate each license 16 that does not enable the action by calling the IsEnabled function on such license 16.
3. Eliminate each license 16 that is not active by calling IsActivated on such license 16.
4. Eliminate each license 16 that is not paid for up front by calling IsSunk on such license 16.
5. If any license 16 is left, use it. Use an unlimited-number-of-plays license 16 before using a limited-number-of-plays license 16, especially if the unlimited-number-of-plays license 16 has an expiration date. At any time, the user should be allowed to select a specific license 16 that has already been acquired, even if the choice is not cost-effective. Accordingly, the user can select a license 16 based on criteria that are perhaps not apparent to the DRM system 32.
6. If there are no licenses 16 left, return status so indicating. The user would then be given the option of:
using a license 16 that is not paid for up front, if available;
activating a license 16, if available; and/or
performing license acquisition from a license server 24.
Retail Transaction
As is to be appreciated, there are a multitude of scenarios in which a customer may obtain a piece of digital content 12 and also obtain a corresponding yet separate digital license 16. For one example, the customer may visit a retailer and upon payment of a fee thereto obtain the aforementioned content 12 and the license 16 from a licensor. For another example, the customer may obtain the content 12 as originally distributed by way of a retailer or as re-distributed from an intermediary, and then visit a licensor and upon payment of a fee thereto obtain the license 16. While it is envisioned that either of the aforementioned scenarios is implemented by way of an inter-communicating network of computers such as the Internet, and specifically by appropriately configured Internet web sites or the like and Internet web pages or the like, it is to be understood that other implementing communicative assemblages and devices may be employed without departing from the spirit and scope of the present invention.
As used herein, a retailer is any sales agent operating a sales site for ‘selling’ the content 12, whether or not the retailer actually operates a content server 22, whether or not the retailer actually obtains a payment in exchange for a license 16, whether or not the retailer actually obtains a payment separately and apart from the license 16 for the content 12 itself, and whether or not the retailer actually distributes the content 12 or directs the customer to another site for distribution of the content 12. As used herein, a licensor is any licensing agent that operates a licensing site for granting a license 16, whether or not the licensor actually obtains a payment in exchange for a license 16.
In any case, the party collecting the payment (i.e., the retailer or the licensor) likely is expected to share the proceeds with the other party (i.e., the licensor or the retailer). Also, if the obtained content 12 is re-distributed to another individual (a friend of the customer, e.g.), and the individual obtains its own license 16 by way of payment to the retailer or the licensor, the retailer and licensor likely wish to share the proceeds from that payment, too. Moreover, if the same originally obtained content 12 is re-distributed several times, the retailer and licensor may wish to share the proceeds from payments for corresponding licenses 16 in a manner dependent on the number of licenses 16 issued in connection with the originally obtained content 12. In such a situation, then, a mechanism is necessary whereby a license count is maintained with regard to the originally obtained content 12. Also, in the case where the retailer collects payment, a mechanism is necessary whereby the licensor is assured that such payment is in fact collected prior to issuing the license 16.
Retail Transaction—Paying the Licensor/License Server 24
In one scenario, and in one embodiment of the present invention, a customer obtains content 12 either as distributed directly from a retailer or as re-distributed by way of one or more intermediaries and thus indirectly from a retailer. Thereafter, such customer obtains the corresponding yet separate license 16 from a licensor operating a license server 24, where the licensor collects a payment from the customer in exchange for the obtained license 16.
Here, the licensor likely is expected to share the payment with the retailer, both in the situation where the content 12 is distributed and re-distributed. Accordingly, the retailer needs to be able to identify itself to the licensor in order to collect from such licensor its shared portion of the payment. In addition, the retailer and licensor may wish to share the payments for multiple licenses 16 based on the same originally distributed content in a manner dependent on the number of such licenses 16. Accordingly, a license count is maintained by the licensor with regard to the originally distributed content 12.
In one embodiment of the present invention, then, and referring now to
As was discussed above in connection with
www.LicenseServer.com/issuelicense?ItemID=xxxxxxxxxxxxx
Of course, the URL with the ItemID field may take any appropriate form without departing from the spirit and scope of the present invention. As should be appreciated, the ItemID field is not used by the content server 22 but instead is set aside for later use by the retailer 60, as will be discussed below. The package 12p with the content 12 and the URL with the ItemID field is thus delivered to the retailer 60 by way of any appropriate delivery channel (step 1403). In an alternative, the retailer 60 controls the content server 22, and therefore can immediately populate the ItemID field in the manner set forth below (step 1405).
The retailer 60 holds the content 12 and distributes such content 12 to a customer 62 upon request therefrom. Importantly, in the present context, the retailer distributes the content 12/package 12p to the customer 62 without collecting any license fees therefrom. That is, while the retailer 60 may choose to collect a payment from the customer in exchange for distributing the package 12p thereto, such payment is more in the nature of a download or transaction fee, and not a fee for a corresponding license 16. As seen below, such a license fee is in fact collected by a license server 24 in the present context. As may be appreciated, the mechanisms employed to distribute the content 12/package 12p to the customer 62 may be any particular mechanisms without departing from the spirit and scope of the present invention. For example, the package 12p may be downloaded from a file transfer server or the like. Such mechanisms are known or should be apparent to the relevant public and therefore need not be described herein in any detail.
Importantly, in the present context, prior to distributing the package 12p having the content 12 to the customer 62 (step 1409), the retailer modifies the ItemiD field in the URL for the license server 24 to include:
www.LicenseServer.com/issuelicense?ItemID=[cpID, retailerID, etc.]
(step 1407). In addition, the retailer 60 may add other information without departing from the spirit and scope of the present invention. For example, such other information may include an identification of the customer, a time stamp, and/or a digital signature. At least a portion of the modified ItemID field may be in an encrypted form to prevent tampering. Alternatively, the digital signature may be based at least in part on a portion of the modified ItemID field so that changes to such modified ItemiD field, either innocent or nefarious, will cause the digital signature to fail to verify.
Notably, inclusion of the retailer ID and perhaps other information from the retailer 60 allows the retailer to indelibly mark the package 12p having the content 12 with information identifying the retailer 60. Thus, no matter how many times the package 12p is re-distributed (‘super-distributed’), the information identifying the retailer 60 remains with the package 12p. Accordingly, the origin of the package 12p and its progeny (i.e., the super-distributed copies of the package 12p) may always be determined. More importantly, and as will be seen below, the retailer 60 may be credited with not only the first sale of a license 16 for the package 12p, but also for all subsequent sales of licenses 16 for the package 12p and its progeny.
To recap, then, the package 12p as distributed to the customer 62 includes a customer package ID and a retailer ID as written in the ItemID field by the retailer 60. In addition, the package 12p includes a content ID identifying the content, as is seen in
The license server 24 upon receiving such license request and related information proceeds with the license issuance process in the manner described above in connection with
In one embodiment of the present invention, and specifically in the present context, the license server 24 de-constructs the ItemID field of the URL to obtain the customer package ID and the retailer ID, and also obtains the content ID (step 1415). Thus, the license server 24 knows the unique customer package 12p for which a license 16 is sought, the retailer 60 that sold the package 12p and that is owed at least a portion of the collected payment 64, and the content 12 that was in the package 12p. The license server 24 then proceeds to a database 66 and records such information therein for accounting and fee distribution purposes.
Specifically, and as seen in
Thus, the license server 24 finds the content ID entry in the database 66, or creates one if none is present (step 1417), finds the customer package ID—retailer ID sub-entry under such content ID entry, or creates one if none is present (step 1419), and increments the count in such sub-entry (step 1421). Accordingly, each time a license 16 is issued for a specific content ID—customer package ID—retailer ID combination, the associated count thereof is incremented. While the customer 62 presumably requests a single license 16 for the content 12, it must be remembered that the customer 62 may re-distribute the package 12p having the content 12 to one or more other customers 62a (
Importantly, by knowing the retailer ID, content ID, and customer package ID associated with a license request, the license server 24/licensor knows that it ‘owes’ the retailer 60 associated with such retailer ID at least a portion of the payment 64 previously received by such license server 24 (step 1413) in connection with issuing a license 16 for such content ID and customer package ID. Accordingly, at an appropriate time and in an appropriate manner, the payment 64 is in fact shared with the retailer 60 (step 1423). Correspondingly, if for some reason a license request came to the license server 24 without a retailer ID, the license server 24/licensor would not know which retailer 60 it owes in connection therewith. In such a situation, the license server 24 would likely refuse to issue such a license 16, or perhaps only issue a relatively restrictive license 16.
All of this of course assumes that the license server 24/licensor and the retailer have defined a business relationship wherein the portion of the payment 64 is in fact owed. Alternatively, it may be the case wherein no payment 64 is owed in the defined business relationship. Nevertheless, the license server 24/licensor can reliably determine from the retailer ID where the original copy of the package 12p was obtained.
Also importantly, with the count associated with each specific content ID—customer package ID—retailer ID combination, such license server 24/licensor can determine how the payment 64 is to be shared with the retailer 60, especially if the retailer 60 and licensor have already agreed to share the payments 64 for multiple licenses 16 based on the same originally distributed content 12 in a manner dependent on the number of such licenses 16.
In one embodiment of the present invention, the Item ID includes customer ID information identifying the customer that purchased the original package 12p. Thus, all progeny of the package 12p also identify the customer. Accordingly, the customer may be ‘credited’ for each license 16 obtained in connection with the package 12p and its progeny. Such customer credit may be monetary or non-monetary in nature, such as for example cash, redeemable points, rewards, etc.
In the present invention, and as may be appreciated, the content package 12p may include a package digital signature based on at least a portion of the content package 12p, such as the license acquisition information. In such case, modification of the URL by the retailer 60 will cause such digital signature to fail to verify. In one embodiment of the present invention and the present context thereof, then, the retailer 60 modifies the ItemID field in the URL to include the digital signature based at least in part on a portion of the modified ItemID field (‘the retailer digital signature’), as was discussed above, and such retailer digital signature is employed as the digital signature for the package 12p. Thus, if an element such as the DRM system 32 or the like checks such a package digital signature and finds that such package digital signature fails to verify, it should as a secondary measure check that such a retailer digital signature verifies. If so, the failure of the package digital signature to verify should be excused.
Retail Transaction—Paying the Retailer 60
In another scenario, and in another embodiment of the present invention, a customer 62 obtains content 12 as distributed directly from a retailer 60 in the course of a retail transaction wherein a license fee payment 64 is paid to such retailer 60. Importantly, as part of the overall transaction and as controlled by the retailer 60, the customer 62 obtains the corresponding yet separate license 16 from a licensor operating a license server 24. Here, the licensor/license server 24 collects a portion of the payment 64 that was received by the retailer in connection with the transaction. This requires that the retailer 60 identify itself to the license server 24 as part of the transaction. Otherwise, the license server 24 would not know who to go to collect the aforementioned portion of the payment 64. As discussed below, if the license server 24 cannot identify the retailer 60, the license server 24 will likely refuse to issue any license 16 in connection with the transaction, or perhaps will only issue a relatively restrictive license 16. In one embodiment of the present invention, and as seen in
In particular, in one embodiment of the present invention, and specifically in the present context, the customer 62 visits the retailer 60, perhaps by way of a web site or the like, selects a piece of digital content 12 for purchasing, and forwards to the retailer the appropriate payment 64 (step 1601 of
Importantly, in the present context, the retailer 60 does not initially deliver a content package 12p having the content 12 to the customer 62. Instead, in connection with receiving the payment 64 from the customer 62, the retailer 60 delivers to the customer 62 a null or dummy package 12p having no substantial content 12, but with license acquisition information (
Along with delivering the dummy package 12p, the retailer 60 also directs the customer to a site controlled by the retailer 60 and having a controller 68 that can control the DRM system 32 of the computing device 14 of the customer 62 (step 1605). Of course, this presumes that the customer 62 is accessing the retailer 60 and its sites by way of the computing device 14, and that the DRM system 32 is present on such computing device 14. In one embodiment of the present invention, the controller 68 is downloaded to the computing device 14 of the customer 62 as part of a page such as an HTML web page, although such controller 68 may be downloaded in other forms without departing from the spirit and scope of the present invention. Controlling aspects of a computing device 14 by way of a controller 68 at a site is known or should be apparent to the relevant public, and accordingly is not discussed herein in any detail.
In the present context, the controller 68 directs the DRM system 32 of the computing device 14 of the customer 62 to send a license request for a license 16 for the dummy package 12p (step 1607). The controller 68 may initiate the sending of the license request by direct command, or may initiate such sending of such license request by commanding that the dummy package 12p be played. As should be appreciated, the play command initiates a license search in the license store 38 (
As was discussed above, the license acquisition information in the dummy package 12p contains a URL or the like for a site controlled by the retailer 60. Thus, the aforementioned license request goes to the retailer 60 rather than the license server (step 1609). As may be appreciated, such action is necessary so that the retailer 60 can add certain information to the license request before forwarding same to the license server 24, where such added information identifies the retailer 60 to the license server 24 and acknowledges to the license server 24 that such retailer 60 owes a portion of the received payment 64.
Note that such information may instead be placed in the dummy package 12p prior to delivering such dummy package 12p to the customer 62 (step 1603). However, since such added information acts as the aforementioned acknowledgement, it is generally better not to include such added information until necessary. Otherwise, a nefarious entity may somehow obtain and employ the added information/acknowledgment and use it to obtain a license in the manner set forth below, even though the retailer 60 never collected any corresponding payment 64. Note, too, that the actual package 12p of the content 12 may initially be delivered to the customer. However, such delivery may take a substantial amount of time during which the retailer 60 is waiting to complete the transaction (collecting payment 64, adding the information, passing the license request off (see below)). Preferably, the transaction is completed relatively quickly, thus delivery of the actual package 12p is delayed until after the transaction is complete.
As should be recalled, the license request includes information from the computing device 14 of the customer 62 such as the public key of the black box 30 of the DRM system 32 (PU-BB) or another customer secret, among other things. Here, the retailer modifies the license request to retain such customer-based information, and to add retailer-based information, including but not limited to a retailer ID identifying the retailer, and a secret that proves to the license server 24 that the retailer 60 actually authorized issuance of a license 16 (step 1611). As should be appreciated, based on the added retailer-based information, the retailer 60 is in effect agreeing that it owes to the licensor/license server 24 a portion of the payment 64 received in connection with the transaction.
Of course, other information may be added/modified without departing from the spirit and scope of the present invention. For one example, the license request includes a content ID which may or may not be for the actual purchased content 12. If so, the content ID is left alone. If not, the content ID is modified to be for such actual purchased content 12. Of course, the retailer knows the correct content ID for the actual purchased content 12 based on the activities that occurred in connection with the selection and purchase thereof, as discussed above in connection with step 1601. Moreover, the modified license request may organized into any appropriate form without departing from the spirit and scope of the present invention, as long as such form is amenable to the license server 24.
Once the license request had been appropriately modified by the retailer 60, such retailer forwards such modified license request to the licensor/license server 24 (step 1613). Typically, the modified request is forwarded to a site identified by a site identifier such as a URL where such site is controlled by/run by the licensor/license server 24, although other identifying indicia may be employed without departing from the spirit and scope of the present invention.
At this point, the license server 24 has received the modified license request, and thus has information including: (1) the content ID for content 12 for which a license 16 has been requested; and (2) the public key of the black box 30 of the DRM system 32 (PU-BB) of the customer 62 or another customer secret, among other things. Thus, the license server 24 can prepare and issue a license 16 to the customer 62 based on the content ID and the PU-BB or other customer secret (step 1615). In the present context of the present invention, the license 16 is prepared and issued by the license server 24 in a manner such as that which was outlined above. However, other methods of license preparation may be employed without departing from the spirit and scope of the present invention.
In addition, based on the received modified license request, the license server 24 has information including: (3) the retailer ID identifying the retailer that collected a license fee payment 64, that authorized issuance of the requested license 16, and that owes the licensor/license server 24 at least a portion of the collected payment 64, among other things. Thus, and importantly, the license server 24/licensor can also note that the retailer 60 identified by the retailer ID owes the licensor/license server 24 at least a portion of the collected payment 64 (step 1617). In the present context of the present invention, the license server 24/licensor may note such debt in any appropriate manner without departing from the spirit and scope of the present invention. For one example, the license server 24/licensor may simply keep a running count in a database (not shown). For another example, the license server 24/licensor may maintain a database similar to if not identical with the database 66 discussed above. Thus, a count may be made based on the number of times the retailer 60 collects a license fee for particular content 12, or for particular content 12 as originally distributed to the customer 62, for example.
The license 16 as issued by the license server 24 is received by the customer 62 and appropriately stored in the license store 38 (
Of course, the customer 62 still does not have the actual package 12p with the content 12 that is the basis of the transaction. Accordingly, in one embodiment of the present context of the present invention, the controller 68 that was previously downloaded to the computing device 14 obtains such actual package 12p with the content 12 (step 1621). Such controller 68 may do so after sensing that the license 16 has been received and stored, or may do so after being directed by the license server 24, retailer 60, or another element to act after the license 16 has been received and stored. Of course, the controller 68 may take such action at other times and in response to other events without departing from the spirit and scope of the present invention.
Preferably, the controller 68 obtains the actual package 12p with the content 12 from a site identified by a site identifier, where such site identifier is provided to the controller 68. Such site identifier may be provided to the controller 68 by the license server 24, retailer 60, or another element, or the controller 68 may be downloaded to the computing device 14 with such site identifier attached thereto. Such site identifier may identify a content server 22, a site controlled by the license server 24, or another site without departing from the spirit and scope of the present invention. Preferably, the controller 68 performs/initiates such actions automatically and without any prompting on the part of the customer 62, such that the procedure appears to be transparent or seamless to such customer 62.
Now that the customer 62 has made payment 64 for the license 16, obtained the license 16, and obtained the corresponding content 12, such customer 62 is able to render the obtained content 12 according to the terms of the corresponding obtained license 16 (step 1623). Such rendering can be at the direction of the customer 62, or optionally may at least initially be automatically done by the controller 68. If the controller 68 directs such rendering such direction may be done automatically and without any prompting on the part of the customer 62, such that the procedure appears to be transparent or seamless to such customer 62.
Remembering now that the actual content 12 as downloaded in the actual content package 12p is freely re-distributable by the customer 62 to another individual 62a, the question arises as to what happens when the another individual 62a attempts to render such re-distributed content 12. As before, the render attempt initiates a license search in the license store 38 (
In one action, the license acquisition information includes the site identifier for the license server 24. However, since a license request based on such license acquisition information does not go through the retailer 60 and the retailer 60 does not add its retailer ID to the license request, the license request as received at the license server 24 includes no information as to where the licensor/license server 24 may obtain any license fee. Accordingly, the license server 24 refuses the license request or directs the individual 62a to the retailer 60 (or another retailer 60) to at a minimum make a license fee payment 64 and thereby initiate the series of events set forth in
In another action, the license acquisition information includes the site identifier for the retailer 60 (or another retailer 60). Again, the individual 62a may at a minimum make a license fee payment 64 to the retailer 60 and thereby initiate the series of events set forth in
In yet another action, the license acquisition information includes the site identifier for a general help page. Such help page may contain any kind of help information without departing from the spirit and scope of the present invention. For example, such help information may list one or more retailers 60 through which a license 16 may be requested, general information on how the license acquisition process works, etc.
In connection with any of the aforementioned actions, it is to be remembered that the individual 62a already has the actual content 12. Accordingly, such content 12 need not be delivered to such individual 62a, as in step 1621. Of course, such delivery may still take place without departing from the spirit and scope of the present invention.
As heretofore disclosed, in the present context the retailer employs a dummy package 12p and a controller 68 to trigger a ‘dummy’ license request from a customer 62 to such retailer 60 and thereby obtain customer information. Such customer information is necessary for the retailer 60 to make an actual license request from the retailer to a license server 24, where the actual license request includes the customer information and necessary retailer ID information among other thing. In an alternate embodiment of the present context of the present invention, the retailer 60 obtains the necessary customer information by direct request from the retailer 60 to the DRM system 32 of the customer 62 step 1625). Thus, the dummy package 12p is not necessary in such alternate embodiment. The controller 68 may be employed to effectuate the obtaining of the customer information by the retailer 60, or another device may be employed without departing from the spirit and scope of the present invention. In either embodiment, it is noted that the retailer 60 interposes itself between the customer 62 and the license server 24 to result in a license request to a license server 24 that includes both customer information and retailer ID information among other things.
The programming necessary to effectuate the processes performed in connection with the present invention is relatively straight-forward and should be apparent to the relevant programming public. Accordingly, such programming is not attached hereto. Any particular programming, then, may be employed to effectuate the present invention without departing from the spirit and scope thereof.
In the foregoing description, it can be seen that the present invention comprises a new and useful enforcement architecture 10 that allows the controlled rendering or playing of arbitrary forms of digital content 12, where such control is flexible and definable by the content owner of such digital content 12. Also, the present invention comprises a new useful controlled rendering environment that renders digital content 12 only as specified by the content owner, even though the digital content 12 is to be rendered on a computing device 14 which is not under the control of the content owner. Further, the present invention comprises a trusted component that enforces the rights of the content owner on such computing device 14 in connection with a piece of digital content 12, even against attempts by the user of such computing device 14 to access such digital content 12 in ways not permitted by the content owner.
It should be appreciated that changes could be made to the embodiments described above without departing from the inventive concepts thereof. It should be understood, therefore, that this invention is not limited to the particular embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims.
This application is a continuation application and claims priority to U.S. patent application Ser. No. 09/671,055, filed Sep. 28, 2000, entitled “RETAIL TRANSACTIONS INVOLVING DIGITAL CONTENT IN A DIGITAL RIGHTS MANAGEMENT (DRM) SYSTEM” which is incorporated herein by reference in its entirety. This application is also related to U.S. patent application Ser. No. 09/671,643 filed Sep. 28, 2000 entitled “RETAIL TRANSACTIONS INVOLVING DIGITAL CONTENT IN A DIGITAL RIGHT MANAGEMENT (DRM) SYSTEM”, and U.S. patent application Ser. No. 09/290,363, filed Apr. 12, 1999 entitled “ENFORCEMENT ARCHITECTURE AND METHOD FOR DIGITAL RIGHTS MANAGEMENT”, and U.S. Provisional Application No. 60/126,614, filed Mar. 27, 1999 entitled “ENFORCEMENT ARCHITECTURE AND METHOD FOR DIGITAL RIGHTS MANAGEMENT”, all of which are hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3718906 | Lightner | Feb 1973 | A |
| 4323921 | Guillou | Apr 1982 | A |
| 4528643 | Freeny, Jr. | Jul 1985 | A |
| 4529870 | Chaum | Jul 1985 | A |
| 4658093 | Hellman | Apr 1987 | A |
| 4683553 | Mollier | Jul 1987 | A |
| 4827508 | Shear | May 1989 | A |
| 4916738 | Chandra et al. | Apr 1990 | A |
| 4953209 | Ryder, Sr. et al. | Aug 1990 | A |
| 4977594 | Shear | Dec 1990 | A |
| 5023907 | Johnson et al. | Jun 1991 | A |
| 5047928 | Wiedemer | Sep 1991 | A |
| 5050213 | Shear | Sep 1991 | A |
| 5103392 | Mori | Apr 1992 | A |
| 5103476 | Waite et al. | Apr 1992 | A |
| 5109413 | Cpmerford et al. | Apr 1992 | A |
| 5117457 | Comerford et al. | May 1992 | A |
| 5193573 | Chronister | Mar 1993 | A |
| 5222134 | Waite et al. | Jun 1993 | A |
| 5319705 | Halter et al. | Jun 1994 | A |
| 5410598 | Shear | Apr 1995 | A |
| 5509070 | Schull | Apr 1996 | A |
| 5537314 | Kanter | Jul 1996 | A |
| 5553143 | Ross et al. | Sep 1996 | A |
| 5629980 | Stefik et al. | May 1997 | A |
| 5634012 | Stefik et al. | May 1997 | A |
| 5636277 | Nagahama | Jun 1997 | A |
| 5638443 | Stefik et al. | Jun 1997 | A |
| 5673316 | Auerbach et al. | Sep 1997 | A |
| 5708709 | Rose | Jan 1998 | A |
| 5710887 | Chelliah et al. | Jan 1998 | A |
| 5715403 | Stefik | Feb 1998 | A |
| 5757908 | Cooper et al. | May 1998 | A |
| 5765152 | Erickson | Jun 1998 | A |
| 5799088 | Raike | Aug 1998 | A |
| 5809144 | Sirbu et al. | Sep 1998 | A |
| 5845281 | Benson et al. | Dec 1998 | A |
| 5892900 | Ginter et al. | Apr 1999 | A |
| 6072874 | Shin et al. | Jun 2000 | A |
| 6073124 | Krishnan et al. | Jun 2000 | A |
| 6141754 | Choy | Oct 2000 | A |
| 6226618 | Downs et al. | May 2001 | B1 |
| 6266654 | Schull | Jul 2001 | B1 |
| 6374357 | Mohammed et al. | Apr 2002 | B1 |
| 6385596 | Wiser et al. | May 2002 | B1 |
| RE38007 | Tsukamoto et al. | Feb 2003 | E |
| 6539364 | Moribatake et al. | Mar 2003 | B2 |
| 6581331 | Kral | Jun 2003 | B1 |
| 6662164 | Koppelman et al. | Dec 2003 | B1 |
| 6684198 | Shimizu et al. | Jan 2004 | B1 |
| 6772340 | Peinado et al. | Aug 2004 | B1 |
| 6820064 | Currans et al. | Nov 2004 | B1 |
| 6885748 | Wang | Apr 2005 | B1 |
| 6959288 | Medina et al. | Oct 2005 | B1 |
| 6993131 | Meyers | Jan 2006 | B1 |
| 7039615 | Gajjala et al. | May 2006 | B1 |
| 7068787 | Ta et al. | Jun 2006 | B1 |
| 7103574 | Peinado et al. | Sep 2006 | B1 |
| 7149722 | Abburi | Dec 2006 | B1 |
| 7209892 | Galuten et al. | Apr 2007 | B1 |
| 20010032189 | Powell | Oct 2001 | A1 |
| 20010049667 | Moribatake et al. | Dec 2001 | A1 |
| 20020010681 | Hillegass et al. | Jan 2002 | A1 |
| 20020044654 | Maeda et al. | Apr 2002 | A1 |
| 20020063933 | Maeda et al. | May 2002 | A1 |
| 20020107809 | Biddle et al. | Aug 2002 | A1 |
| 20020188841 | Jones et al. | Dec 2002 | A1 |
| Number | Date | Country |
|---|---|---|
| 0 386 867 | Oct 1992 | EP |
| 0 709 760 | May 1996 | EP |
| 0 715 246 | Jun 1996 | EP |
| 0 715 247 | Jun 1996 | EP |
| 0 752 663 | Jan 1997 | EP |
| 0 798 892 | Oct 1997 | EP |
| 0 843 449 | May 1998 | EP |
| 0 849 658 | Jun 1998 | EP |
| 1 287 636 | Mar 2003 | EP |
| 0 725 512 | Sep 2003 | EP |
| 2291043 | Nov 1990 | JP |
| 2002183352 | Jun 2002 | JP |
| 3421950 | Jun 2003 | JP |
| 239865 | Jan 2000 | KR |
| WO 9301550 | Jan 1993 | WO |
| WO 9613013 | May 1996 | WO |
| WO 9624092 | Aug 1996 | WO |
| WO 9627155 | Sep 1996 | WO |
| WO 9725798 | Jul 1997 | WO |
| WO 9743761 | Nov 1997 | WO |
| WO 9809209 | Mar 1998 | WO |
| WO 9810391 | Mar 1998 | WO |
| WO 9821679 | May 1998 | WO |
| WO 9824037 | Jun 1998 | WO |
| WO 9837481 | Aug 1998 | WO |
| WO 9867481 | Aug 1998 | WO |
| WO 9842098 | Sep 1998 | WO |
| WO 9915970 | Apr 1999 | WO |
| WO 9953689 | Oct 1999 | WO |
| WO 0059150 | Oct 2000 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20060167817 A1 | Jul 2006 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09671055 | Sep 2000 | US |
| Child | 11392303 | US |
