INTEROPERABLE SYSTEMS AND METHODS FOR PEER-TO-PEER SERVICE ORCHESTRATION

• US 20100131412A1
• Filed: 11/12/2009
• Published: 05/27/2010
• Est. Priority Date: 06/05/2003
• Status: Active Grant

• Current Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Original Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Inventors: BRADLEY, WILLIAM, Boccon-Gibod, Gilles, Maher, David
• Granted Patent: US 9,235,833 B2
• Time in Patent Office: Days
• US Class Current: 705/59
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 21/1073 Conversion
• CPC Class Codes: G06F 21/1084 via third party
• CPC Class Codes: G06F 21/1085 Content sharing, e.g. peer-to-peer [P2P]
• CPC Class Codes: G06Q 20/1235 with control of digital rights management [DRM]
• CPC Class Codes: G06Q 2220/10 Usage protection of distributed data files
• CPC Class Codes: G06Q 2220/18 Licensing
• CPC Class Codes: H04L 2209/603 Digital right managament [DRM]
• CPC Class Codes: H04L 2463/101 applying security measures for digital rights management data processing systems or methods, specially adapted for commerce, e.g. marketing, shopping, billing, auctions or e-commerce G06Q30/00
• CPC Class Codes: H04L 2463/102 applying security measure for e-commerce data processing systems or methods, specially adapted for e-commerce G06Q30/00
• CPC Class Codes: H04L 63/0281 Proxies
• 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/061 for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838
• 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/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 63/20 for managing network security; network security policies in general filtering policies H04L63/0227
• CPC Class Codes: H04L 67/1061 using node-based peer discovery mechanisms static access to replicated servers H04L67/1006; service discovery H04L67/51
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 9/0822 using key encryption key
• 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/0861 : Generation of secret information including derivation or calculation of cryptographic keys or passwords
• CPC Class Codes: H04L 9/3263 : involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823
• CPC Class Codes: H04L 9/3271 : using challenge-response

Abstract

Systems and methods are described for performing policy-managed, peer-to-peer service orchestration in a manner that supports the formation of self-organizing service networks that enable rich media experiences. In one embodiment, services are distributed across peer-to-peer communicating nodes, and each node provides message routing and orchestration using a message pump and workflow collator. Distributed policy management of service interfaces helps to provide trust and security, supporting commercial exchange of value. Peer-to-peer messaging and workflow collation allow services to be dynamically created from a heterogeneous set of primitive services. The shared resources are services of many different types, using different service interface bindings beyond those typically supported in a web service deployments built on UDDI, SOAP, and WSDL. In a preferred embodiment, a media services framework is provided that enables nodes to find one another, interact, exchange value, and cooperate across tiers of networks from WANs to PANs.

Claims

1-4. -4. (canceled)

5. A method comprising:

receiving a plurality of link objects, each link object containing node identification information identifying at least two nodes, and each link object further containing key derivation information, the key derivation information comprising at least one encrypted cryptographic key;

using a locally stored cryptographic key to decrypt an encrypted first cryptographic key, the encrypted first cryptographic key being contained in a first link object; and

using the first cryptographic key to decrypt an encrypted second cryptographic key, the encrypted second cryptographic key being contained in a second link object.

6. The method of claim 5, further comprising:

using the second cryptographic key to decrypt an encrypted third cryptographic key, the encrypted third cryptographic key being contained in a third link object.

7. The method of claim 6, further comprising:

using the third cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

8. The method of claim 5, further comprising:

using the second cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

9. The method of claim 5, further comprising:

receiving a request from a user to access a piece of electronic content; and

using a digital rights management engine to determine if the request may be granted, including evaluating at least the first link object and the second link object to determine if a first node object associated with a first entity is reachable from a second node object associated with a second entity.

10. The method of claim 9, in which the first entity comprises an entity that certifies other entities to be members of one or more classes, and in which the second entity comprises the user.

11. The method of claim 6, further comprising:

receiving a request from a user to access a piece of electronic content; and

using a digital rights management engine to determine if the request may be granted, including evaluating at least the first link object, the second link object, and the third link object to determine if a first node object associated with a first entity is reachable from a second node object associated with a second entity.

12. The method of claim 5, in which the locally stored cryptographic key comprises a private key of an asymmetric key pair.

13. The method of claim 12, in which the first cryptographic key comprises a second private key of a second asymmetric key pair.

14. The method of claim 13, in which the second cryptographic key comprises a third private key of a third asymmetric key pair.

15-18. -18. (canceled)

19. A system comprising:

means for receiving a plurality of link objects, each link object containing node identification information identifying at least two nodes, and each link object further containing key derivation information, the key derivation information comprising at least one encrypted cryptographic key;

means for using a locally stored cryptographic key to decrypt an encrypted first cryptographic key, the encrypted first cryptographic key being contained in a first link object; and

means for using the first cryptographic key to decrypt an encrypted second cryptographic key, the encrypted second cryptographic key being contained in a second link object.

20. The system of claim 19, further comprising:

means for using the second cryptographic key to decrypt an encrypted third cryptographic key, the encrypted third cryptographic key being contained in a third link object.

21. The system of claim 20, further comprising:

means for using the third cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

22. The system of claim 19, further comprising:

means for using the second cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

23. The system of claim 19, further comprising:

means for receiving a request from a user to access a piece of electronic content; and

means for using a digital rights management engine to determine if the request may be granted, including means for evaluating at least the first link object and the second link object to determine if a first node object associated with a first entity is reachable from a second node object associated with a second entity.

24. The system of claim 20, further comprising:

means for receiving a request from a user to access a piece of electronic content; and

means for using a digital rights management engine to determine if the request may be granted, including evaluating at least the first link object, the second link object, and the third link object to determine if a first node object associated with a first entity is reachable from a second node object associated with a second entity.

25-28. -28. (canceled)

29. A computer-readable medium comprising program code, the program code being operable, when executed by a computer system, to cause the computer system to perform steps comprising:

obtaining a plurality of link objects, each link object containing node identification information identifying at least two nodes, and each link object further containing key derivation information, the key derivation information comprising at least one encrypted cryptographic key;

using a cryptographic key stored in memory of the computer system to decrypt an encrypted first cryptographic key, the encrypted first cryptographic key being contained in a first link object; and

using the first cryptographic key to decrypt an encrypted second cryptographic key, the encrypted second cryptographic key being contained in a second link object.

30. The computer-readable medium of claim 29, further including program code that is operable, when executed by the computer system, to cause the computer system to perform the step of:

using the second cryptographic key to decrypt an encrypted third cryptographic key, the encrypted third cryptographic key being contained in a third link object.

31. The computer-readable medium of claim 30, further including program code that is operable, when executed by the computer system, to cause the computer system to perform the step of:

using the third cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

32. The computer-readable medium of claim 29, further including program code that is operable, when executed by the computer system, to cause the computer system to perform the step of:

using the second cryptographic key to decrypt a piece of electronic content and/or an object controlling rights thereto.

33. The computer-readable medium of claim 29, further including program code that is operable, when executed by the computer system, to cause the computer system to perform steps comprising:

receiving a request from a user to access a piece of electronic content; and

using a digital rights management engine running on the computer system to determine if the request may be granted, including evaluating at least the first link object and the second link object to determine if a first node object associated with a first entity is reachable from a second node object associated with the computer system or the user.

34. The computer-readable medium of claim 30, further including program code that is operable, when executed by the computer system, to cause the computer system to perform steps comprising:

receiving a request from a user of the computer system to access a piece of electronic content; and

using a digital rights management engine running on the computer system to determine if the request may be granted, including evaluating at least the first link object, the second link object, and the third link object to determine if a first node object associated with a first entity is reachable from a second node object associated with a second entity.