BLOCK-BASED MEDIA CONTENT AUTHENTICATION

• US 20100031035A1
• Filed: 10/09/2009
• Published: 02/04/2010
• Est. Priority Date: 10/16/2006
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Broadon Communications Corp. (Acer, Inc.)
• Inventors: Srinivasan, Pramila, Princen, John, Anderson, Craig Steven
• Granted Patent: US 7,991,999 B2
• Time in Patent Office: Days
• US Class Current: 713/166
• CPC Class Codes: G06F 21/10 Protecting distributed programs or content, e.g. vending or licensing of copyrighted material protection in video systems or pay television H04N7/16 ; Digital rights management [DRM]
• CPC Class Codes: G11B 20/00086 Circuits for prevention of unauthorised reproduction or copying, e.g. piracy indicating unauthorised use of record carriers in general G11B23/28; scrambling for television signal recording H04N5/913; network architectures or network protocols for network security H04L63/00; cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
• CPC Class Codes: G11B 20/0021 involving encryption or decryption of contents recorded on or reproduced from a record carrier
• CPC Class Codes: G11B 20/00333 the key being stored in header data, e.g. in sector headers
• CPC Class Codes: G11B 20/00507 wherein consecutive physical data units of the record carrier are encrypted with separate encryption keys, e.g. the key changes on a cluster or sector basis
• CPC Class Codes: H04L 2209/605 Copy protection
• CPC Class Codes: H04L 9/0897 involving additional devices, e.g. trusted platform module [TPM], smartcard or USB
• CPC Class Codes: H04L 9/3213 using tickets or tokens, e.g. Kerberos network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807
• CPC Class Codes: H04L 9/3236 using cryptographic hash functions
• CPC Class Codes: H04L 9/3265 using certificate chains, trees or paths; Hierarchical trust model
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

A technique for security and authentication on block-based media includes involves the use of protected keys, providing authentication and encryption primitives. A system according to the technique may include a secure device having a security kernel with protected keys. A disk drive security mechanism may support authentication of data, secrecy, and ticket validation using the security kernel and, for example, a ticket services module (e.g., a shared service that may or may not be used by other storage devices like flash).

Claims

1. A block-based media device comprising:

an authentication mechanism for authenticating a block of data up to a maximum size;

a disk header including a first hash H(1,n₁* . . . *n_x+1,Y), wherein n₁ . . . n_x+1 are selected from a group of integers consisting of 1 and the number of hashes necessary to cover the maximum size of the block of data that can be authenticated by the authentication mechanism such that n₁<

n₂<

. . . n_x<

n_x+1;

a second hash H(n₁* . . . *n_x+1+1,n₁* . . . *n<sub>x−

1</sub>*m n_x,Y), wherein m is selected from a group of integers consisting of 1 and the number of child nodes of the first hash;

a block including;

a plurality of third hashes that are children of the second hash block;

a plurality of fifth hashes that are children or grandchildren of one of the plurality of third hashes;

a data block Y_k associated with at least one of the fifth hashes, at least one of the third hashes, the second hash, and the first hash, wherein Y_k;

is one of a set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein H(i,i,Y)=f(Y_i) and f(Y_i) is a one-way function;

wherein, in operation, the authentication mechanism uses the first hash, the second hash, at least one of the third hashes, and at least one of the fifth hashes to authenticate the data block Y_k.

2. The block-based media device of claim 1, wherein the first hash is a root hash of a non-binary tree data structure.

3. The block-based media device of claim 1, wherein the disk header further includes the second hash.

4. The block-based media device of claim 1, further comprising means to derive the second hash from the plurality of third hashes.

5. The block-based media device of claim 1, wherein the plurality of fifth hashes are leaf nodes of a non-binary tree data structure.

6. The block-based media device of claim 1, further comprising, in the block, a plurality of fourth hashes that are children of one of the plurality of third hashes, and wherein the plurality of fifth hashes are children of one of the fourth hashes.

7. The block-based media device of claim 1, wherein the block includes the set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein each of the data blocks is associated with one of the plurality of fifth hashes.

20. The block-based media device of claim 1, wherein the block includes the set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein each of the data blocks is associated with one of the plurality of fifth hashes.

