Skip to main content
SpringerLink
Log in

Secrecy in Untrusted Networks

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

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

Included in the following conference series:

Abstract

We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies and security protocols over distributed, mobile infrastructures, and aims to stand to ambients as the spi calculus stands to π. We present a type system that separates trusted and untrusted data and code, while allowing safe interactions with untrusted sites. We prove that the type system enforces a privacy property, and show the expressiveness of the calculus via examples and an encoding of the spicalculus.

Research supported by EU FET-GC ‘MyThS: Models and Types for Security in Mobile Distributed Systems’ IST-2001-32617 and ‘Mikado: Mobile Calculi based on Domains’ IST-2001-32222, and by MIUR Project ‘Modelli Formali per la Sicurezza’.

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

Access this chapter

Log in via an institution
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. M. Abadi. Protection in programming-language translations. In Proceedings of ICALP’98, number 1443 in LNCS, pages 868–883. Springer-Verlag, 1998.

    Google Scholar 

  2. M. Abadi and B. Blanchet. Analyzing security protocols with secrecy types and logic programs. In Proceedings of POPL’02, pages 33–44. ACM Press, 2002.

    Google Scholar 

  3. M. Abadi and A. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1):1–70, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Bugliesi and G. Castagna. Secure safe ambients. In Procedings of POPL’01, pages 222–235. ACM Press, 2001.

    Google Scholar 

  5. M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In Proceedings of TACS’01, number 2215 in LNCS, pages 38–63. Springer-Verlag, 2001.

    Google Scholar 

  6. M. Bugliesi, G. Castagna, and S. Crafa. Reasoning about security in mobile ambients. In Proceedings of CONCUR 2001, number 2154 in LNCS, pages 102–120. Springer-Verlag, 2001.

    Chapter  Google Scholar 

  7. M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication interference in mobile boxed ambients. In FST&TCS 2002, volume 2556 of LNCS, pages 71–84. Springer-Verlag, 2002.

    Google Scholar 

  8. L. Cardelli. Abstractions for mobile computations. In Secure Internet Programming, number 1603 in LNCS, pages 51–94. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  9. L. Cardelli, G. Ghelli, and A. D. Gordon. Secrecy and group creation. In Proceedings of CONCUR’00, number 1877 in LNCS, pages 365–379. Springer-Verlag, August 2000.

    Google Scholar 

  10. L. Cardelli and A. Gordon. Mobile ambients. In FoSSaCS’98, number 1378 in LNCS, pages 140–155. Springer-Verlag, 1998.

    Google Scholar 

  11. S. Crafa, M. Bugliesi, and G. Castagna. Information Flow Security for Boxed Ambients. ENTCS, 66(3), 2002.

    Google Scholar 

  12. R. De Nicola, G. Ferrari, and R. Pugliese. Klaim: a kernel language for agents interaction and mobility. IEEE Transactions on Software Engeneering, 24:315–330, 1998.

    Article  Google Scholar 

  13. C. Fournet, J-J. Levy, and Schmitt. A. An asynchronous, distributed implementation of mobile ambients. In Proceedings of IFIP TCS’00, number 1872 in LNCS. Springer-Verlag, 2000.

    Google Scholar 

  14. A. D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In Proceedings of CSFW 2001, pages 145–159. IEEE Computer Society, 2001.

    Google Scholar 

  15. M. Hennesy and J. Riely. Type-safe execution of mobile agents in anonymous networks. In Secure Internet Programming: Security Issues for Mobile and Distributed Objects, number 1603 in LNCS, pages 95–115. Springer-Verlag, 1999.

    Google Scholar 

  16. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proceedings of POPL’00, pages 352–364. ACM Press, 2000.

    Google Scholar 

  17. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Parts I and II. Information and Computation, 100:1–77, September 1992.

    Article  MATH  MathSciNet  Google Scholar 

  18. T. Sander and C. Tschudin. Towards mobile cryptography. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 1998.

    Google Scholar 

  19. D. Sangiorgi and A. Valente. A distributed abstract machine for safe ambients. In Proc. of ICALP 2001, pages 408–420, 2001.

    Google Scholar 

  20. U. G. Wilhelm, L. Buttyàn, and S. Staamann. On the problem oftrust in mobile agent systems. In Symposium on Network and Distributed System Security. Internet Society, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università “Ca’ Foscari”, Venezia

    Michele Bugliesi & Silvia Crafa

  2. Max-Planck-Institut für Informatik, Germany

    Amela Prelic

  3. University of Sussex, UK

    Vladimiro Sassone

Authors
  1. Michele Bugliesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvia Crafa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amela Prelic
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bugliesi, M., Crafa, S., Prelic, A., Sassone, V. (2003). Secrecy in Untrusted Networks. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation