A low-cost memory remapping scheme for address bus protection

  • Authors:
  • Jun Yang;Lan Gao;Youtao Zhang;Marek Chrobak;Hsien-Hsin S. Lee

  • Affiliations:
  • Electrical and Computer Engineering Department, University of Pittsburgh, United States;Vmware Corporation, Palo Alto, CA, United States;Computer Science Department, University of Pittsburgh, United States;Department of Computer Science and Engineering, University of California, Riverside, United States;School of Electrical and Computer Engineering, Georgia Institute of Technology, United States

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to leakage of proprietary algorithms or critical information such as encryption keys. Addresses can be observed by side-channel attacks mounted on remote servers that run sensitive programs but are not under the physical control of the client. Two previously proposed hardware techniques tackled this problem through randomizing address patterns on the bus. In this paper, we examine these attempts and show that they impose great pressure on both the memory and the disk. We propose a lightweight solution to alleviating the pressure with equal security strength. The results show that our technique can reduce the memory traffic by a factor of 10 compared with the prior scheme, while keeping almost the same page fault rate as a baseline system with no security protection.