Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28410
Title: Efficient array & pointer bound checking against buffer overflow attacks via hardware/software
Authors: Shao, Z
Xue, C
Zhuge, Q
Sha, E
Xiao, B 
Keywords: Buffer storage
Optimising compilers
Security of data
Issue Date: 2005
Publisher: IEEE
Source: International Conference on Information Technology: Coding and Computing, 2005 : ITCC 2005, 4-6 April 2005, v. 1, p. 780-785 (CD-ROM) How to cite?
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.
URI: http://hdl.handle.net/10397/28410
ISBN: 0-7695-2315-3
DOI: 10.1109/ITCC.2005.140
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

34
Last Week
2
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.