Quantitative Information Flow, Relations and Polymorphic Types

This paper uses Shannon's information theory to give a quantitative definition of information flow in systems that transform inputs to outputs. For deterministic systems, the definition is shown to specialise to a simpler form when the information source and the known inputs jointly determine the inputs. For this special case, the definition is related to the classical security condition of non-interference and an equivalence is established between non-interference and independence of random variables. Quantitative information flow for deterministic systems is then presented in relational form. With this presentation, it is shown how relational parametricity can be used to derive upper and lower bounds on information flows through families of functions defined in the second order lambda calculus.

Information Flow for ALGOL-like Languages

In this paper we present an approach to information flow analysis for a family of languages. We start with a simple imperative language. We present an information flow analysis using a flow logic. The paper contains detailed correctness proofs for this analysis. We next extend the analysis to a restricted form of Idealised Algol, a call-by-value higher-order extension of the simple imperative language (the key restriction being the lack of recursion). The paper concludes with a discussion of further extensions, including a probabilistic extension of Idealised Algol.

Quantified Analysis of the Leakage of Confidential Data

Basic information theory is used to analyse the amount of confidential information which may be leaked by programs written in a very simple imperative language. In particular, a detailed analysis is given of the possible leakage due to equality tests and if statements. The analysis is presented as a set of syntax-directed inference rules and can readily be automated.

Quantified Interference: Information Theory and Information Flow

The paper investigates which of Shannon’s measures (entropy, conditional entropy, mutual information) is the right one for the task of quantifying information flow in a programming language. We examine earlier relevant contributions from Denning, McLean and Gray and we propose and motivate a specific quantitative definition of information flow. We prove results relating equivalence relations, interference of program variables, independence of random variables and the flow of confidential information. Finally, we show how, in our setting, Shannon’s Perfect Secrecy theorem provides a sufficient condition to determine whether a program leaks confidential information.

Reação-difusão com difusividade variável para oxidação de silício

Neste trabalho, propomos uma modificação do modelo de reação-difusão (R. M. C. de Almeida et al., Physics Review B, 61, 19 (2000)) incluindo difusividade variável com o objetivo principal de predizer, ou no mínimo descrever melhor, o crescimento de oxido de Si no regime de filmes nos. Estudamos o modelo reação-difusão a coeficiente de difusão, D, fixo e D variável. Estudamos extensivamente o modelo reação-difusão com D fixo caracterizando seu comportamento geral, e resolvendo numericamente o modelo com D variável para um intervalo amplo de relações DSiO2=DSi. Ambos casos apresentam comportamento assintótico parabólico das cinéticas. Obtivemos as equações analíticas que regem o regime assintótico de tais casos. Ambos os modelos apresentam interface não abrupta. Comparações das cinéticas com o modelo linear-parabólico e com dados experimentais foram feitas, e também para as espessuras da interface. Contudo nenhum dos dois modelos de reação-difusãao, com D fixo e com D varáavel, podem explicar a região de filmes nos, que possui taxa de crescimento superior a taxa de crescimento da região assintótica. Porém, ao incluir taxa de reação variável dentro do modelo de reação-difusão com D variável, este aponta para uma solução do regime de filmes nos.