Skip to main content

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

Abstract

This paper addresses the issue of confidentiality and declassification for global computing in a language-based security perspective. The purpose is to deal with new forms of security leaks, which we call migration leaks, introduced by code mobility. We present a generalization of the non-disclosure policy [AB05] to networks, and a type and effect system for enforcing it. We consider an imperative higher-order lambda-calculus with concurrent threads and a flow declaration construct, enriched with a notion of domain and a standard migration primitive.

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. Almeida Matos, A., Boudol, G.: On declassification and the nondisclosure policy. In: CSFW (2005)

    Google Scholar 

  2. Almeida Matos, A., Boudol, G., Castellani, I.: Typing noninterference for reactive programs. In: FCS. TUCS General Publications, vol. 31 (2004)

    Google Scholar 

  3. Boudol, G., Castellani, I.: Noninterference for concurrent programs and thread systems. Theoretical Computer Science 281(1), 109–130 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, p. 38. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Boudol, G., Castellani, I., Germain, F., Lacoste, M.: Analysis of formal models of distribution and mobility: state of the art. Mikado D1.1.1 (2002)

    Google Scholar 

  6. Boudol, G.: ULM, a core programming model for global computing. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 234–248. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Boudol, G.: On typing information flow. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 366–380. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Crafa, S., Bugliesi, M., Castagna, G.: Information flow security for boxed ambients. In: F-WAN. ENTCS, vol. 66(3) (2002)

    Google Scholar 

  9. Denning, D.E.: A lattice model of secure information flow. Communications of the ACM 19(5), 236–243 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  10. Goguen, J.A., Meseguer, J.: Security policies and security models. In: Symposium on Security and Privacy (1982)

    Google Scholar 

  11. Hennessy, M., Riely, J.: Information flow vs resource access in the asynchronous pi-calculus. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 415. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Honda, K., Vasconcelos, V., Yoshida, N.: Secure information flow as typed process behaviour. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, p. 180. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Lucassen, J.M., Gifford, D.K.: Polymorphic effect systems. In: POPL (1988)

    Google Scholar 

  14. Myers, A., Liskov, B.: Complete, safe information flow with decentralized labels. In: Symposium on Security and Privacy (1998)

    Google Scholar 

  15. Sabelfeld, A.: The impact of synchronization on secure information flow in concurrent programs. In: Andrei Ershov International Conference on Perspectives of System Informatics (2001)

    Google Scholar 

  16. Sabelfeld, A., Mantel, H.: Static confidentiality enforcement for distributed programs. In: CCL 1999. LNCS, vol. 2477 (2002)

    Google Scholar 

  17. Sabelfeld, A., Myers, A.: Language-based information-flow security. Journal on Selected Areas in Communications 21(1) (2003)

    Google Scholar 

  18. Smith, G.: A new type system for secure information flow. In: CSFW (2001)

    Google Scholar 

  19. Sabelfeld, A., Sands, D.: Dimensions and principles of declassification. In: CSFW (2005)

    Google Scholar 

  20. Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: POPL (1998)

    Google Scholar 

  21. Volpano, D., Smith, G., Irvine, C.: A sound type system for secure flow analysis. Journal of Computer Security 4(3) (1996)

    Google Scholar 

  22. Zdancewic, S., Zheng, L., Nystrom, N., Myers, A.C.: Secure program partitioning. ACM Transactions in Computer Systems 20(3), 283–328 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matos, A.A. (2005). Non-disclosure for Distributed Mobile Code. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_14

Download citation

  • DOI: https://doi.org/10.1007/11590156_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30495-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics