This paper introduces the semantic of Multiparty Joint Authentication (MJA) into the authentication service, which is to find simplified or optimal authentication solutions for all involved principals through their transitive trust instead of to authenticate each pair of principals in turn. MJA is designed to support multiparty security contexts in grids with a specified, understood level of confidence and reduce the time cost of mutual authentications. Graph theory model is employed to define MJA, and analyze its mathematical properties. Two algorithms to find an n-principal, n-order MJA solution are also presented. MJA is indeed a trust aware mechanism and will promote trust aware grid computing eventually. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Liu, H., & Li, M. (2004). Paradigm of multiparty joint authentication: Evolving towards trust aware grid computing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 474–483. https://doi.org/10.1007/978-3-540-30566-8_57
Mendeley helps you to discover research relevant for your work.