Skip to main navigation Skip to search Skip to main content

Efficient array & pointer bound checking against buffer overflow attacks via hardware/software

  • Zili Shao
  • , Chun Xue
  • , Qingfeng Zhuge
  • , Edwin H.-M. Sha
  • , Bin Xiao

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

Buffer overflow attacks cause serious security problems. Array & pointer bound checking is one of the most effective approaches for defending against buffer overflow attacks when source code is available. However, original array & pointer bound checking causes too much overhead since it is designed to catch memory errors and it puts too many checks. In this paper, we propose an efficient array & pointer bound checking strategy to defend against buffer overflow attacks. In our strategy, only the bounds of write operations are checked. We discuss the optimization strategy via hardware/software and conduct experiments. The experimental results show that our strategy can greatly reduce the overhead of array & pointer bound checking. Our conclusion is that based on our strategy, array & pointer bound checking can be a practical solution for defending systems against buffer overflow attacks with tolerable overhead. © 2005 IEEE.
Original languageEnglish
Title of host publicationInternational Conference on Information Technology: Coding and Computing, ITCC
Pages780-785
Volume1
Publication statusPublished - 2005
Externally publishedYes
EventITCC 2005 - International Conference on Information Technology: Coding and Computing - Las Vegas, NV, United States
Duration: 4 Apr 20056 Apr 2005

Publication series

Name
Volume1

Conference

ConferenceITCC 2005 - International Conference on Information Technology: Coding and Computing
PlaceUnited States
CityLas Vegas, NV
Period4/04/056/04/05

Fingerprint

Dive into the research topics of 'Efficient array & pointer bound checking against buffer overflow attacks via hardware/software'. Together they form a unique fingerprint.

Cite this