Compositionality Results for Quantitative Information Flow
نویسندگان
چکیده
In the min-entropy approach to quantitative information flow, the leakage is defined in terms of a minimization problem, which, in case of large systems, can be computationally rather heavy. The same happens for the recently proposed generalization called g-vulnerability. In this paper we study the case in which the channel associated to the system can be decomposed into simpler channels, which typically happens when the observables consist of several components. Our main contribution is the derivation of bounds on the g-leakage of the whole system in terms of the g-leakages of its components.
منابع مشابه
Visualizing and Understanding Neural Models in NLP
While neural networks have been successfully applied to many NLP tasks the resulting vector-based models are very difficult to interpret. For example it’s not clear how they achieve compositionality, building sentence meaning from the meanings of words and phrases. In this paper we describe four strategies for visualizing compositionality in neural models for NLP, inspired by similar work in co...
متن کاملOn the Compositionality of Quantitative Information Flow
Information flow is the branch of security that studies the leakage of information due to correlation between secrets and observables. Since in general such correlation cannot be avoided completely, it is important to quantify the leakage. The most followed approaches to defining appropriate measures are those based on information theory. In particular, one of the most successful approaches is ...
متن کاملCompositionality for quantitative specifications
We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how t...
متن کاملTensor Universality, Quantum Information Flow, Coecke’s Theorem, and Generalizations
We show that Coecke’s compositionality theorem for quantum information flow follows by the universal property of tensor products from the case in which all relevant states are totally disentangled, for which the proof is almost trivial. With the same technique we deduce a PROP structure behind general multipartite quantum information processing and show that all such are equivalent to a canonic...
متن کاملCompatibility of Safety Properties and Possibilistic Information Flow Security in MAKS
Motivated by typical security requirements of workflow management systems, we consider the integrated verification of both safety properties (e.g. separation of duty) and information flow security predicates of the MAKS framework (e.g. modeling confidentiality requirements). Due to the refinement paradox, enforcement of safety properties might violate possibilistic information flow properties o...
متن کامل