8. A method comprising:

providing a first hash H(1,n₁* . . . *n_x+1,Y), wherein n₁ . . . n_x+1 are selected from a group of integers consisting of 1 and the number of hashes necessary to cover the maximum size of the block of data that can be authenticated by the authentication mechanism such that n₁<

n₂<

. . . n_x<

n_x+1;

providing a second hash H(n₁* . . . *n<sub>x−

1</sub>+1,n₁* . . . *n<sub>x−

1</sub>*m n_x,Y), wherein m is selected from a group of integers consisting of 1 and the number of child nodes of the first hash;

providing a block including;

a plurality of third hashes that are children of the second hash block;

a plurality of fifth hashes that are leaf nodes that are children or grandchildren of one of the plurality of third hashes;

a data block Y_k associated with at least one of the fifth hashes, at least one of the third hashes, the second hash, and the first hash, wherein Y_k;

is one of a set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein H(i,i,Y)=f(Y_i) and f(Y_i) is a one-way function;

using a hash value H(i,j,k) to authenticate Y_k, wherein Y_k is one of a set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein H(i,i,Y)=f(Y_i) and f(Y_i) is a one-way function;

enabling access to data of the data block Y_k when the data block Y_k is authenticated.

9. The method of claim 8, further comprising:

providing the first hash and the second hash in a disk header.

10. The method of claim 8, further comprising:

providing the first hash in a disk header;

deriving the second hash from the plurality of third hashes.

11. The method of claim 8, further comprising:

providing in the block a plurality of fourth hashes that are children of one of the plurality of third hashes, wherein at least one of the plurality of fifth hashes is a child of one of the fourth hashes.

12. The method of claim 8, further comprising:

providing in a disk header a signed data structure including the first hash, a content identification, and a key.

13. The method of claim 8, further comprising:

signing, through a content publishing server using a public key signature method, a ticket that includes the first hash;

providing the ticket in a disk header.

14. The method of claim 8, further comprising:

providing a ticket including rights management data granting rights to content and a signature by another licensing server;

managing rights at least in part in accordance with the rights management data.

15. The method of claim 8, further comprising:

providing a ticket including ancillary data structures to help validate signatures.

16. The method of claim 8, further comprising:

providing in the block the set of data blocks {Y₁, Y₂, . . . , Y_N};

interleaving the set of data blocks with the plurality of third hashes and the plurality of fifth hashes.

17. The method of claim 8, further comprising:

preloading a disk header including the first hash and the second hash;

authenticating the data block using only authentication data provided in a hash block, including the plurality of third hashes and the plurality of fifth hashes, and the preloaded disk header.

18. A system comprising:

a means for processing a first hash H(1,n₁* . . . *n_x+1,Y), wherein n, . . . n_x+1 are selected from a group of integers consisting of 1 and the number of hashes necessary to cover the maximum size of the block of data that can be authenticated by the authentication mechanism such that n₁<

n₂<

. . . n_x<

n_x+1;

a means for processing a second hash H(n₁* . . . *n<sub>x−

1</sub>+1,n₁* . . . *n<sub>x−

1</sub>*m n_x,Y), wherein m is selected from a group of integers consisting of 1 and the number of child nodes of the first hash;

a means for processing a block including;

a plurality of third hashes that are children of the second hash block;

a plurality of fifth hashes that are leaf nodes that are children or grandchildren of one of the plurality of third hashes;

a data block Y_k associated with at least one of the fifth hashes, at least one of the third hashes, the second hash, and the first hash, wherein Y_k;

is one of a set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein H(i,i,Y)=f(Y_i) and f(Y_i) is a one-way function;

a means for using a hash value H(i,j,k) to authenticate Y_k, wherein Y_k is one of a set of data blocks {Y₁, Y₂, . . . , Y_N}, wherein H(i,i,Y)=f(Y_i) and f(Y_i) is a one-way function;

a means for enabling access to data of the data block Y_k when the data block Y_k is authenticated.

19. The system of claim 18, further comprising:

in the block, a plurality of fourth hashes that are children of one of the plurality of third hashes, wherein at least one of the plurality of fifth hashes is a child of one of the fourth hashes.