Skip to main content

Hierarchical Time-Bound Key Management for Mobile Agents

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5574))

  • 1809 Accesses

Abstract

The core competencies that a mobile agent possesses are free-roaming between different environment, and autonomous environment detection and adaptation while executing the tasks that are assigned by the users. Because of these competencies, the concept of mobile agent is widely used in many different fields, such as Internet business, wireless communication, and information security technologies and etc. In 1983, Akl and Taylor [1] suggested the concept of superkey to resolve the key management issues faced by the mobile agent. Later in 1998, Volker and Mehrdad [2] proposed a hierarchical mobile agent model for access control. The proposed paper would be based upon the studies of superkey and a hierarchical mobile agent model with addition of elliptic curve cryptosystem (ECC). ECC enhances the mobile agent model, because of shorter key length and higher efficiency on encryption and decryption. All the related works would be presented in Section 2. After the background of our proposal is well described, we would aim to resolve the key management issue created by Volker and Mehrdad’s model. Time-bound key management is considered to be a good solution, because it can make the key management in the existing mobile agent model more convenient by distributing the keys that can only be used in a limited period of time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems 1(3), 239–248 (1983)

    Article  Google Scholar 

  2. Volker, R., Mehrdad, J.S.: Access control and key management for mobile agents. Computer Graphics 22(4), 457–461 (1998)

    Article  Google Scholar 

  3. Karmouch, A.: Mobile Software Agents for Telecommunications, Guest Editorial. IEEE Communications Magazine 36(7), 24–25 (1998)

    Article  Google Scholar 

  4. Lin, I.C., Ou, H.H., Hwang, M.S.: Efficient access control and key management schemes for mobile agents. Computer Standards & Interfaces 26(5), 423–433 (2004)

    Article  Google Scholar 

  5. Hohl, F.: A model of attacks malicious hosts against mobile agents. In: Proceedings of the 4th Workshop on Mobile Object Systems: Secure Internet Mobile Computations, Brussels, Belgium, pp. 105–120 (1998)

    Google Scholar 

  6. Lange, D.B., Oshima, M.: Programming and Deploying Java Mobile Agents with Aglets. Addison-Wesley Press, Massachusetts (1998)

    Google Scholar 

  7. Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)

    Google Scholar 

  8. Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation 48(177), 203–209 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Aydin, M.A., Aydin, G.Z.: A Survey of Elliptic Curve Cryptography 6(2), 211–221 (2006)

    Google Scholar 

  10. Huang, K.H., Chung, Y.F., Liu, C.H., Lai, F., Chen, T.S.: Efficient migration for mobile computing in distributed networks,Computer Standards & Interfaces (2007) (in press)

    Google Scholar 

  11. Shieh, C.W.: An Efficient Design Of Elliptic Curve Cryptography Processor, Master’s Thesis, Tatung University, Taipei (2006)

    Google Scholar 

  12. Wu, S.T.: Authentication and Group Secure Communications Using Elliptic Curve Cryptography, Doctoral Dissertation, National Taiwan University of Science and Technology, Taipei (2005)

    Google Scholar 

  13. Guan, D.J., Jen, L.h.: Study and Implementation of Elliptic Curve Cryptosystem, Master’s Thesis, National Sun Yat-sen University of Technology, Kaohsiung (2005)

    Google Scholar 

  14. Chien, H.Y.: Efficient Time-Bound Hierarchical Key Assignment Scheme. IEEE Trans. Knowledge and Data Eng. 16(10), 1301–1304 (2004)

    Article  Google Scholar 

  15. Bertino, E., Shang, N., Wagstaff, S.S.: An Efficient Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting. IEEE Trans. Actions on Dependable and Secure Computing 5(2), 65–70 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chung, YF., Chen, TS., Ho, CC., Yeh, YH., Ko, HC. (2009). Hierarchical Time-Bound Key Management for Mobile Agents. In: Hua, A., Chang, SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03095-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03094-9

  • Online ISBN: 978-3-642-03095-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics