Abstract
Constraining information flow is fundamental to security: we do not want secret information to reach untrusted principals (confidentiality), and we do not want untrusted principals to corrupt trusted information (integrity).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chaudhuri, A., Naldurg, P., Rajamani, S.K., Ramalingam, G., Velaga, L.: Eon: modeling and analyzing dynamic access control systems with logic programs. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS 2008, pp. 381–390. ACM, New York (2008)
Livshits, B., Nori, A.V., Rajamani, S.K., Banerjee, A.: Merlin: specification inference for explicit information flow problems. Programming Languages Design and Implementation, PLDI 2009, Also appears in SIGPLAN Notices 44(6), 75–86 (2009)
Naldurg, P., Schwoon, S., Rajamani, S.K., Lambert, J.: Netra: seeing through access control. In: Proceedings of the Fourth ACM Workshop on Formal Methods in Security, FMSE 2006, pp. 55–66. ACM, New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajamani, S.K. (2010). Analyzing Explicit Information Flow. In: Jha, S., Mathuria, A. (eds) Information Systems Security. ICISS 2010. Lecture Notes in Computer Science, vol 6503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17714-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-17714-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17713-2
Online ISBN: 978-3-642-17714-9
eBook Packages: Computer ScienceComputer Science (R0)