| Path independence for authentication in large-scale systems |
| Full text |
Pdf
(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
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 13, Citation Count: 10
|
|
|
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
|
|
|
|
|
|
|
|
Carlisle Adams , Mike Burmester , Yvo Desmedt , Mike Reiter , Philip Zimmermann, Which PKI (public key infrastructure) is the right one? (panel session), Proceedings of the 7th ACM conference on Computer and communications security, p.98-101, November 01-04, 2000, Athens, Greece
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|