New Results on Instruction Cache Attacks
نویسندگان
چکیده
We improve instruction cache data analysis techniques with a framework based on vector quantization and hidden Markov models. As a result, we are capable of carrying out efficient automated attacks using live I-cache timing data. Using this analysis technique, we run an I-cache attack on OpenSSL’s DSA implementation and recover keys using lattice methods. Previous I-cache attacks were proof-of-concept: we present results of an actual attack in a real-world setting, proving these attacks to be realistic. We also present general software countermeasures, along with their performance impact, that are not algorithm specific and can be employed at the kernel and/or compiler level.
منابع مشابه
Eliminating Cache-Based Timing Attacks with Instruction-Based Scheduling
Information flow control allows untrusted code to access sensitive and trustworthy information without leaking this information. However, the presence of covert channels subverts this security mechanism, allowing processes to communicate information in violation of IFC policies. In this paper, we show that concurrent deterministic IFC systems that use time-based scheduling are vulnerable to a c...
متن کاملAn Improved Trace Driven Instruction Cache Timing Attack on RSA
The previous I-cache timing attacks on RSA which exploit the instruction path of a cipher were mostly proof-of-concept, and it is harder to put them into practice than D-cache timing attacks. We propose a new trace driven timing attack model based on spying on the whole I-cache. An improved analysis algorithm of the exponent using the characteristic of the size of the window is advanced, which ...
متن کاملAnnouncing the Final Examination of Jingfei Kong for the degree of Doctor of Philosophy Time & Location: June 18, 2010 at 2:00 PM in HEC 302 Title: ARCHITECTURAL SUPPORT FOR IMPROVING COMPUTER SECURITY
We propose several methods to improve computer security and privacy from architectural point of view. They provide strong protection as well as cost efficiency. In our first approach, we propose a new dynamic information flow method to protect systems from popular software attacks such as buffer overflow and format string attacks. In our second approach, we propose to deploy encryption schemes ...
متن کاملAnnouncing the Final Examination of Jingfei Kong for the degree of Doctor of Philosophy Time & Location: June 18, 2010 at 2:00 PM in HEC 302 Title: ARCHITECTURAL SUPPORT FOR IMPROVING COMPUTER SECURITY
We propose several methods to improve computer security and privacy from architectural point of view. They provide strong protection as well as cost efficiency. In our first approach, we propose a new dynamic information flow method to protect systems from popular software attacks such as buffer overflow and format string attacks. In our second approach, we propose to deploy encryption schemes ...
متن کاملAnnouncing the Final Examination of Jingfei Kong for the degree of Doctor of Philosophy Time & Location: June 18, 2010 at 2:00 PM in HEC 302 Title: ARCHITECTURAL SUPPORT FOR IMPROVING COMPUTER SECURITY
We propose several methods to improve computer security and privacy from architectural point of view. They provide strong protection as well as cost efficiency. In our first approach, we propose a new dynamic information flow method to protect systems from popular software attacks such as buffer overflow and format string attacks. In our second approach, we propose to deploy encryption schemes ...
متن کامل