Quantitative information flow as safety and liveness hyperproperties

Hirotoshi Yasuoka, Tachio Terauchi
2014 Theoretical Computer Science  
We employ Clarkson and Schneider's "hyperproperties" to classify various verification problems of quantitative information flow. The results of this paper unify and extend the previous results on the hardness of checking and inferring quantitative information flow. In particular, we identify a subclass of liveness hyperproperties, which we call "k-observable hyperproperties", that can be checked relative to a reachability oracle via self composition. 1 Technically, only non-empty observable
more » ... rproperties are liveness hyperproperties. 2 In fact, computing QIF under other input distributions can sometimes be reduced to this case [2] . See also Section 5.3.
doi:10.1016/j.tcs.2013.07.031 fatcat:ofigo4ltmjeqjl6ay6m3tzgf3a