Basic mathematical properties of multiparty joint authentication in grids

Authors:
Hui Liu;Minglu Li
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 5
Cited 0

A security architecture for computational grids

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Security for Grid Services

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Introduction to grid computing with globus

Introduction to grid computing with globus

Quantified Score

Hi-index	0.00

Visualization

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.