A sound dependency analysis for secure information flow (extended version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

A sound dependency analysis for secure information flow (extended version)


In this paper we present a flow-sensitive analysis for secure information flow for Java bytecode. Our approach consists in computing, at different program points, a dependency graph which tracks how input values of a method may influence its outputs. This computation subsumes a points-to analysis (reflecting how objects depend on each others) by addressing dependencies arising from data of primitive type and from the control flow of the program. Our graph construction is proved to be sound by establishing a non-interference theorem stating that an output value is unrelated with an input one in the dependency graph if the output remains unchanged when the input is modified. In contrast with many type-based information flow techniques, our approach does not require security levels to be known during the computation of the graph: security aspects of information flow are checked by labeling "a posteriori" the dependency graph with security levels.
Fichier principal
Vignette du fichier
RT-0347.pdf (416.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00185263 , version 1 (05-11-2007)
inria-00185263 , version 2 (06-11-2007)
inria-00185263 , version 3 (06-11-2007)


  • HAL Id : inria-00185263 , version 3


Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot. A sound dependency analysis for secure information flow (extended version). [Research Report] RT-0347, INRIA. 2007. ⟨inria-00185263v3⟩
371 View
338 Download


Gmail Facebook Twitter LinkedIn More