Noninterference with Local Policies

DOI10.1007/978-3-642-40313-2_31MaRDI QIDQ2849922zbMATH OpenOpenAlexFDO

Authors Sebastian Eggert, Henning Schnoor, Thomas Wilke

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1208.5580

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: We develop a theory for state-based noninterference in a setting where different security policies---we call them local policies---apply in different parts of a given system. Our theory comprises appropriate security definitions, characterizations of these definitions, for instance in terms of unwindings, algorithms for analyzing the security of systems with local policies, and corresponding complexity results.

Recommendations

• Noninterference with dynamic security domains and policies
• Modifying Security Policies for the Satisfaction of Intransitive Non-Interference
• Noninterference through flow analysis
• Downgrading policies and relaxed noninterference
• Foundations of Software Science and Computational Structures
• Localization privacy
• scientific article; zbMATH DE number 1497862
• Noninterference for free
• Local zero knowledge
• Cryptographic enforcement of information flow policies without public information

Cited in

(3)

• Elements of security: Closure, convergence, and protection
• Dynamic intransitive noninterference revisited
• Formal Specification of a Generic Separation Kernel

This page was built for publication: Noninterference with Local Policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849922)