@inproceedings{d92da8f7c5a34b04ad1419b31d692c86,
title = "Blinder: Partition-oblivious hierarchical scheduling",
abstract = "Hierarchical scheduling enables modular reasoning about the temporal behavior of individual applications by partitioning CPU time and thus isolating potential misbehavior. However, conventional time-partitioning mechanisms fail to achieve strong temporal isolation from a security perspective; variations in the executions of partitions can be perceived by others, which enables an algorithmic covert timing-channel between partitions that are completely isolated from each other in the utilization of time. Thus, we present a run-time algorithm that makes partitions oblivious to others' varying behaviors even when an adversary has full control over their timings. It enables the use of dynamic time-partitioning mechanisms that provide improved responsiveness, while guaranteeing the algorithmic-level non-interference that static approaches would achieve. From an implementation on an open-source operating system, we evaluate the costs of the solution in terms of the responsiveness as well as scheduling overhead.",
author = "Yoon, {Man Ki} and Mengqi Liu and Hao Chen and Kim, {Jung Eun} and Zhong Shao",
note = "Funding Information: The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work is supported in part by NSF grants 1945541, 1763399, 1715154, and 1521523. Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of sponsors. Publisher Copyright: {\textcopyright} 2021 by The USENIX Association. All rights reserved.; 30th USENIX Security Symposium, USENIX Security 2021 ; Conference date: 11-08-2021 Through 13-08-2021",
year = "2021",
language = "English (US)",
series = "Proceedings of the 30th USENIX Security Symposium",
publisher = "USENIX Association",
pages = "2417--2434",
booktitle = "Proceedings of the 30th USENIX Security Symposium",
}