Skip to main content

Basic Mathematical Properties of Multiparty Joint Authentication in Grids

  • Conference paper
  • 859 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3314))

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.

This research is supported by the National Grand Fundamental Research 973 Program of China (No.2002CB312002), China Grid Project, China Postdoctoral Science Foundation, and Grand Project of the Science and Technology Commission of Shanghai Municipality (No.03dz15027).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ferreira, L., Berstis, V., Armstrong, J., Kendzierski, M., Neukoetter, A., Takagi, M., Bing-Wo, R., Amir, A., Murakawa, R., Hernandez, O., Magowan, J., Bieberstein, N.: Introduction to Grid Computing with Globus. IBM Corp. (2002)

    Google Scholar 

  2. Siebenlist, F., Welch, V., Tuecke, S., Foster, I., Nagaratnam, N., Janson, P., Dayka, J., Nadalin, A.: OGSA Security Roadmap. GGF OGSA Sec. Workgroup Doc. (2002)

    Google Scholar 

  3. Welch, V., Siebenlist, F., Foster, I., Bresnahan, J., Czajkowski, K., Gawor, J., Kesselman, C., Meder, S., Pearlman, L., Tuecke, S.: Security for Grid Services. In: Azada, D. (ed.) Proc. of 12th Intl. Symposium on H. Performance Distributed Computing, pp. 48–57. IEEE Press, Washington (2003)

    Chapter  Google Scholar 

  4. Foster, I., Kesselman, C., Tsudik, G., Tuecke, S.: A Security Architecture for Computational Grids. In: Li, G., Reiter, M. (eds.) Proc. of the 5th ACM Conf. on Computer and Comm. Sec., pp. 83–92. ACM Press, New York (1998)

    Chapter  Google Scholar 

  5. Website, http://www.oasis-open.org/

  6. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure, pp. 259–278. Morgan Kaufmann Publisher, San Francisco (1998)

    Google Scholar 

  7. Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid, Enabling Scalable Virtual Organizations. Intl. J. of H. Performance Computing Applications 3, 200–222 (2001)

    Article  Google Scholar 

  8. Brualdi, R.: Introductory Combinatorics, 3rd edn. Pearson Ed. Inc., London (1999)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, H., Li, M. (2004). Basic Mathematical Properties of Multiparty Joint Authentication in Grids. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24127-0

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics