Method for authenticating a channel in large-scale distributed systems

• US 6,049,872 A
• Filed: 05/06/1997
• Issued: 04/11/2000
• Est. Priority Date: 05/06/1997
• Status: Expired due to Fees

• Current Assignee: AT&T Corporation (AT&T, Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Stubblebine, Stuart Gerald, Reiter, Michael Kendrick
• Primary Examiner(s): Barron, Jr., Gilberto
• Application Number:
  US08/851,658
• Time in Patent Office: 1,071 Days
• Field of Search: 380/25, 380/49, 713/200, 713/201, 713/155, 713/156, 713/157, 713/168, 713/175, 713/150, 709/220, 709/223, 709/224, 709/225, 709/229
• US Class Current: 713/157
• CPC Class Codes: H04L 63/126 the source of the received data
• CPC Class Codes: H04L 9/3215 using a plurality of channels network architectures or network communication protocols using different networks H04L63/18
• 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

Authenticating the source of a message in a large distributed system can be difficult due to the lack of a single authority that can tell for whom a channel speaks. This has led many to propose the use of a path of authorities, each able to authenticate the next, such that the first authority in the path can be authenticated by the message recipient and the last authority in the path can authenticate the message source. The present invention uses multiple ones of such paths, no two of which share a common authority, to provide independent confirmation of the message source. As the problem of finding a maximum set of such paths of bounded length in a graph-theoretic framework can be shown to be NP-hard, the present invention includes approximation algorithms for this problem. The present invention also includes a PathServer for PGP, a service for finding maximum sets of such paths to support authentication in PGP-based applications.

Claims

1. A method for authenticating a channel in a large distributed system, comprising the steps of:

a) determining a set of independent paths, each of length at most a predetermined value, by which the channel could have been authenticated; and

b) using the paths in the set to authenticate the channel.

2. The method according to claim 1, wherein the set of independent paths comprises a set of disjoint paths.

3. The method according to claim 1, wherein the set of independent paths comprises a set of connective paths.

4. The method according to claim 1, further comprising the step of requiring a plurality of paths in the set to authenticate the channel.

5. The method according to claim 1, wherein step c) further comprises requiring a supermajority vote before authenticating the channel.

6. The method according to claim 1, wherein step c) further comprises requiring a unanimous vote before authenticating the channel.

7. A method for authenticating a target channel (t) using a source channel (s) in a large distributed system comprising the steps of:

a) determining a plurality of bounded disjoint paths from the source channel (s) to the target channel (t) by;

(i) selecting a path from the source (s) channel to the target channel (t) of length at most b that intersects a fewest number of other paths from the source channel (s) to the target channel (t) of at length at most b;

(ii) adding the selected path to the plurality of bounded disjoint paths being determined;

(iii) deleting the selected path along with all incident edges from a graph of the large distributed system to obtain a revised version of the graph; and

(iv) repeating steps (i) through (iii) using a revised version of the graph in each iteration until no more paths can be found in step (i); and

b) using the plurality of bounded disjoint paths to authenticate the target channel (t).

8. The method according to claim 7, wherein the path determined in step a)(i) is a shortest path from the source channel (s) to the target channel (t) with a length less than b.

9. The method according to claim 7, wherein the path determined in step a)(i) is a path from the source channel (s) to the target channel (t) with a length less than b having a smallest degree, wherein a degree of a path is a sum of a degree of each node in the path, and the degree of a node equals a number of edges incident on the node.

10. The method according to claim 7, wherein step a) further comprises the steps of:

(v) assigning a random weight to each node in the graph;

(vi) defining a weight for each path, wherein the weight of each path is the sum of the random weights of the nodes in the path; and

(vii) determining the path in step (i) by generating a random number and selecting the path whose weight matches the random number.

11. A web server providing a plurality of bounded disjoint paths for use in authenticating a target channel (t) using a source channel (s) in a large distributed system comprising:

a) means for interfacing with a user to accept a source channel (s) and a target channel (t) specified by the user;

b) means for determining a plurality of bounded disjoint paths from the source channel (s) to the target channel (t), said means for determining;

(i) selecting a path from the source (s) channel to the target channel (t) of length at most b that intersects a fewest number of other paths from the source channel (s) to the target channel (t) of at length at most b;

(ii) adding the selected path to the plurality of bounded disjoint paths being determined by the determining means;

(iii) deleting the selected path along with all incident edges from a graph of the large distributed system to obtain a revised version of the graph; and

(iv) repeating (i) through (iii) using a revised version of the graph in each iteration until no more paths can be found in (i); and

c) means for outputting the plurality of disjoint paths from the source channel (s) to the target channel (t) upon request by a user.

12. The web server according to claim 11, wherein the path determined by the determining means constitutes a shortest path from the source channel (s) to the target channel (t) with a length less than b.

13. The web server according to claim 11, wherein the path determined by the determining means constitutes a path from the source channel (s) to the target channel (t) with a length less than b having a smallest degree, wherein a degree of a path is a sum of a degree of each node in the path, and the degree of a node equals a number of edges incident on the node.

14. The web server according to claim 11, wherein the determining means assigns a random weight to each node in the graph, defines a weight for each path, the weight of each path being a sum of each random weight of the nodes in the path, and determines the path by generating a random number and selecting the path whose weight matches the random number.

15. The web server according to claim 11, wherein the means for interfacing with the user further comprises a World Wide Web interface by which a user can submit a path length bound, a plurality of PGP identifiers for a source key and a target key, and a choice of disjoint or connective paths and receive in real time a display of a plurality of requested paths.

16. An apparatus for determining an owner of a query key using a sequence of certificates from a trusted key to the query key, wherein a key in each certificate in the sequence verifies a signature on a next certificate in the sequence, and a certificate binds a key to a name and email address using a digital signature, said apparatus comprising:

a) a processor determining a plurality of bounded independent paths from the trusted key to the query key;

b) a database being coupled to the processor and storing a plurality of PGP certificates, wherein said database includes an interface for receiving periodic updates from a plurality of PGP key servers; and

c) a graphical user interface accepting input from the user regarding a path length bound, the trusted key, and the query key.

17. The apparatus according to claim 16, wherein the certificates include IETFX.509 certificates.

18. The apparatus according to claim 16, wherein the graphical user interface includes means for designating an output format, wherein the output format includes graphical, text or ASCII-armored blocks.

19. A method for authenticating a target channel comprising the steps of:

a) determining a set of disjoint b-bounded paths from a source channel to a target channel;

b) augmenting the set of disjoint b-bounded paths from the source channel to the target channel with other b-bounded paths from the source channel to the target channel;

c) choosing a path to augment the set of disjoint b-bounded paths in step b) by minimizing a predetermined criteria; and

d) terminating the step of augmenting upon a predetermined condition.

20. The method according to claim 19, wherein the predetermined criteria comprises choosing a particular path that minimizes a sum of path degrees of nodes within the particular path, wherein the path degree is a degree of c in a subgraph induced by the set of disjoint paths.

21. The method according to claim 19, wherein the predetermined condition includes when the size of the set of disjoint paths equals one half the path bound times an original size of the set of disjoint paths prior to any augmentation.

22. The method according to claim 19, further comprising the step of determining the size of the connectivity by iterating through sets of nodes and testing to determine if a path in the b-closure of the set would continue to exist if those nodes were removed from all other paths in the set.

23. The method according to claim 22, further comprising the step of removing any disjoint path from the set prior to performing the step of determining the size of the connectivity.

24. The method according to claim 19, wherein the step a) of determining further comprises the substeps of:

(i) finding a path from the source channel to the target channel of length at most b that intersects a fewest number of other paths from the source channel to the target channel of at length at most b;

(ii) adding the path found in step (i) to the plurality of bounded disjoint paths being determined;

(iii) deleting the path added in step (ii) along with all incident edges from a graph of the large distributed system; and

(iv) repeating steps (i) through (iii) until no more paths can be found in step (i).

25. The method according to claim 24, wherein the path being found in step (i) is the shortest path from the source channel to the target channel with a length less than b.

26. The method according to claim 24, wherein the path being found in step (i) is a path from the source channel to the target channel with a length less than b having a smallest degree, wherein the degree of the path is a sum of a degree of each node in the path, and the degree of a node equals a number of edges incident on the node.

27. The method according to claim 24, wherein step a) further comprises the substeps of:

(v) assigning a random weight to each node in the graph;

(vi) defining a weight for each path, wherein the weight of each path is the sum of the random weights of the nodes in the path; and

(vii) determining the path in step (i) by generating a random number and selecting the path whose weight matches the random number.

28. A method for assuring authentication for data received comprising the steps of:

a) receiving the data;

b) requesting assurance over a trusted channel to an authentication authority;

c) learning a graph of the received data;

d) determining a set of independent paths by which the channel could have been authenticated;

e) deleting paths from the set determined in step d) whose length exceeds a predetermined value; and

f) using any paths remaining in the set determined in step e) to authenticate the channel.

29. The method according to claim 28, wherein the set of independent paths comprises a set of disjoint paths.

30. The method according to claim 28, wherein the set of independent paths comprises a set of connective paths.

31. The method according to claim 28, further comprising the step of requiring a plurality of paths in the set to authenticate the channel.

32. The method according to claim 28, wherein step f) further comprises requiring a supermajority vote before authenticating the channel.

33. The method according to claim 28, wherein step f) further comprises requiring a unanimous vote before authenticating the channel.