Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
Accepted manuscript
Final published version
Practitioners of secure information flow often face a design challenge: what is the right semantic treatment of leaks via termination? On the one hand, the potential harm of untrusted code calls for strong progress-sensitive security. On the other hand, when the code is trusted to not aggressively exploit termination channels, practical concerns, such as permissiveness of the enforcement, make a case for settling for weaker, progress-insensitive security. This binary situation, however, provides no suitable middle point for systems that mix trusted and untrusted code. This paper connects the two extremes by reframing progress-insensitivity as a particular form of declassification. Our novel semantic condition reconciles progress-insensitive security as a declassification bound on the so-called progress knowledge in an otherwise progress or timing sensitive setting. We show how the new condition can be soundly enforced using a mostly standard information-flow monitor. We believe that the connection established in this work will enable other applications of ideas from the literature on declassification to progress-insensitivity.
Original language | English |
---|---|
Title of host publication | 2020 IEEE 33rd Computer Security Foundations Symposium (CSF) |
Number of pages | 12 |
Publisher | IEEE |
Publication year | Jun 2020 |
Pages | 95-106 |
ISBN (Electronic) | 9781728165721 |
DOIs | |
Publication status | Published - Jun 2020 |
Event | 33rd IEEE Computer Security Foundations Symposium, CSF 2020 - Virtual, Online, United States Duration: 22 Jun 2020 → 25 Jun 2020 |
Conference | 33rd IEEE Computer Security Foundations Symposium, CSF 2020 |
---|---|
Land | United States |
By | Virtual, Online |
Periode | 22/06/2020 → 25/06/2020 |
Series | Proceedings - IEEE Computer Security Foundations Symposium |
---|---|
Volume | 2020-June |
ISSN | 1940-1434 |
See relations at Aarhus University Citationformats
ID: 196858040