An Accurate Type System for Information Flow in Presence of Arrays

International audience Secure information flow analysis aims to check that the execution of a program does not reveal information about secret data manipulated by this program. In this paper, we consider programs dealing with arrays; unlike most of existing works, we will not assume that arrays are...

Full description

Bibliographic Details
Main Authors: Fratani, Séverine, Talbot, Jean-Marc
Other Authors: Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Roberto Bruni, Juergen Dingel, TC 6, WG 6.1
Format: Conference Object
Language:English
Published: HAL CCSD 2011
Subjects:
[INFO]Computer Science [cs]
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Iceland
Online Access:https://inria.hal.science/hal-01583316
https://inria.hal.science/hal-01583316/document
https://inria.hal.science/hal-01583316/file/978-3-642-21461-5_10_Chapter.pdf
https://doi.org/10.1007/978-3-642-21461-5_10
Description
Summary:International audience Secure information flow analysis aims to check that the execution of a program does not reveal information about secret data manipulated by this program. In this paper, we consider programs dealing with arrays; unlike most of existing works, we will not assume that arrays are homogeneous in terms of security levels. Some part of an array can be declared as secret whereas another part is public. Based on a pre-computed approximation of integer variables (serving as indices for arrays), we devise a type system such that typed programs do not leak unauthorized information. Soundness of our type system is proved by a non-interference theorem.

Similar Items