论文标题
在动态优先实时系统中的调度程序侧通道上
On Scheduler Side-Channels in Dynamic-Priority Real-Time Systems
论文作者
论文摘要
尽管最近已经证明了针对固定优先级实时系统（RTS）的调度程序侧通道的存在，但动态优先系统没有类似的探索。此类调度算法的动态性质，例如EDF，在这方面构成了重大挑战。在本文中，我们证明了动态优先实时系统中存在侧通道。使用此侧渠道，我们提出的DYPS算法能够从非特权（用户空间）任务的高度精度，关键的任务信息有效地推断出。除了证明DYP的有效性外，我们还探索了使用大量合成任务集影响此类攻击算法的各种因素。我们还与最先进的方法进行了比较，并证明我们提出的DYPS算法在攻击EDF RTS时的表现优于Scheduleak算法。
While the existence of scheduler side-channels has been demonstrated recently for fixed-priority real-time systems (RTS), there have been no similar explorations for dynamic-priority systems. The dynamic nature of such scheduling algorithms, e.g., EDF, poses a significant challenge in this regard. In this paper we demonstrate that side-channels exist in dynamic priority real-time systems. Using this side-channel, our proposed DyPS algorithm is able to effectively infer, with high precision, critical task information from the vantage point of an unprivileged (user space) task. Apart from demonstrating the effectiveness of DyPS, we also explore the various factors that impact such attack algorithms using a large number of synthetic task sets. We also compare against the state-of-the-art and demonstrate that our proposed DyPS algorithms outperform the ScheduLeak algorithms in attacking the EDF RTS.
