Possibilistic Information Flow is safe for Probabilistic Non-Interference (2000)
| Venue: | In Proc. WITS, 2000. www.doc.ic.ac.uk/ ˜clh/Papers/witscnh.ps.gz |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Clark00possibilisticinformation,
author = {David Clark and Chris Hankin and Sebastian Hunt and Rajagopal Nagarajan},
title = {Possibilistic Information Flow is safe for Probabilistic Non-Interference},
booktitle = {In Proc. WITS, 2000. www.doc.ic.ac.uk/ ˜clh/Papers/witscnh.ps.gz},
year = {2000},
pages = {7--8}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) David Clark 1 , Chris Hankin 1 , Sebastian Hunt 2 , and Rajagopal Nagarajan 1 1 Introduction Recently there has been considerable interest in analysing programs for the existence of probabilistic covert channels. Sabelfeld and Sands [6] have given a semantic characterisation of probabilistic non-interference and used it to give elegant correctness proofs for type-based systems proposed by Volpano and Smith [7]. Our thesis in this paper is that one can use a possibilistic information ow analysis to check for probabilistic interference|the absence of information ow implies the absence of interference. We apply our techniques to the analysis of a Probabilistic Idealised Algol. Our analysis is based on a control ow analysis which is used to construct an analogue of the the higher-order owcharts of Malacaria and Hankin [3]; the information ows can be read fairly directly from the owchart. In the next section we introduce the syntax and semantics of the programming language. ...
Citations
No citations identified.
