Abstract
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 as a whole 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 and proved. © Springer-Verlag 2004.
Cite
CITATION STYLE
Liu, H., & Li, M. (2004). Basic mathematical properties of Multiparty Joint Authentication in Grids. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 172–181. https://doi.org/10.1007/978-3-540-30497-5_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
