An accurate type system for information flow in presence of arrays

  • Authors:
  • Séverine Fratani;Jean-Marc Talbot

  • Affiliations:
  • Laboratoire d'Informatique Fondamentale de Marseille, UMR, CNRS, Université de la Méditerranée, Université de Provence;Laboratoire d'Informatique Fondamentale de Marseille, UMR, CNRS, Université de la Méditerranée, Université de Provence

  • Venue:
  • FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.