
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael K. Reiter, Stuart G. Stubblebine, "Resilient Authentication Using Path Independence," IEEE Transactions on Computers, vol. 47, no. 12, pp. 13511362, December, 1998.  
BibTex  x  
@article{ 10.1109/12.737682, author = {Michael K. Reiter and Stuart G. Stubblebine}, title = {Resilient Authentication Using Path Independence}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {12}, issn = {00189340}, year = {1998}, pages = {13511362}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.737682}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Resilient Authentication Using Path Independence IS  12 SN  00189340 SP1351 EP1362 EPD  13511362 A1  Michael K. Reiter, A1  Stuart G. Stubblebine, PY  1998 KW  Security KW  authentication KW  public key certificate KW  certificate path KW  independent paths. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a wellknown technique for authenticating channels in a large distributed system. In this paper, we explore the use of multiple paths to redundantly authenticate a channel and focus on two notions of path independence—
[1] T. Beth, M. Borcherding, and B. Klein, "Valuation of Trust in Open Networks," Proc. Computer Security—ESORICS '94, D. Gollman, ed., pp. 318, 1994.
[2] A.D. Birrell, B.W. Lampson, R.M. Needham, and M.D. Schroeder, "A Global Authentication Service without Global Trust," Proc. 1986 IEEE Symp. Security and Privacy, pp. 223230, Apr. 1986.
[3] International Telegraph and Telephone Consultative Committee (CCITT), The Directory—Authentication Framework, Recommendation X.509, 1988.
[4] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269271, 1959.
[5] R.C. Entringer, D.E. Jackson, and P.J. Slater, "Geodetic Connectivity of Graphs," IEEE Trans. Circuits and Systems, vol. 24, no. 8, pp. 460463, Aug. 1977.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[7] M.R. Garey, D.S. Johnson, and L. Stockmeyer, "Some Simplified NPComplete Graph Problems," Theoretical Computer Science, vol. 1, pp. 237267, 1976.
[8] V.D. Gligor, S. Luan, and J.N. Pato, "On InterRealm Authentication in Large Distributed Systems," Proc. 1992 IEEE Symp. Research in Security and Privacy, pp. 217, May 1992.
[9] A. Itai, Y. Perl, and Y. Shiloach, "The Complexity of Finding Maximum Disjoint Paths with Length Constraints," Networks, vol. 12, pp. 277286, 1982.
[10] D.S. Johnson, "Worst Case Behavior of Graph Coloring Algorithms," Proc. Fifth Southeastern Conf. Combinatorics, Graph Theory, and Computing, pp. 513527, Feb. 1974.
[11] S. Kent, "Internet Privacy Enhanced Mail," Comm. ACM, vol. 36, no. 8, pp. 4860, Aug. 1993.
[12] V. King, S. Rao, and R. Tarjan, "A Faster Deterministic Maximum Flow Algorithm," Proc. Third ACM Symp. Discrete Algorithms, pp. 157164, 1992.
[13] B. Lampson et al., "Authentication in Distributed Systems: Theory and Practice," ACM Trans. Computer Systems, Nov. 1992, pp. 265310.
[14] R. Levien and A. Aiken, "AttackResistant Trust Metrics for Public Key Certification," Seventh USENIX Security Symp. Proc, pp. 229242, Jan. 1998.
[15] L. Lovász, V. NeumannLara, and M. Plummer, "Mengerian Theorems for Paths of Bounded Length," Periodica Mathematica Hungarica, vol. 9, no. 4, pp. 269276, 1978.
[16] U. Maurer, "Modelling a PublicKey Infrastructure," Computer Security—ESORICS '96, E. Bertino, H. Kurth, G. Martella, and E. Montolivo, eds., 1996.
[17] N. McBurnett, "PGP Web of Trust Statistics," http://bcn.boulder.co.us/ ~nealpgpstat/, 1996.
[18] M.K. Reiter and S.G. Stubblebine, "Path Independence for Authentication in LargeScale Systems," Proc. Fourth ACM Conf. Computer and Comm. Security, pp. 5766, Apr. 1997.
[19] M.K. Reiter and S.G. Stubblebine, "Toward Acceptable Metrics of Authentication," Proc. 1997 IEEE Symp. Security and Privacy, pp. 1020, May 1997.
[20] D. Ronen and Y. Perl, "Heuristics for Finding a Maximum Number of Disjoint Bounded Paths," Networks, vol. 14, pp. 531544, 1984.
[21] F.B. Schneider, "Implementing FaultTolerant Services Using the State Machine Approach: A Tutorial," ACM Computing Surveys, vol. 22, no. 4, pp. 299319, Dec. 1990.
[22] J.W. Suurballe, "Disjoint Paths in a Network," Networks, vol. 4, pp. 125145, 1974.
[23] A. Tarah and C. Huitema, "Associating Metrics to Certification Paths," Proc. Computer Security—ESORICS '92, pp. 175189, 1992.
[24] R. Yahalom, B. Klein, and T. Beth, "Trust Relationships in Secure Systems—A Distributed Authentication Perspective," Proc. 1993 IEEE Symp. Research in Security and Privacy, pp. 150164, May 1993.
[25] R. Yahalom, B. Klein, and T. Beth, "TrustBased Navigation in Distributed Systems," Computing Systems, vol. 7, no. 1, pp. 4573, 1994.
[26] P. Zimmerman, The Official PGP User's Guide. MIT Press, 1995.