English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Heap layout randomization renders a good portion of heap vulnerabilitiesunexploitable. However, some remnants of the vulnerabilities are stillexploitable even under the randomized layout. According to our analysis, suchheap exploits often abuse pointer-width allocation granularity to spray craftedpointers. To address this problem, we explore the efficacy of byte-granularity(the most fine-grained) heap randomization. Heap randomization, in general, hasbeen a well-trodden area; however, the efficacy of byte-granularityrandomization has never been fully explored as \emph{misalignment} raisesvarious concerns. This paper unravels the pros and cons of byte-granularityheap randomization by conducting comprehensive analysis in three folds: (i)security effectiveness, (ii) performance impact, and (iii) compatibilityanalysis to measure deployment cost. Security discussion based on 20 CVE casestudies suggests that byte-granularity heap randomization raises the baragainst heap exploits more than we initially expected; as pointer sprayingapproach is becoming prevalent in modern heap exploits. Afterward, to demystifythe skeptical concerns regarding misalignment, we conduct cycle-levelmicrobenchmarks and report that the performance cost is highly concentrated toedge cases depending on L1-cache line. Based on such observations, we designand implement an allocator suited to optimize the performance cost ofbyte-granularity heap randomization; then evaluate the performance with thememory-intensive benchmark (SPEC2006). Finally, we discuss compatibility issuesusing Coreutils, Nginx, and ChakraCore.

Rethinking Misalignment to Raise the Bar for Heap Pointer Corruption