Abstract
Clashing security policies leads to vulnerabilities. Violating security policies leads to vulnerabilities. A system today operates in the context of a multitude of security policies, often one per application, one per process, one per user. The more security policies that have to be simultaneously satisfied, the more likely the possibility of a clash or violation, and hence the more vulnerable our system is to attack. Moreover, over time a system’s security policies will change. These changes occur at small-scale time steps, e.g., using setuid to temporarily grant a process additional access rights; and at large-scale time steps, e.g., when a user changes his browser’s security settings. We address the challenge of determining when a system is in a consistent state in the presence of diverse, numerous, and dynamic interacting security policies.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dean, D., Felten, E.W., Wallach, D.S.: Java Security: From HotJava to Netscape and Beyond. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA (May 1996)
Nielson, S., Fogarty, S.J., Wallach, D.S.: Attacks on Local Searching Tools. Technical Report TR04-445, Department of Computer Science, Rice University (December 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pincus, J., Wing, J.M. (2005). Towards an Algebra for Security Policies. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_3
Download citation
DOI: https://doi.org/10.1007/11494744_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)