Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20030002668 A1
Publication typeApplication
Application numberUS 09/896,537
Publication dateJan 2, 2003
Filing dateJun 30, 2001
Priority dateJun 30, 2001
Also published asCN1257648C, CN1531820A, DE10297014T5, WO2003005175A2, WO2003005175A3
Publication number09896537, 896537, US 2003/0002668 A1, US 2003/002668 A1, US 20030002668 A1, US 20030002668A1, US 2003002668 A1, US 2003002668A1, US-A1-20030002668, US-A1-2003002668, US2003/0002668A1, US2003/002668A1, US20030002668 A1, US20030002668A1, US2003002668 A1, US2003002668A1
InventorsGary Graunke, Michael Ripley, Ernie Brickell
Original AssigneeGary Graunke, Ripley Michael S., Ernie Brickell
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Multi-level, multi-dimensional content protections
US 20030002668 A1
Abstract
In one aspect of the invention is a method for a multi-level, and multi-dimensional scheme of content protection. Content having one or more attributes is encrypted using separate keys for each level of protection, where each level corresponds to an assurance of protection for each attribute. The content may be distributed to a number of environments having different levels of protection by transmitting a base key commensurate with the environment's subscription level. The base key may then be used generate lower level keys for accessing content at a level of protection less than or equal to that subscribed to.
Images(9)
Previous page
Next page
Claims(22)
What is claimed is:
1. A method comprising:
receiving content comprising a set of attributes having L through N levels of access, where L<N, and content at a given level of access being decryptable by a corresponding key;
receiving a base key corresponding to an M of N level of access, where LMN; and
deriving lower level keys based on the base key, the lower level keys being used to access content having an M level of access or lower.
2. The method of claim 1, additionally comprising receiving a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content, and said deriving lower level keys based on the base key comprises, for a given lower level key, using a function based on a matrix value corresponding to the lower level key and a one-way hash function of an adjacent higher level key.
3. The method of claim 1, wherein said deriving lower level keys based on the base key comprises, for a given lower level key, using a modular exponentiation of a higher level key.
4. A method comprising:
receiving a request for content at an M level of access, the content comprising a set of attributes having L through N levels of access, where L<N, and each level of access being represented by a grid point on a grid, and corresponding content being decryptable by a key corresponding to the level of access;
transmitting a base key corresponding to the M level of access; and transmitting a D-dimensional matrix for each attribute in the set of attributes, where D corresponds to a number of attributes of the content, and where the matrix comprises matrix values for determining how to generate a lower level key for decrypting content represented by a given grid point on the grid.
5. The method of claim 4, wherein a given lower level key in a 2 dimensional matrix, where X comprises a first matrix, and Y comprises a second matrix, is generated by at least one of:
the equation K i,j =X i,j H(K i+1,j); and the equation K i,j =Y i,j H(K i,j+1),
where Xi,j and Yi,j each comprises a matrix value corresponding to content attributes at a level of access represented by a grid point (i, j), and H(Ki+1,j) and H(Ki,j+1) each comprise a one-way hash value of a higher level key.
6. The method of claim 4, wherein a given lower level key in a 1 dimensional matrix represented by X is generated by the equation Ki=H(Ki+1).
7. A method comprising:
creating a hierarchy of keys, where each key is used to encrypt content having a set of attributes, and having one or more levels of access, and each key corresponds to a level of access; and
applying each of the keys to the content to create a plurality of sections of encrypted content, each section being a portion of the content, and each successive section of the content improving the set of attributes of the content.
8. The method of claim 7, additionally comprising creating a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content.
9. The method of claim 7, wherein the hierarchy of keys are related by a cryptographic strength one-way function.
10. The method of claim 7, wherein an attribute comprises resolution.
11. A machine-readable medium having stored thereon data representing sequences of instructions, the sequences of instructions which, when executed by a processor, cause the processor to perform the following:
receive content comprising a set of attributes having L through N levels of access, where L<N, and content at a given level of access being decryptable by a corresponding key;
receive a base key corresponding to an M of N level of access, where LMN; and
derive lower level keys based on the base key, the lower level keys being used to access content having an M level of access of lower.
12. The method of claim 11, additionally comprising instructions that cause the processor to receive a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content, and the instructions cause the processor to derive lower level keys based on the base key comprises, for a given lower level key, using a function based on a matrix value corresponding to the lower level key and a one-way function of an adjacent higher level key.
13. The method of claim 11, wherein the instructions cause the processor to derive lower level keys based on the base key comprises, for a given lower level key, by using a modular exponentiation of a higher level key.
14. An apparatus comprising:
at least one processor; and
a machine-readable medium having instructions encoded thereon, which when executed by the processor, are capable of directing the processor to:
receive content comprising a set of attributes having L through N levels of access, where L<N, and content at a given level of access being decryptable by a corresponding key;
receive a base key corresponding to an M of N level of access, where LMN; and
derive lower level keys based on the base key, the lower level keys being used to access content having an M level of access of lower.
15. The method of claim 14, additionally comprising instructions that cause the processor to receive a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content, and the instructions cause the processor to derive lower level keys based on the base key comprises, for a given lower level key, using a function based on a matrix value corresponding to the lower level key and a one-way hash function of an adjacent higher level key.
16. The method of claim 14, wherein the instructions cause the processor to derive lower level keys based on the base key comprises, for a given lower level key, by using a modular exponentiation of a higher level key.
17. An apparatus comprising:
means to receive content comprising a set of attributes having L through N levels of access, where L<N, and content at a given level of access being decryptable by a corresponding key;
means to receive a base key corresponding to an M of N level of access, where LMN; and
means to derive lower level keys based on the base key, the lower level keys being used to access content having an M level of access of lower.
18. The method of claim 17, additionally comprising means to receive a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content, and the means to derive lower level keys based on the base key comprises, for a given lower level key, using a function based on a matrix value corresponding to the lower level key and a one-way hash function of an adjacent higher level key.
19. The method of claim 17, wherein the means to derive lower level keys based on the base key comprises, for a given lower level key, using a modular exponentiation of a higher level key.
20. A method comprising:
receiving encrypted content comprising a set of attributes having L through N levels of access, where L<N, and each level being accessible by a corresponding key;
receiving a base key corresponding to an M of N level of access, where LMN;
deriving lower level keys based on the base key, the lower level keys being used to access content having an M level of access or lower; and
using a given lower level key to decrypt the content at a corresponding level.
21. The method of claim 20, additionally comprising receiving a D-dimensional matrix for each attribute in the set of attributes, wherein D corresponds to a number of attributes of the content, and wherein the matrix comprises matrix values for determining how to generate a key corresponding to a given section of the content, and said deriving lower level keys based on the base key comprises, for a given lower level key, using a function based on a matrix value corresponding to the lower level key and a one-way function of an adjacent higher level key.
22. The method of claim 20, wherein said deriving lower level keys based on the base key comprises, for a given lower level key, using a modular exponentiation of a higher level key.
Description
FIELD OF THE INVENTION

[0001] This invention relates to digital rights management. More particularly, this invention relates to the hierarchical protection of digital content.

BACKGROUND OF THE INVENTION

[0002] Accompanying the widespread conversion of many types of content, such as movies, music, books, etc., to digital formats has been the development of a number of systems for protecting such content against unauthorized distribution and access. In the case of digital content that is to be distributed to different environments, it is desirable to the content distributor that each environment only receive rights to the one or more attributes of the content that is appropriate to its subscriber. As used herein, an environment refers to a business model that is used by a subscriber of content for processing security rights in digital content.

[0003] Content may have one or more attributes, such as resolution, frame rate, number of copies, number of simultaneous users, or size of computer. The attributes that content has may depend on the type of content. For instance, video content may comprise resolution and frame rate.

[0004] Currently, the industry practice is to encrypt the entire contents using a single key and algorithm for distribution to all environments. Consequently, either the least secure environment will have access to the highest resolution encoded in the content, or the content must be re-authored for each environment in accordance with the required resolution and security of that environment.

BRIEF DESCRIPTION OF THE DRAWINGS

[0005] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:

[0006]FIG. 1 is a block diagram illustrating multi-level and multi-dimensional hierarchical content encryption using separate keys in accordance with embodiments of the invention.

[0007]FIG. 2 is a block diagram illustrating a system in accordance with embodiments of the invention.

[0008]FIG. 3 is a block diagram illustrating hierarchical content decryption using a single key in accordance with embodiments of the invention.

[0009]FIG. 4 is a flowchart illustrating a method for multi-level and multi-dimensional hierarchical content encryption using separate keys in accordance with embodiments of the invention.

[0010]FIG. 5 is a flowchart illustrating a method for hierarchical content decryption using a single key in accordance with embodiments of the invention.

[0011]FIGS. 6 and 7 are matrices used for generating lower level keys in accordance with a first exemplary embodiment of the invention.

[0012]FIG. 8 is a matrix used for generating lower level keys in accordance with a third exemplary embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

[0013] In one aspect of the invention, a method is provided for multi-level and multi-dimensional encoding of content for distribution to multiple environments. Content having one or more attributes is encrypted once and distributed to multiple environments having various levels of security.

[0014] Multi-dimensional encoding refers to encoding content that may have one or more attributes, such as resolution or frame-rate. Multi-level encoding refers to hierarchical encoding of content for a given attribute, where each successive level improves the attribute of the previous level, to achieve environment-independent encoding of content for one or more environments, where each environment has its own level of security. Both multi-dimensional encoding and multi-level encoding are characterized by the encoding of content once for distribution to multiple environments.

[0015] Multi-dimensional content is divided into sections. Each section is a portion of the content to be distributed, and represents a level of access for the attributes of the content, and each successive section is an improvement of the given attribute over the previous section. Each section is separately encrypted using separate keys from a hierarchy of keys. The keys of the hierarchy may be related by a cryptographic-strength one-way function, such that in decryption, the one-way function may be applied to any higher level section key to derive the key of the preceding, next lower level section.

[0016] For a given environment, the content is conveyed such that the highest appropriate key for the attributes and assurance of the given environment are available. The lower level keys are derived using the one-way function, so that a device for accessing the content has access to all levels less than or equal to the given key, but not greater than the given key.

[0017] The present invention includes various operations, which will be described below. The operations of the present invention may be performed by hardware components or may be embodied in machine-executable instructions, which may be used to cause a general-purpose or special-purpose processor or logic circuits programmed with the instructions to perform the operations. Alternatively, the operations may be performed by a combination of hardware and software.

[0018] The present invention may be provided as a computer program product which may include a machine-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform a process according to the present invention. The machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs (Compact Disc-Read Only Memories), and magneto-optical disks, ROMs (Read Only Memories), RAMs (Random Access Memories), EPROMs (Erasable Programmable Read Only Memories), EEPROMs (Electromagnetic Erasable Programmable Read Only Memories), magnetic or optical cards, flash memory, DVDs (Digital Video Discs), or other type of media/machine-readable medium suitable for storing electronic instructions.

[0019] Moreover, the present invention may also be downloaded as a computer program product, wherein the program may be transferred from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals embodied in a carrier wave or other propagation medium via a communication link (e.g., a modem or network connection). Accordingly, herein, a carrier wave shall be regarded as comprising a machine-readable medium. Introduction

[0020] As illustrated in FIG. 1, content 100 having a set of attributes is transformed into encrypted content 102 comprising a plurality of sections (only five sections shown) 104, 106, 108, 110, 112, where each section corresponds to one of L through N levels of access (L<N), L being the lowest level of access (e.g., lowest resolution), and N being the highest level of access (e.g., highest resolution). Each section is content encrypted at a level of access that a client may subscribe to. Encryption is achieved by using a plurality of hierarchically related keys 114, 116, 118, 120, 122, resulting in a plurality of dimensions 124 for a corresponding number of attributes. In preferred embodiments, the keys are related by a cryptographic-strength one-way function.

[0021] A method in accordance with FIG. 1 is illustrated in FIG. 4. It starts at block 400, and continues to block 402 where the hierarchical keys are generated. At block 404, encrypted content is created by applying each key to the content to create sections of the content. The method ends at block 406.

[0022] As illustrated in FIG. 2, a server 200 and a client 202 create a secure authenticated channel 204 that connects a digital rights management agent 208 (hereinafter “agent”) on the client with a content clearinghouse 206 (hereinafter “clearinghouse”) comprising content 100 on the server 200. A request to access content 100 is received from the client 202. When the server 200 receives appropriate payment from the client 202 for an M (L

MN) level of access, the encrypted content 102 is communicated to the client 202, along with the appropriate key for the level of access subscribed to.

[0023] As illustrated in FIG. 3, using a base key 300 (i.e., a key commensurate with the client's 202 subscription, or rights, which is K3 in this example), the agent 208 can create all appropriate lower level keys 302, 304. Once all appropriate keys 300, 302, 304 are obtained or created, the encrypted content 102 is decrypted into accessible content 306, where the client 202 has access to the corresponding sections 308, 310, 312 (obtained by using the appropriate key 300, 302, 304) of the content 100 having the given set of attributes less than or equal to the base key 300.

[0024] A method in accordance with FIG. 3 is illustrated in FIG. 5, beginning at block 500. At block 502, content having N levels of access is received. At block 504, a base key corresponding to an M of N level of access is received, and at block 506, the base key is used to derive lower level keys for accessing content corresponding to those lower level keys. The method ends at block 508.

[0025] For example, consider the case where the content's given attribute is “resolution” comprising levels of access 1-5 (i.e., L through N), where 1 is the lowest resolution and 5 is the highest resolution. If a client subscribes to a mid-point resolution, say 3 (i.e., M), then upon appropriate payment, the server transmits the content along with a base key corresponding to a resolution of 3. The client then uses the base key to generate all lower level keys. Once all appropriate keys are available, corresponding sections of the content may be accessed.

[0026] For synchronized, multi-media applications, synchronization information is encrypted separately from the information in each synchronized channel (for example, video and audio). That is, each aspect of the multi-media content may be separately encrypted, enabling the value of each aspect to be recognized in rights management transactions. Where various aspects interact, a multi-dimensional encryption scheme can be used wherever multi-dimensional hierarchical encoding is possible. For non-interactive aspects, each may be separately protected, or, optionally, they may be artificially related for purposes of key distribution.

[0027] In one exemplary embodiment, a matrix for each dimension is published, such that a key with a lower subscript in each dimension can be computed from the higher value key. In another exemplary embodiment, a modular exponentiation function is utilized. In yet another embodiment, a secret sharing scheme is utilized.

[0028] First Exemplary Embodiment

[0029] In one embodiment, a random key, Ki,j,, is generated for each point on a D-dimensional grid, where D represents the number of attributes for given content. On the server side, content is encrypted into sections, or points on the grid, where each point is encrypted using its corresponding random key, Ki,j. For a dimension, X, a given matrix value in the matrix is represented by:

X i,j =K i,j

H(K i+1,j).

[0030] When content is transferred to the client, a base key commensurate with the client's subscription level is transmitted, along with one or more matrices, depending upon the number of attributes there are. Using the base key, a key with a lower subscript in each dimension may be computed from a higher value key. In exemplary embodiments, an exclusive-or operation may be used to derive the lower level key. For dimension X, this may be represented as follows:

K i,j =F 1(K,i,j)=X i,j

H( K i+1,j)

[0031] where Ki,j represents the randomly generated key, which is derived from a higher-level key; F1(K,i,j) is the function computed by the exclusive-or of the X matrix value with the one-way function of the next highest level key Ki+1,j in the first dimension; Xi,j is the value at grid point (i, j) from the published matrix; and H(Ki+1,j) is a one-way function of the higher level key K i+1,j, such as the well-known message digest function SHA-1 or MD5, for example.

[0032] Similarly, for dimension Y:

K i,j =F 2(K,i,j)=Y i,j

H( K i,j+1).

[0033] where Ki,j represents the randomly generated key, which is derived from a higher-level key; F2(K,i,j) is the function computed by the exclusive-or of the X matrix value with the one-way function of the next highest level key Ki,j+1 in the second dimension; Yi,j is the value at grid point (i, j) from the published matrix; and H(Ki,j+1) is a one-way function of the higher level key Ki,j+1, such as the well-known message digest function SHA-1 or MD5, for example.

[0034] The method can be extended to any number of dimensions. In the case of only one dimension, X can be omitted, such that:

K i =H(K i+1)

[0035] An example of corresponding matrices for dimensions X and Y is illustrated in FIGS. 6 and 7, where dimension X represents the attribute “frames per second”, and dimension Y represents the attribute “resolution”. In this example, the highest resolution and frames/second exist at grid point (3, 3). Thus, if a client subscribes to receiving the highest level of access, the environment will receive a base key corresponding to that level.

[0036] As illustrated at grid point (3, 3), it costs $5000 to subscribe to content having the highest level resolution and the highest level of frames per second. The client for an environment subscribing to these levels receives the base key, K3,3, (all keys are the same for all dimensions). The base key, K3,3, may then be used to generate all lower level keys. The keys may then be used to decrypt corresponding sections of the content. In progressive, hierarchical encoding, a lower level section of the content is decoded first, and each subsequent key is used to refine the previously decoded section of the content to produce a higher level attribute.

Generating Lower Level Keys

[0037] Using the equation for the appropriate dimension as shown above, the agent may create keys to access lower level content by computing the lower level keys based on the base key that is transmitted to the environment.

[0038] Keys may be generated from dimension X (FIG. 6) as follows:

K 1,1 =F 1(K,1,1)=X 1,1

H( K 2,1)

K 1,2 =F 1(K,1,2)=X 1,2

H( K 2,2)

K 2,1 =F 1(K,2,1)=X 2,1

H( K 3,1)

K 2,2 =F 1(K,2,2)=X 2,2

H( K 3,2)

K 1,3 =F 1(K,1,3)=X 1,3

H( K 2,3)

K 2,3 =F 1(K,2,3)=X 2,3

H( K 3,3)

[0039] Similarly, keys may be generated from dimension Y (FIG. 7) as follows:

K 1,1 =F 2(K,1,1)=Y 1,1

H(K 1,2)

K 1,2 =F 2(K,1,2)=Y 1,2

H(K 1,3)

K 2,1 =F 2(K,2,1)=Y 2,1

H(K 2,2)

K 2,2 =F 2(K,2,2)=Y 2,2

H(K 2,3)

K 3,1 =F 2(K,3,1)=Y 3,1

H(K 3,2)

K 3,2 =F 2(K,3,2)=Y 3,2

H(K 3,3)

[0040] Note that for matrix X, the rightmost entries (i.e., (3, 1) and (3, 2)) are omitted, since they are used for deriving lower-level keys to the left, and for matrix Y, the topmost entries (i.e. (1, 3) and (2,3)) are omitted, since they are used for deriving lower-level keys below. Since the keys are the same for all dimensions, entries missing from one matrix may be obtained from another matrix. Thus, equation K2,2=F1(K,2,2)=X2,2

H(K3,2) from matrix X, K3,2 may be obtained from K3,2=F2(K,3,2)=Y3,2 H(K3,3) in matrix Y.

[0041] Using the base key and both matrices, all keys may be computed by moving to the left or moving down using an equation from a given matrix. For instance, since K3,3 is given, K3,2 may be computed using K3,2=F2(K,3,2)=Y3,2

H(K3,3), and K3,1 may be computed by using K3,1=F2(K,3,1)=Y3,1 H(K3,2) (using “moving down” equations from matrix Y). Similarly, K2,3 may be computed by using K2,3=F1(K,2,3)=X2,3 H(K3,3), and K1,3 may be computed by using K1,3=F1(K,1,3)=X1,3 H(K2,3) (using “moving left” equations from matrix X).

[0042] K2,2 may be computed from K2,2=F1(K,2,2)=X2,2

H(K3,2) or from K2,2=F2(K,2,2)=Y2,2 H(K2,3). K1,2 may be computed from K1,2=F1(K,1,2)=X1,2 H(K2,2), or from K1,2=F2(K,1,2)=Y1,2 H(K1,3). K2,1 may be computed from K2,1=F1(K,2,1)=X2,1 H(K3,1) or from K2,1=F2(K,2,1)=Y2,1 H(K2,2). K1,1 may be computed from K1,1=F1(K,1,1)=X1,1 H(K2,1) or from K1,1=F2(K,1,1)=Y1,1 H(K1,2).

[0043] With this method, any path (i.e., moving left or moving down) to compute a lower value key from a higher value key produces the same result. The length of the key provided by this method is limited by the message digest that is used. For example, it would be 128 bits for MD5 and 160 bits for SHA-1.

[0044] Second Exemplary Embodiment

[0045] In another embodiment, a public modulus, m, comprising two secret large prime factors, p and q, is selected. For each dimension, d, an exponent, ed, relatively prime to (having no common factors with) (p-1)*(q-1) is chosen. The exponents are also pair-wise relatively prime. Since the size of the group of numbers generated is relatively large, it ensures that some approaches to inverting the modular exponentiation do not work.

[0046] These exponents may be small, but should be greater than 3. For the maximum value of all dimensions, i, j, . . . , a secret key Ki,j, . . . greater than 1 and less than m is chosen.

[0047] Ki,j, . . . may then be used to encrypt the content. To form the adjacent key in dimension d when decrypting, K. . . ,i, . . . , from key K. . . ,i+1 . . . , raise it to the ed power mod m. An equation for this is as follows:

K . . . ,i, . . . =F d(K . . . ,i+1 . . . )=K . . . ,i+1 . . . e d mod m.

[0048] Assuming m is sufficiently large to disable factoring (at least 1024 bits for most applications), it would be infeasible to reverse the computation and determine higher keys in any dimension.

[0049] As with the first exemplary embodiment, any path to compute a lower value key from a higher value key produces the same result. This method provides up to 1024 bits for a key.

[0050] Consequently, the key size, size of required information, and computation requirements may help to determine which of these two methods is optimal for a given implementation.

[0051] Third Exemplary Embodiment

[0052] In yet another embodiment, a publicly known cryptographic one-way function H, and a d-dimensional secret sharing scheme S are utilized. For dimension d, key Xd,l=H(Xd,l+1). Additional artificial dimensions, such as cost, may be added to provide additional constraints. Key Ki,j . . . =Sn(X1,l, X2,j, . . . ) where S is an n-of-n secret sharing scheme.

[0053] For example, in FIG. 8, the client may purchase a high-resolution movie encrypted with a 2 dimensional scheme, where an artificial third dimension of cost is also added. The server would communicate shares X1,3 and X2,3 to the client. The client would compute lesser value shares in each dimension using the hash function H as follows:

X 1,2 =H(X 1,3), X 1,1 =H(X 1,2)

X 2,2 =H(X 2,3), X 2,1 =H(X 2,2), and

X 3,5 =H(X 3,6), X 3,4 =H(X 3,5), X 3,3 =H(X 3,4), X 3,3 =H(X 3,4), X 3,2 =H(X 3,3), X 3,1 =H(X 3,2).

[0054] The client may then compute all the particular shares, Ki,j, used to decrypt the various portions of hierarchically encrypted and encoded content using a 3-of-3 secret sharing scheme S:

K 1,3 =S 3(X 1,1 , X 2,3, , X 3,3), K 2,3 =S 3(X 1,2 , X 2,3, , X 3,5), K 3,3 =S 3(X 1,3 , X 2,3, , X 3,6);

K 1,2 =S 3(X 1,1 , X 2,2, , X 3,2), K 2,2 =S 3(X 1,2 , X 2,2, , X 3,4), K 3,2 =S 3(X 1,3 , X 2,2, , X 3,5);

K 1,1 =S 3(X 1,1 , X 2,1, , X 3,1), K 2,1 =S 3(X 1,2 , X 2,1, , X 3,2), K 3,1 =S 3(X 1,3 , X 2,1, , X 3,3);

[0055] giving it access to all encrypted portions of the content.

[0056] The additional artificial cost dimension prevents one from purchasing both K1,3 and K3,1, obtaining both X2,3 and X1,3 and being able to construct K3,3 or K2,2. In this case, the artificial dimension reflects the additional value of the integration of the dimensions.

[0057] Accessing Content

[0058] Once all appropriate keys have been generated, content may be accessed by applying a key to its corresponding section. In an exemplary embodiment, lower level sections of the content are decoded first, and each successive section is decoded to refine the previously decoded section.

[0059] Conclusion

[0060] Thus, embodiments of the invention provide a method by which content providers can encode full, high-resolution contents once and distribute the same content over multiple distribution channels. Consequently, less secure devices do not have access to higher value resolution than was appropriate.

[0061] In the foregoing specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

[0062] While several exemplary embodiments have been described, it should be understood by one of ordinary skill in the art that concepts of this invention are not limited to embodiments discussed herein.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7391864 *Jul 22, 2003Jun 24, 2008Samsung Electronics Co., Ltd.Apparatus and method for hierarchical encryption
US7480385 *Nov 5, 2004Jan 20, 2009Cable Television Laboratories, Inc.Hierarchical encryption key system for securing digital media
US7587607Dec 22, 2003Sep 8, 2009Intel CorporationAttesting to platform configuration
US7725945Jun 27, 2001May 25, 2010Intel CorporationDiscouraging unauthorized redistribution of protected content by cryptographically binding the content to individual authorized recipients
US7764189 *Dec 17, 2008Jul 27, 2010Tye RubinsAudio coordinated visual indicator
US7787619 *Jan 29, 2002Aug 31, 2010Avaya Inc.Method and apparatus for secure key management using multi-threshold secret sharing
US8090106 *Sep 30, 2008Jan 3, 2012Industrial Technology Research InstituteMulti-level data encryption and decryption system and method thereof
US8259950 *Jul 12, 2010Sep 4, 2012Avaya Inc.Method for secure key management using multi-threshold secret sharing
US8595806 *Sep 21, 2010Nov 26, 2013Amazon Technologies, Inc.Techniques for providing remote computing services
US20050125254 *Dec 3, 2003Jun 9, 2005Roy SchoenbergKey maintenance method and system
US20090276625 *Oct 22, 2008Nov 5, 2009Industrial Technology Research InstituteHierarchical browsing management method and system for digital content
US20090279852 *Apr 1, 2009Nov 12, 2009Sony CorporationInformation processing apparatus, information processing method, and program
EP2363823A1 *Jan 12, 2004Sep 7, 2011Sony Electronics Inc.Real-time delivery of license for previously stored encrypted content
WO2009011733A1 *May 27, 2008Jan 22, 2009William A AlvaradoNetwork based digital rights management system
Classifications
U.S. Classification380/45, 348/E07.056, 386/E05.004
International ClassificationH04N21/266, H04N7/167, H04N21/2347, H04L29/06, G06F21/00, G11B20/00, H04N5/913
Cooperative ClassificationH04N5/913, H04L2463/101, H04L63/105, G11B20/0021, H04N7/1675, H04L63/04, G11B20/00086, H04N21/2347, G11B20/00731, H04N21/26613, H04N2005/91364, G06F2221/2113, G06F21/10
European ClassificationH04N21/2347, H04N21/266K, G06F21/10, H04L63/10D, H04L63/04, H04N7/167D, H04N5/913
Legal Events
DateCodeEventDescription
Oct 1, 2002ASAssignment
Owner name: INTEL CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GRAUNKE, GARY;RIPLEY, MICHAEL S.;BRICKELL, ERNIE;REEL/FRAME:013344/0701
Effective date: 20011012
Dec 27, 2001ASAssignment
Owner name: INTEL CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RIPLEY, MACHAEL S.;BRICKWELL, ERNIE;GRAUNKE, GARY;REEL/FRAME:012396/0484
Effective date: 20011012