Proceedings of the 10th European Workshop on Systems Security 2017
DOI: 10.1145/3065913.3065920
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Generic Metadata Management with Mid-Fat Pointers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…We also assume that orthogonal defenses against spatial memory safety issues are in place [4,30,28,18]. However, to bypass xTag's protection using a spatial memory error, the attacker would need an arbitrary write primitive to corrupt xTag's shadow memory.…”
Section: Use-after-free Mitigation Schemementioning
confidence: 99%
“…We also assume that orthogonal defenses against spatial memory safety issues are in place [4,30,28,18]. However, to bypass xTag's protection using a spatial memory error, the attacker would need an arbitrary write primitive to corrupt xTag's shadow memory.…”
Section: Use-after-free Mitigation Schemementioning
confidence: 99%
“…We encourage further research into efficient metadata storage schemes that are sufficiently generic to support a wide variety of sanitizers [81], [95], and into sanitizers that build on such metadata storage schemes. This problem could also be addressed by using multi-variant execution systems to run multiple variants of the same program in parallel on the same inputs.…”
Section: Composing Sanitizersmentioning
confidence: 99%
“…A kernel patch is the most straightforward way to limit the address space for mappings, but provides poor portability. Instead, we use the approach of Mid-Fat Pointers [25] to limit the address space in user mode: First, we prelink the binary, loader, and any shared libraries used by the program at locations that fit 32 bits. Then, during program startup, we move the stack and thread-local storage down in the address space.…”
Section: Address Space Reductionmentioning
confidence: 99%
“…The concept of tagged pointers has been used for decades, but generally concerns the lower bit(s) of a pointer [3,14]. Baggy Bounds [1], Boundless [6], SGXBounds [26], and Mid-Fat [25] all store tags in the upper bits of pointers. Our design provides a more comprehensive analysis increasing compatibility of pointer tagging over these approaches.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation