[HTML][HTML] Quantitative information flow as safety and liveness hyperproperties
H Yasuoka, T Terauchi - Theoretical Computer Science, 2014 - Elsevier
H Yasuoka, T Terauchi
Theoretical Computer Science, 2014•ElsevierAbstract 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.
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.
Abstract
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.
Elsevier