2012/07/04 by Hirotoshi Yasuoka, Tachio Terauchi
Computer Science · #cs.CR #cs.LO
paper · pdf · doi:10.4204/eptcs.85.6
published as EPTCS 85, 2012, pp. 77-91 · In Proceedings QAPL 2012, arXiv:1207.0559
arxiv created 2012/07/04 · arxiv updated 2012/07/05
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.