跳到主要导航 跳到搜索 跳到主要内容

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

  • University of Texas at Dallas
  • Hong Kong Polytechnic University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

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.

源语言英语
主期刊名Proceedings ITCC 2005 - International Conference on Information Technology
主期刊副标题Coding and Computing
编辑H. Selvaraj, P.K. Srimani
页780-785
页数6
出版状态已出版 - 2005
已对外发布是
活动ITCC 2005 - International Conference on Information Technology: Coding and Computing - Las Vegas, NV, 美国
期限: 4 4月 2005 → 6 4月 2005

丛书

姓名International Conference on Information Technology: Coding and Computing, ITCC
卷1

会议

会议ITCC 2005 - International Conference on Information Technology: Coding and Computing
国家/地区美国
市Las Vegas, NV
时期4/04/05 → 6/04/05

学术指纹

探究 'Efficient array & pointer bound checking against buffer overflow attacks via hardware/software' 的科研主题。它们共同构成独一无二的学术指纹。

引用此