Authentication metric analysis and design
- 1 May 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 2 (2) , 138-158
- https://doi.org/10.1145/317087.317088
Abstract
Authentication using a path of trusted intermediaries, each able to authenicate the next in the path, is a well-known technique for authenicating entities in a large-scale system. Recent work has extended this technique to include multiple paths in an effort to bolster authentication, but the success of this approach may be unclear in the face of intersecting paths, ambiguities in the meaning of certificates, and interdependencies in the use of different keys. Thus, several authors have proposed metrics to evaluate the confidence afforded by a set of paths. In this paper we develop a set of guiding principles for the design of such metrics. We motivate our principles by showing how previous approaches failed with respect to these principles and what the consequences to authentication might be. We then propose a new metric that appears to meet our principles, and so to be a satisfactory metric of authenticaiton.Keywords
This publication has 10 references indexed in Scilit:
- SPX: global authentication using public key certificatesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Resilient authentication using path independenceIEEE Transactions on Computers, 1998
- Prudent engineering practice for cryptographic protocolsIEEE Transactions on Software Engineering, 1996
- Robustness Principles for Public Key ProtocolsPublished by Springer Nature ,1995
- Internet Privacy Enhanced MailCommunications of the ACM, 1993
- Authentication in distributed systemsACM Transactions on Computer Systems, 1992
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- A Global Authentication Service without Global TrustPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956