Digital rights management engine systems and methods

• US 20070172041A1
• Filed: 10/18/2006
• Published: 07/26/2007
• Est. Priority Date: 10/18/2005
• Status: Abandoned Application

• Current Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Original Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Inventors: Boccon-Gibod, Gilles, Boeuf, Julien
• Application Number:
  US11/583,695
• Publication Number:
  US 20070172041A1
• Time in Patent Office: Days
• US Class Current: 379/142.100
• CPC Class Codes: G06F 21/1013 to locations
• CPC Class Codes: G06F 2221/2111 Location-sensitive, e.g. geographical location, GPS
• CPC Class Codes: G06Q 20/202 Interconnection or interaction of plural electronic cash registers [ECR] or to host computer, e.g. network details, transfer of information from host to ECR or from ECR to ECR
• CPC Class Codes: H04L 2209/603 Digital right managament [DRM]
• CPC Class Codes: H04L 2463/101 applying security measures for digital rights management
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/0492 by using a location-limited connection, e.g. near-field communication or limited proximity of entities
• CPC Class Codes: H04L 63/08 for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 63/123 received data contents, e.g. message integrity
• CPC Class Codes: H04L 9/0825 using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates
• CPC Class Codes: H04L 9/302 involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
• CPC Class Codes: H04L 9/3242 involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
• CPC Class Codes: H04L 9/3247 involving digital signatures
• CPC Class Codes: H04L 9/3271 using challenge-response

Abstract

Systems and methods are described for performing digital rights management. In one embodiment, a digital rights management engine is provided that evaluates license associated with protected content to determine if a requested access or other use of the content is authorized. In some embodiments, the licenses contain control programs that are executable by the digital rights management engine.

Claims

1. A method of determining whether a first entity is within a predefined proximity of a second entity, the method comprising:

generating a set of random number pairs at the first entity;

sending from the first entity to the second entity encrypted information from which the second entity can derive the set of random number pairs;

decrypting the encrypted information at the second entity;

deriving the set of random number pairs at the second entity;

sending an acknowledgement from the second entity to the first entity;

measuring a first time value at the first entity;

sending from the first entity to the second entity a first number from the set of random number pairs;

verifying, at the second entity, that said first number is from the set of random number pairs;

sending from the second entity to the first entity, a corresponding random number from said set of random number pairs; and

receiving the corresponding random number at the first entity; and

measuring a second value of time at the first entity.

2. The method of claim 1, further comprising:

computing a difference between the first value of time and the second value of time, and

comparing the difference to a threshold.

3. The method of claim 2, further comprising:

denying the second entity access to a computing resource if the difference is greater than said threshold.

4. The method of claim 2, further comprising:

granting the second entity access to a computing resource if the difference is less than said threshold.

5. A method of determining the proximity of a first entity to a second entity, the method comprising:

sending a first secret from the first entity to the second entity;

receiving an acknowledgement from the second entity;

measuring a first time value at the first entity;

sending from the first entity to the second entity a portion of the first secret;

receiving a corresponding portion of the first secret from the second entity;

measuring a second time value at the first entity; and

computing a difference between the first time value and the second time value.

6. The method of claim 5, further comprising:

comparing the difference to a threshold.

7. The method of claim 6, further comprising:

denying the second entity access to a computing resource if the difference is greater than said threshold.

8. The method of claim 6, further comprising:

granting the second entity access to a computing resource if the difference is less than said threshold.