Trust Management Systems and Methods

• US 20070124812A1
• Filed: 12/21/2006
• Published: 05/31/2007
• Est. Priority Date: 05/19/2000
• Status: Active Grant

• Current Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Original Assignee: Intertrust Technologies Corporation (Fidelio Acquisition Co LLC)
• Inventors: Serret-Avila, Xavier, Weeks, Stephen
• Granted Patent: US 7,395,550 B2
• Time in Patent Office: Days
• US Class Current: 726/10
• CPC Class Codes: G06F 21/604 Tools and structures for managing or administering access control systems
• CPC Class Codes: G06F 2221/2141 Access rights, e.g. capability lists, access control lists, access tables, access matrices
• 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

Abstract

The present invention provides systems and methods for making efficient trust management decisions. A trust management engine is provided that processes requests for system resources, authorizations or certificates, and the identity of one or more root authorities that are ultimately responsible for granting or denying the requests. To determine whether a request should be granted, the trust management engine identifies a set principals from whom authorization may flow, and interprets each of the certificates as a function of the state of one or more of the principals. The processing logic iteratively evaluates the functions represented by the certificates, updates the states of the principals, and repeats this process until a reliable determination can be made as to whether the request should be granted or denied. The certificates may be evaluated until the state of the root authority indicates that the request should be granted, or until further evaluation of the certificates is ineffective in changing the state of the principals.

Claims

1-20. -20. (canceled)

21. In a computer-implemented authorization management system, a method for controlling a user'"'"'s access to a computing resource that is managed by said computer-implemented authorization management system, the method including:

receiving an electronic request for the computing resource from a first principal;

identifying a set of principals associated with a group of computer-readable authorization certificates, each certificate in the group of computer-readable authorization certificates containing at least one computer-readable authorization by at least one principal, at least one certificate having been issued by a second principal;

initializing a set of authorization values associated with the principals of said set of principals;

evaluating a certificate as a monotone function, at least in part, of one or more authorization values associated with one or more of the principals;

updating the one or more authorization values associated with the one or more of the principals if the result of said evaluating step indicates that an authorization value of a principal should be changed; and

repeating said evaluating and updating steps until an endpoint is reached.

22. A method as in claim 21, further including:

constructing a dependency graph representation in a memory device in communication with the computer-implemented authorization system, the dependency graph containing a node corresponding to each principal in the set of principals; and

associating at least two nodes in the dependency graph with a certificate that expresses a dependency of one node on the state of another node;

wherein the dependency graph representation is used, at least in part, during said evaluating, updating, and repeating to determine which certificates to evaluate.

23. A method as in claim 21, in which said updating is performed after all of the certificates have been evaluated.

24. A method as in claim 21, further comprising:

receiving the group of computer-readable authorization certificates from the first principal, wherein the request for the computing resource is received in the same communication as at least one computer-readable authorization certificate.

25. A method as in claim 21, in which the certificates comprise Simple Public Key Infrastructure (SPKI) certificates.

26. A method as in claim 21, in which the electronic request includes at least one of a request to access a piece of electronic content;

use a computer program;

execute a transaction;

access a computer; and

/or access a network.

27. A method as in claim 21, wherein the endpoint includes a steady state of the set of authorization values.

28. A method as in claim 21, wherein the endpoint includes an authorization of the electronic request.

29. A method as in claim 21, wherein at least one of the computer-readable authorization certificates includes at least one of a multi-way delegation and/or an inter-assertion delegation.

30. A computer-implemented system for controlling access to electronic resources, the system comprising:

a first computer system for processing electronic requests for access to electronic resources, the first computer system comprising;

a computer network interface configured to receive digital certificates from a second computer system and for electronically receiving and processing requests to access electronic resources, wherein at least some of the requests are received from the second computer system;

a memory device in communication with said first computer system for storing electronic resources and one or more computer-readable authorization certificates relating to authorization for controlling access thereto; and

a trust management engine for processing digital certificates and requests for electronic resources, and for making access control decisions by creating a set of monotone authorization values and performing an endpoint computation using said authorization values.

31. A system as in claim 30, further comprising:

a third computer system for generating a first digital certificate, the first digital certificate including an authorization value that is generated from a first monotone function, the authorization value effective for authorizing, at least in part, the second computer system to access a predefined electronic resource, the third computer system being operable to send the first digital certificate to the second computer system.

32. A system as in claim 30, further comprising:

a fourth computer system, the fourth computer system being operable to generate a second digital certificate including an authorization value that is generated from a second monotone function, the second digital certificate authorizing, at least in part, the third computer system to authorize, at least in part, the user of the second computer system to access the predefined system resource.

33. A system as in claim 32, in which the third computer system is operable to transmit the first digital certificate to the second computer system, the second computer system is operable to transmit the first digital certificate to the first computer system in connection with said request, and the fourth computer system is operable to transmit the second digital certificate to the first computer system.

34. A system as in claim 32, in which the first computer system further comprises a public key stored in a memory device in communication with said first computer system, said public key being associated with the fourth computer system, the public key corresponding to a private key used to sign the second digital certificate.

35. A system as in claim 30, in which at least some of the digital certificates comprise SPKI certificates.

36. A system as in claim 30, in which at least some of the digital certificates comprise Keynote certificates.

37. A system as in claim 30, wherein the endpoint computation includes a steady state of said set of authorization values.

38. A system as in claim 30, wherein the endpoint computation includes an authorization of the electronic request.