For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Imperial College London

Return to search Previous output Next output
Output 142 of 201 in the submission
Article title

Probabilistic timing covert channels: to close or not to close?

Type
D - Journal article
Title of journal
International Journal of Information Security
Article number
-
Volume number
10
Issue number
2
First page of article
83
ISSN of journal
1615-5262
Year of publication
2011
URL
-
Number of additional authors
2
Additional information

<10>This paper is a journal version of a paper presented at the International Conference on Information and Communications Security in October 2008 (Acceptance 22%/125 submissions). We develop an approach to identifying and removing timing channels in timed probabilistic transitions systems. The paper presents an algorithm which computes an estimate of the security of a program and a program transformation which probabilistically adds padding to remove timing channels. Our approach allows the computational cost of padding to be traded against the improved security of the program for the first time.

Interdisciplinary
-
Cross-referral requested
-
Research group
E - Programming Languages and Systems
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-