Basic Mathematical Properties of Multiparty Joint Authentication in Grids

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.

[1]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[2]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[3]  Ian T. Foster,et al.  A security architecture for computational grids , 1998, CCS '98.

[4]  Kenneth P. Bogart,et al.  Introductory Combinatorics , 1977 .

[5]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[6]  R. Brualdi.  Introductory Combinatorics , 1992 .

[7]  Ibm Redbooks.  Introduction to Grid Computing With Globus , 2003 .

[8]  Ian T. Foster,et al.  Security for Grid services , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.