Method for communicating entitlement data from a server, related server, client systems and computer program product

• US 8,442,236 B2
• Filed: 12/29/2005
• Issued: 05/14/2013
• Est. Priority Date: 12/29/2005
• Status: Expired due to Fees

• Current Assignee: Telecom Italia S.p.A.
• Original Assignee: Telecom Italia S.p.A.
• Inventors: Balestri, Massimo, De Petris, Gianluca, Silano, Barbara
• Primary Examiner(s): Pwu, Jeffrey
• Assistant Examiner(s): Anderson, Michael D
• Application Number:
  US12/087,220
• Publication Number:
  US 20090034743A1
• Time in Patent Office: 2,693 Days
• Field of Search: 380/28, 380/285, 713/170
• US Class Current: 380/285
• 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: H04L 2209/603 Digital right managament [DRM]
• CPC Class Codes: H04L 9/0838 Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these network architectures or network communication protocols for key exchange in a packet data network H04L63/061
• CPC Class Codes: H04L 9/3242 involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
• CPC Class Codes: H04N 21/2541 Rights Management protecting software against unauthorised usage in a vending or licensing environment G06F21/10; security in data switching network management H04L41/28; security management or policies for network security H04L63/20; access security in wireless networks H04W12/08
• CPC Class Codes: H04N 21/835 Generation of protective data, e.g. certificates protecting software against unauthorised usage in a vending or licensing environment G06F21/10

Abstract

A server communicates a set of entitlement data representative of the entitlement of a client to access corresponding contents data by using a set of keys and a non-invertible cryptographic function. The cryptographic function is applied to a set of candidate bit strings using the set of keys to find a selected bit string that produces the set of entitlement data as a result of the application of the non-invertible cryptographic function by using the keys in the set. The server and the client share the cryptographic function as well as the set of keys (or the selected bit string). The server transmits to the client the selected bit string (or the set of keys). In either case, the client is thus in a position to apply the cryptographic function to the selected string of bits by using the set of keys, thereby reconstructing the set of entitlement data.

Claims

1. A method of communicating a set of entitlement data from a server to at least one client, the set of entitlement data including a set of predicates representative of entitlement of the at least one client to access corresponding content data stored on the server, comprising the steps of:

determining a set of keys each corresponding to a predicate in said set of predicates, wherein each key in said set of keys is determined by varying said key and calculating a result of a non-invertible function being applied to a bit until said result is equal to the corresponding predicate;

causing said server and said at least one client to share said non-invertible function and one of said set of keys and said bit string; and

transmitting from said server to said at least one client the other remaining one of said set of keys and said selected bit string that is not shared with said at least one client.

2. The method of claim 1, wherein the non-invertible function is a non-invertible cryptographic function.

3. The method of claim 1, comprising selecting said bit string out of a set of candidate bit strings.

4. The method of claim 1, comprising the steps of:

causing said server and said at least one client to share said non-invertible function and said set of keys; and

transmitting from said server to the at least one client said bit string.

5. The method of claim 1, wherein said non-invertible function has a uniform distribution of outputs as a function of inputs.

6. The method of claim 1, wherein said non-invertible function is a message authentication code function.

7. The method of claim 6, wherein said non-invertible function is a HMAC-x function where x is selected from the group:

HAVAL,

MD2, MD4, MD5,

N-Hash,

RIPEMD, RIPEMD-128, RIPEMD-160, RIPEMD-256, RIPEMD-3U,

SHA, SHA-0, SHA-1 and SHA-2, SHA-256, SHA-384, SHA-512,

Snefru, Snefru-2

Tiger,

Whirlpool, Whirlpool-0

GOST-Hash,

HAS-160, HAS-V,

Panama, and

MGF1.

8. The method of claim 7, wherein said non-invertible function is selected from the group:

HMAC-SHA-1 and

HMAC-MD5.

9. The method of claim 3, comprising the steps of:

orderly selecting said keys in said set of keys; and

subsequently using each key orderly selected in said set of keys for applying said non-invertible cryptographic function to newly generated candidate bit strings in said set of candidate bit strings.

10. The method of claim 1, comprising the steps of:

partitioning said set of entitlement data into at least a first and a second subset of entitlement data; and

applying said non-invertible function and keys of said set of keys to said at least a first and a second subset of entitlement data to produce at least a first and a second bit string that respectively produce said at least a first and a second subset of entitlement data as a result of a non-invertible cryptographic function being applied to said at least a first and a second bit string by using said set of keys, whereby said set of entitlement data is expressed by the concatenation of said at least a first and a second bit string.

11. The method of claim 10, wherein said at least a first and a second subset of entitlement data comprise the same amount of entitlement data.

12. The method of claim 1, further comprising the steps of:

receiving at said client the other of said set of keys and said bit string; and

applying said cryptographic function to said string of bits by using said set of keys, thereby reconstructing at said client said set entitlement data.

13. The method of claim 12, comprising the steps of:

said server associating with said entitlement data parametric values expressing conditions for access by said at least one client to corresponding contents data; and

said client associating said parametric values to said entitlement data in said set as reconstructed at said client as a function of the order in which the corresponding bits are in said string of bits.

14. A server system capable of communicating according to the method of claim 1, and comprising a set of entitlement data representative of entitlement of at least one client to access corresponding content data, said server system being configured for sharing with said at least one client a noninvertible function and one of a set of keys and a bit string and for transmitting to said at least one client the remaining one of said set of keys and said bit string that is not shared with said at least one client.

15. The server system of claim 14, wherein said server system is implemented as a special purpose hardware processor configured for applying said non-invertible function to a string of bits by using said set of keys.

16. A client system cooperable with the server system of claim 14, comprising:

a client system configured for;

receiving from said server system the other of said set of keys and said bit string; and

applying said non-invertible function to a string of bits by using said set of keys, thereby reconstructing said set of entitlement data.

17. A non-transitory computer readable medium encoded with a computer program product, loadable into a memory of at least one computer, the computer program product comprising software code portions for performing the method of claim 1.