The Community for Technology Leaders
Computer Security Applications Conference, Annual (2005)
Tucson, Arizona
Dec. 5, 2005 to Dec. 9, 2005
ISSN: 1063-9527
ISBN: 0-7695-2461-3
pp: 215-224
R. Sekar , Stony Brook University, NY
Zhenkai Liang , Stony Brook University, NY
Buffer overflows have become the most common target for network-based attacks. They are also the primary mechanism used by worms and other forms of automated attacks. Although many techniques have been developed to prevent server compromises due to buffer overflows, these defenses still lead to server crashes. When attacks occur repeatedly, as is common with automated attacks, these protection mechanisms lead to repeated restarts of the victim application, rendering its service unavailable. To overcome this problem, we develop a new approach that can learn the characteristics of a particular attack, and filter out future instances of the same attack or its variants. By doing so, our approach significantly increases the availability of servers subjected to repeated attacks. The approach is fully automatic, does not require source code, and has low runtime overheads. In our experiments, it was effective against most attacks, and did not produce any false positives.
R. Sekar, Zhenkai Liang, "Automatic Generation of Buffer Overflow Attack Signatures: An Approach Based on Program Behavior Models", Computer Security Applications Conference, Annual, vol. 00, no. , pp. 215-224, 2005, doi:10.1109/CSAC.2005.12
88 ms
(Ver 3.3 (11022016))