Multiple ASR for efficient defense against brute force attacks 


Vol. 18,  No. 2, pp. 89-96, Apr.  2011
10.3745/KIPSTC.2011.18.2.89


PDF
  Abstract

ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.

  Statistics
  Cite this article

[IEEE Style]

S. H. Park and S. I. Kim, "Multiple ASR for efficient defense against brute force attacks," The KIPS Transactions:PartC, vol. 18, no. 2, pp. 89-96, 2011. DOI: 10.3745/KIPSTC.2011.18.2.89.

[ACM Style]

Soo Hyun Park and Sun Il Kim. 2011. Multiple ASR for efficient defense against brute force attacks. The KIPS Transactions:PartC, 18, 2, (2011), 89-96. DOI: 10.3745/KIPSTC.2011.18.2.89.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals