Bounded Secrecy Parameters in Information Flow Analysis．

Abstract

This paper proposes bounded secrecy parameters in information flow analysis. Although secrecy parameters make it possible to define classes or functions without specifying a concrete secrecy for each data, programs that include secrecy parameters are required to satisfy noninterference with any substitution for secrecy parameters. Bounded secrecy parameters relax this too restrictive requirement and make more programs typable. We define a type system for information flow analysis of imperative programs with bounded secrecy parameters and show a simple example of type checking.