An exploration of L2 cache covert channels in virtualized environments
Top Cited Papers
- 21 October 2011
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Recent exploration into the unique security challenges of cloud computing have shown that when virtual machines belonging to different customers share the same physical machine, new forms of cross-VM covert channel communication arise. In this paper, we explore one of these threats, L2 cache covert channels, and demonstrate the limits of these this threat by providing a quantification of the channel bit rates and an assessment of its ability to do harm. Through progressively refining models of cross-VM covert channels from the derived maximums, to implementable channels in the lab, and finally in Amazon EC2 itself we show how a variety of factors impact our ability to create effective channels. While we demonstrate a covert channel with considerably higher bit rate than previously reported, we assess that even at such improved rates, the harm of data exfiltration from these channels is still limited to the sharing of small, if important, secrets such as private keys.Keywords
This publication has 15 references indexed in Scilit:
- A view of cloud computingCommunications of the ACM, 2010
- Load-based covert channels between Xen virtual machinesPublished by Association for Computing Machinery (ACM) ,2010
- Outlook: Cloudy with a Chance of Security Challenges and ImprovementsIEEE Security & Privacy, 2010
- Hey, you, get off of my cloudPublished by Association for Computing Machinery (ACM) ,2009
- Practical Mitigations for Timing-Based Side-Channel Attacks on Modern x86 ProcessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Detecting covert timing channelsPublished by Association for Computing Machinery (ACM) ,2007
- Xen and the art of virtualizationPublished by Association for Computing Machinery (ACM) ,2003
- Performance and scalability of EJB applicationsPublished by Association for Computing Machinery (ACM) ,2002
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- A note on the confinement problemCommunications of the ACM, 1973