Visible to the public SecDCP: Secure Dynamic Cache Partitioning for Efficient Timing Channel Protection

TitleSecDCP: Secure Dynamic Cache Partitioning for Efficient Timing Channel Protection
Publication TypeConference Paper
Year of Publication2016
AuthorsWang, Yao, Ferraiuolo, Andrew, Zhang, Danfeng, Myers, Andrew C., Suh, G. Edward
Conference NameProceedings of the 53rd Annual Design Automation Conference
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4236-0
Keywordscomposability, concurrency and security, concurrency security, Metrics, pubcrawl, Resiliency
Abstract

In today's multicore processors, the last-level cache is often shared by multiple concurrently running processes to make efficient use of hardware resources. However, previous studies have shown that a shared cache is vulnerable to timing channel attacks that leak confidential information from one process to another. Static cache partitioning can eliminate the cache timing channels but incurs significant performance overhead. In this paper, we propose Secure Dynamic Cache Partitioning (SecDCP), a partitioning technique that defeats cache timing channel attacks. The SecDCP scheme changes the size of cache partitions at run time for better performance while preventing insecure information leakage between processes. For cache-sensitive multiprogram workloads, our experimental results show that SecDCP improves performance by up to 43% and by an average of 12.5% over static cache partitioning.

URLhttp://doi.acm.org/10.1145/2897937.2898086
DOI10.1145/2897937.2898086
Citation Keywang_secdcp:_2016