Skip to main content

Semantics and Enforcement of Expressive Information Flow Policies

  • Conference paper
  • 387 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5983))

Abstract

The following is intended as an overview of my invited talk at the 2009 FAST workshop. The primary reference for this work remains the earlier paper [4] that contains the necessary technical details, motivating examples and commentary on particular design choices.

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   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

Learn about institutional subscriptions

References

  1. Amtoft, T., Banerjee, A.: Information flow analysis in logical form. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 100–115. Springer, Heidelberg (2004)

    Google Scholar 

  2. Amtoft, T., Bandhakavi, S., Banerjee, A.: A logic for information flow in object-oriented programs. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 91–102 (2006)

    Google Scholar 

  3. Askarov, A., Sabelfeld, A.: Gradual release: Unifying declassification, encryption and key release policies. In: IEEE Symposium on Security and Privacy, pp. 207–221 (2007)

    Google Scholar 

  4. Banerjee, A., Naumann, D., Rosenberg, S.: Expressive declassification policies and their modular static enforcement. In: IEEE Symposium on Security and Privacy, pp. 339–353 (2008)

    Google Scholar 

  5. A. Banerjee, D. Naumann, and S. Rosenberg. Regional logic for local reasoning about global invariants. In ECOOP. pages 387–411, 2008.

    Chapter  Google Scholar 

  6. Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: POPL, pp. 14–25 (2004)

    Google Scholar 

  7. Broberg, N., Sands, D.: Flow locks. In: ESOP, pp. 180–196 (2006)

    Google Scholar 

  8. Chong, S., Myers, A.C.: Security policies for downgrading. In: ACM CCS, pp. 198–209 (2004)

    Google Scholar 

  9. Myers, A.C.: JFlow: Practical mostly-static information flow control. In: POPL, pp. 228–241 (1999)

    Google Scholar 

  10. Rushby, J.: Noninterference, transitivity, and channel-control security policies. Technical report, SRI (December 1992)

    Google Scholar 

  11. Sabelfeld, A., Myers, A.C.: A model for delimited information release. In: Futatsugi, K., Mizoguchi, F., Yonezaki, N. (eds.) ISSS 2003. LNCS, vol. 3233, pp. 174–191. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Sabelfeld, A., Sands, D.: Dimensions and principles of declassification. Journal of Computer Security (2007)

    Google Scholar 

  13. Zdancewic, S.: Challenges for information-flow security. In: Proceedings of the 1st International Workshop on the Programming Language Interference and Dependence, PLID 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banerjee, A. (2010). Semantics and Enforcement of Expressive Information Flow Policies. In: Degano, P., Guttman, J.D. (eds) Formal Aspects in Security and Trust. FAST 2009. Lecture Notes in Computer Science, vol 5983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12459-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12459-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12458-7

  • Online ISBN: 978-3-642-12459-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics