vbrandl/WIS-SEC-BOF
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix typo and change wording

Browse Source
This commit is contained in:
Valentin Brandl 2019-12-18 17:12:55 +01:00
parent 44e15ac978
commit abd0defb17
No known key found for this signature in database
GPG Key ID: 30D341DD34118D7D
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
work/01paper.pdf
View File

Binary file not shown.

8
work/01paper.tex
View File

@ -270,8 +270,8 @@ check, if a write or read operation is out of bounds. This requires storing the
size of a buffer together with the pointer to the buffer (so called fat
pointers) and check for each read or write in the buffer, if it is in bounds at
runtime. Almost any language that comes with a managed runtime, uses \ac{rbc}.
For this technique to be effective effective in general, writes to raw pointers
must be disallowed. Otherwise the security checks can be circumvented. \Ac{rbc}
For this technique to be effective in general, writes to raw pointers must be
disallowed. Otherwise the security checks can be circumvented. \Ac{rbc}
introduces a runtime overhead for every indexed read or write operation. This is
a problem if a program runs on limited hardware or might impact real-time
properties.
@ -382,8 +382,8 @@ as a \ac{pie}. On 32-bit CPUs, only 16-bit of the address are randomized. These
16-bit can be brute forced in a few minutes or seconds~\cite{AslrEffective2004}.
There is no runtime overhead since the only change is the position of the
program in memory. Since there is no additional work required except maybe
recompilation, this technique can and should be used on modern systems.
program in memory. This technique can and should be used on modern systems
because there is no additional work required, except maybe recompilation.
\subsubsection{w\^{}x}