Proceedings of the 11th ACM Conference on Computer and Communications Security 2004
DOI: 10.1145/1030083.1030124
|View full text |Cite
|
Sign up to set email alerts
|

On the effectiveness of address-space randomization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
499
1
7

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 654 publications
(525 citation statements)
references
References 5 publications
1
499
1
7
Order By: Relevance
“…Additionally, it can be performed at compile time to also randomize the location of program routines and variables. Shacham et al [40] show that ASLR may not be very effective on 32-bit systems, as they do not allow for sufficient entropy. In contrast, Bhatkar et al [41] argue that it is possible to introduce enough entropy for ASLR to be effective.…”
Section: Related Workmentioning
confidence: 99%
“…Additionally, it can be performed at compile time to also randomize the location of program routines and variables. Shacham et al [40] show that ASLR may not be very effective on 32-bit systems, as they do not allow for sufficient entropy. In contrast, Bhatkar et al [41] argue that it is possible to introduce enough entropy for ASLR to be effective.…”
Section: Related Workmentioning
confidence: 99%
“…For Windows XP, all the gadgets we use are from shell32.dll and msctf.dll with base addresses 0x7d590000 and 0x74680000, respectively. Windows 7, on the other hand, uses ASLR [3,4,24,27,29] where the base addresses of libraries are randomized after every restarting. We assume that the base addresses of ntdll.dll, kernel32.dll and shell32.dll are known (of values 0x77530000, 0x76710000 and 0x768e0000, respectively in our experiment), an assumption previous work on ROP also makes [6,22,23].…”
Section: Gadgets Used In Our Implementationmentioning
confidence: 99%
“…Feeding such addresses into the algorithm above, instead of using a random R perform close to 100% reliability. Other derandomization attacks against full ASLR may be used to improve the reliability of this method [17].…”
Section: If Not Gotomentioning
confidence: 99%
“…In 2004, Shacham et al [17] presented a brute-force guessing attack against the PaX ASLR [13]. ASLR randomizes the location of the libraries and some of the data segments of a process.…”
Section: Related Workmentioning
confidence: 99%