Composition and Declassification in Possibilistic Information Flow Security

http://nbn-resolving.de/urn:nbn:de:gbv:46-00107822-19
https://elib.suub.uni-bremen.de/peid=D00107822
https://elib.suub.uni-bremen.de/edocs/00107822-1.pdf
urn:nbn:de:gbv:46-00107822-19
Bauereiß, Thomas
2019
Universität Bremen: Informatik/Mathematik
Dissertation
information flow control, Bounded Deducibility, compositionality, formal verification, confidentiality, distributed social media platforms, workflow management systems, safety properties, separation of duty
Formal methods for security can rule out whole classes of security vulnerabilities, but applying them in practice remains challenging. This thesis develops formal verification techniques for information flow security that combine the expressivity and scalability strengths of existing frameworks. It builds upon Bounded Deducibility (BD) Security, which allows specifying and verifying fine-grained policies about what information may flow when to whom. Our main technical result is a compositionality theorem for BD Security, providing scalability by allowing us to verify security properties of a large system by verifying smaller components. Its practical utility is illustrated by a case study of verifying confidentiality properties of a distributed social media platform. Moreover, we discuss its use for the modular development of secure workflow systems, and for the security-preserving enforcement of safety and security properties other than information flow control.
DDC
000
2020.01.02/08:59:08
Composition and Declassification in Possibilistic Information Flow Security