2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2016)
Chicago, IL, USA
May 23, 2016 to May 27, 2016
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2016.22
As an emerging memory technology to build the future main memory systems, Phase Change Memory (PCM) can increase memory capacity in a cost-effective and power-efficient way. However, PCM is facing security threats for its limited write endurance: a malicious adversary could wear out the cells and cause the whole PCM system to fail within a short period of time. To address this issue, several wear-leveling schemes have been proposed to evenly distribute write traffic in a security-aware manner. In this work, we present a new type of timing attacknamed Remapping Timing Attack (RTA), based on the asymmetry in write time of PCM. Our analysis and experimental results show that the new revealed RTA can make two state-of-the-art wear-leveling schemes (Region Based Start-Gap and Security Refresh) lose effectiveness, failing PCM with these two techniques in several days (even minutes). In order to defend such attack, we further propose a novel wear-leveling scheme called Security Region Based Start-Gap (Security RBSG), which employs a two-stage strategy and uses a dynamic Feistel Network to enhance the simple Start-Gap wear leveling with level-adjustable security assurance. The theoretical analysis and evaluation results show that the proposed Security RBSG is the most robust wear-leveling methodology so far, which not only better defends the new RTA, but also performs well on the traditional malicious attacks, i.e., Repeated Address Attack and Birthday Paradox Attack.
Phase change materials, Security, Timing, Writing, Phase change memory, Robustness, Scalability,Endurance, Phase Change Memory, Wear Leveling, Timing Attack
Fangting Huang, Dan Feng, Wen Xia, Wen Zhou, Yucheng Zhang, Min Fu, Chuntao Jiang, Yukun Zhou, "Security RBSG: Protecting Phase Change Memory with Security-Level Adjustable Dynamic Mapping", 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), vol. 00, no. , pp. 1081-1090, 2016, doi:10.1109/IPDPS.2016.22