Skip to main content

Formalizing Active Networks Security with Seal-Calculus

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

  • 341 Accesses

Abstract

Active Networks (ANs) aims at incorporating programmability into the network to achieve flexibility. However, increasing flexibility results in new security risks, which cannot be handled by existing ANs systems. In this paper, we aim at analyzing the security of ANs in language level based on the active code. First, we present the notion of active packet hierarchy. Next, we abstract the AN with Seal-calculus, and security protection is represented formally in four propositions. Finally, an example is used to address security protection. Our security protection is symmetrical, which protects a host from the untrustworthy active codes that migrate to it as well as active codes from the untrustworthy host where it migrates.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. R. Milner, J Parrow, and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, Sept.1992.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Fournet, G. Gonthier, J. Levy, L. Marnaget, and D. Remy, A calculus of Mobile Agents, Proceedings of CONCUR’96, LNCS, Vol.1119, pp. 406–421, Springer, 1996.

    Google Scholar 

  3. L. Cardelli and A.D. Gordon, Mobile Ambients, Foundations of software Science and Computation Structures, LNCS, Vol.1378, pp. 140–155,1998.

    Google Scholar 

  4. Jan Viteck and Giuseppe Castsgna. A calculus of secure mobile computations. In Proceedings of the IEEE Workshop on Internet Programming Languages, (WIPL). Chicago, I11.1998.

    Google Scholar 

  5. Konstantinos Psounis. Active networks: Application, security, safety and architectures. IEEE Communication Surveys. http://www.comsoc.org.pubs/surveys. First Quarter, 1999

    Google Scholar 

  6. D. Scott Alexander, william A. Arbaugh, Angelos D. Keromytis, and Jonathan M. Smith. Safety and Security of Programmable Network Infrastructures. IEEE Communications Magazine, 36(10):84–92, 1998.

    Article  Google Scholar 

  7. AN Security Working Group, “Security architecture for active nets”, July 1998, available online at ftp://ftp.tislabs.com/pub/activenets/ secrarch2.ps.

    Google Scholar 

  8. J. Moore. Mobile code Security Techniques. Technical Reportms-CIS-98-28, University of Pennsylvania, May 1998.

    Google Scholar 

  9. J. Vitek and G. Castagna. Seal: A framework for secure mobile computation. In Internet Programming Languages, number 1686 in Lecture Notes in Computer Science. Springer, 1999.

    Chapter  Google Scholar 

  10. G. Castagna and J. Vitek. Confinement and commitment for the seal calculus. Nov. 1998.

    Google Scholar 

  11. D Scott Alexander, Michael Hicks, Angelos D. Keromytis, A Taxonomy of Active Code. http://citeseer.nj.nec.com/alexander99taxonomy.html

    Google Scholar 

  12. Schwartz, A. Jackson, T. Strayer, W. Zhou, R. Rockwell, and C. Partridge. Smart packets for active networks. In Proceedings of the 1999 IEEE 2nd Conference on Open Architectures and Network Programming(OPENARCH’99), March 1999

    Google Scholar 

  13. Michael Hicks, Pankaj Kakkar, Jonathan T. Moore, Carl A. Gunter and Scott Nettles. PLAN: A packer language for active networks. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP’98), September 1998

    Google Scholar 

  14. David J. Wetherall, John Guttag, and David L, Tennenhouse. ANTS: A toolkit for building and dynamically deploying network protocols. In Proceedings of the 1998 IEEEConference on Open Architecture and Network Programming (OPENARCH’98), April 1998

    Google Scholar 

  15. Scott Alexander. ALIEN: A generalized computing model of active network. PHD thesis University of Pennsylvania, 1998

    Google Scholar 

  16. Scott Alexander, William A. Arbaugh, Michael W. Hicks, Pankaj Kakkar, Angelos D. Keromytis, Jonathan T. Moore, Carl A. Gunter, Scott M. Nettles, and Jonathan M. Smith. The SwitchWare active network architecture, IEEE Network, special issue on Active and Programmable Networks, May/June 1998

    Google Scholar 

  17. Jonathan T. Moore. Safe and Efficient Active Packets. Technical Report MS-CIS-99-24, Department of Computer and Information Science, University of Pennsylvania, October 1999

    Google Scholar 

  18. Ian Wakeman. Et al., Designing a programming language for active networks. http://www.cogs.susx.ac.uk/projects/safetynet. Submitted to Hipparch special issue of Network and ISDN System, January 1999

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, X., Xu, T., Jin, Y. (2003). Formalizing Active Networks Security with Seal-Calculus. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics