ACM Home Page
Please provide us with feedback. Feedback
Path independence for authentication in large-scale systems
Full text PdfPdf (1.35 MB)
Source Conference on Computer and Communications Security archive
Proceedings of the 4th ACM conference on Computer and communications security table of contents
Zurich, Switzerland
Pages: 57 - 66  
Year of Publication: 1997
ISBN:0-89791-912-2
Authors
Michael K. Reiter  AT&T Laboratories--Research, Murray Hill, New Jersey
Stuart G. Stubblebine  AT&T Laboratories--Research, Murray Hill, New Jersey
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 13,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/266420.266435
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. D. Birrell, B. W. Lampson, R. M. Needham and M. D. Schrocder. A global authentication service without global trust. In Proceedings of the I986 IEEE Symposium or, Security and Privacy, pages 223-230, April 1986.
 
3
International Telegraph and Telephone Consultative Committee (CCITT). The Directory - Authentication Framework, Recommendation ){.509, 1988.
 
4
E. W. Dijkstra. A note on two problems in connexion with graphs. Numeriache Mathematik, 1:269-271, 1959.
 
5
R. C. Entringer, D. E. Jackson, and P. J. Slater. Geodetic connectivity of graphs. IEEE Transactions on Circuits and Systems CAS-24(8):460-463, August 1977.
 
6
 
7
M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complcte graph problems. Theoretica! Computer Science 1:237-267, 1976.
 
8
 
9
A. Itai, Y. Pcrl, and Y. Shiloach. The complexity of finding maximum disjoint paths with length constraints. Networks 12:277-286, 1982.
 
10
D. S. Johnson. Worst case behavior of graph coloring algorithms. In Proceedings of the 5th Southeastern Gonference on Combina~orica, Graph Theory, and Computing, pages 513- 527, February 1974.
11
 
12
13
 
14
L. Lov~sz, V. Neumann-Lara, and M. Plummer. Mengerlan theorems for paths of bounded length. Periodica Mathematics Hungariea 9(4):269-276, 1978.
 
15
 
16
N. McBurnett. PGP web of trust statistics. http: ilbcn.boulder, co .us/*nenl/pgpstat/, 1996.
 
17
D. Ronen and Y. Perl. Heuristics for finding a maximum number of disjoint bounded paths. Networks 14:531-544, 1984.
18
 
19
J. W. Suurballe. Disjoint paths in a network. Networks 4:125-145, 1974.
 
20
 
21
 
22
 
23

CITED BY  10

Collaborative Colleagues:
Michael K. Reiter: colleagues
Stuart G. Stubblebine: colleagues