Chit Saw - Academia.edu (original) (raw)
Related Authors
University of Liverpool online programme with Laureate
Uploads
Papers by Chit Saw
Lecture Notes in Computer Science, 2008
2009 Third International Conference on Emerging Security Information, Systems and Technologies, 2009
Software running on an open architecture, such as the PC, is vulnerable to inspection and modific... more Software running on an open architecture, such as the PC, is vulnerable to inspection and modification. Since software may process valuable or sensitive information, many defenses against data analysis and modification have been proposed. This paper complements existing work and focuses on hiding data location throughout program execution. To achieve this, we combine three techniques: (i) periodic reordering of the heap, (ii) migrating local variables from the stack to the heap and (iii) pointer scrambling. By essentialy flattening the dataflow graph of the program, the techniques serve to complicate static dataflow analysis and dynamic data tracking. Our methodology can be viewed as a data-oriented analogue of control-flow flattening techniques.
Lecture Notes in Computer Science, 2008
2009 Third International Conference on Emerging Security Information, Systems and Technologies, 2009
Software running on an open architecture, such as the PC, is vulnerable to inspection and modific... more Software running on an open architecture, such as the PC, is vulnerable to inspection and modification. Since software may process valuable or sensitive information, many defenses against data analysis and modification have been proposed. This paper complements existing work and focuses on hiding data location throughout program execution. To achieve this, we combine three techniques: (i) periodic reordering of the heap, (ii) migrating local variables from the stack to the heap and (iii) pointer scrambling. By essentialy flattening the dataflow graph of the program, the techniques serve to complicate static dataflow analysis and dynamic data tracking. Our methodology can be viewed as a data-oriented analogue of control-flow flattening techniques.