We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field m...

Network information flow emerged as a fertile research ground over a decade ago, with the advent of network coding that encourages information flows to be encoded when they meet within a data network. In this work, we propose the problem of space information flow — the transmission of information flows in a geometric space, instead of in a fixed, existing network topology. In this new model, in...

This thesis presents a definition and a static program analysis for secure information flow. The definition of secure information flow is not based on non-interference, but on the computational independence of the program’s public outputs from its secret inputs. Such definition allows cryptographic primitives to be gracefully handled, as their security is usually defined to be only computationa...

Information flow analysis is a powerful technique for reasoning about sensitive information that may be exposed during program execution. One promising approach is to adopt a program as a communication channel model and leverage information theoretic metrics (e.g., mutual information between the sensitive input and the public output) to quantify such information flows. However, recent research ...

We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. Thi...

This paper develops a formal model for metaphor and analogy built on information flow theory, formal concept analysis and conceptual graphs. Metaphor and analogy are important principles of human cognition based on representational maps. The model suggested in this paper defines metaphoric use in terms of information transfer via an information channel with respect to contextual constraints.

We present a framework for monitoring information flow in security-critical reactive systems, such as communication protocols, cell phone apps, document servers and web browsers. The secrecy requirements in such systems typically vary over time in response to the interaction with the environment. Standard notions of secrecy, like noninterference, must therefore be extended by specifying precise...

Distributed systems make increasing use of encrypted channels to enable confidential communication. While non-interference provides suitable means to investigate the flow of information within distributed systems, it has proved to be rather difficult to capture the notion of encrypted channels in such a framework. In this paper, we extend the framework MAKS for possibilistic information flow in...

A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requi...

Recent studies in secure computer svstems have shown that lattice structured information flow policies have properties which lead to simple and efficient enforcement mechanisms. This paper outlines a method for transforming nonlattice structured policies into lattices while Dreserving the validity of all : flows.