Use-After-Free Mitigation via Protected Heap Allocation

被引:0
|
作者
Zhang, Mingbo [1 ]
Zonouz, Saman [1 ]
机构
[1] Rutgers State Univ, Dept Elect & Comp Engn, New Brunswick, NJ 08901 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Use after free (UAF) exploits have contributed to many software memory corruption attacks in recent practice. They are especially popular in the world of web browsers. Despite many successful UAF exploits against widelyused applications, state-of-the-art defense mechanisms have proved to still leave the systems vulnerable. In this paper, we argue that a successful UAF exploit is feasible because of the fine-grained determinism provided by existing heap memory allocators. We introduce a new defense strategy, ZEUS, that leverages additional memory buffers to make allocation outcomes locally unpredictable to adversaries. This fine-grained non-determinism prevents exact alignment of subsequent allocations and in-object member fields. It significantly lowers the success rate of a UAF exploit even in the presence of heap sprays. We validated our defense using real recent UAF exploits against several CVE vulnerabilities in large and popular software packages (FireFox and Tor browsers). ZEUS was able to terminate all the exploits in early stages and prevented successful location of the gadget addresses for the follow-up return-oriented programming steps of the intrusion. ZEUS's runtime performance overhead was negligible (1.2% on average).
引用
收藏
页码:131 / 138
页数:8
相关论文
共 50 条
  • [31] An Efficient Metric-Based Approach for Static Use-After-Free Detection
    Wei, Haolai
    Chen, Liwei
    Nie, Xiaofan
    Zhang, Zhijie
    Zhang, Yuantong
    Shi, Gang
    2022 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING, ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM, 2022, : 58 - 65
  • [32] MarkUs: Drop-in use-after-free prevention for low-level languages
    Ainsworth, Sam
    Jones, Timothy M.
    2020 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2020), 2020, : 578 - 591
  • [33] Static Detection of Use-After-Free Vulnerability in Binaries via Constrained Path-Sensitive Value-Set Analysis
    Wu, Tianjun
    Yang, Yuexiang
    BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2019, 124 : 140 - 140
  • [34] Mpchecker: Use-After-Free Vulnerabilities Protection Based on Multi-Level Pointers
    Qiang, Weizhong
    Li, Weifeng
    Jin, Hai
    Surbiryala, Jayachander
    IEEE ACCESS, 2019, 7 : 45961 - 45977
  • [35] Machine-Learning-Guided Typestate Analysis for Static Use-After-Free Detection
    Yan, Hua
    Sui, Yulei
    Chen, Shiping
    Xue, Jingling
    33RD ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC 2017), 2017, : 42 - 54
  • [36] All Use-After-Free Vulnerabilities Are Not Created Equal: An Empirical Study on Their Characteristics and Detectability
    Chen, Zeyu
    Liu, Daiping
    Xiao, Jidong
    Wang, Haining
    PROCEEDINGS OF THE 26TH INTERNATIONAL SYMPOSIUM ON RESEARCH IN ATTACKS, INTRUSIONS AND DEFENSES, RAID 2023, 2023, : 623 - 638
  • [37] Effective Static Analysis of Concurrency Use-After-Free Bugs in Linux Device Drivers
    Bai, Jia-Ju
    Lawall, Julia
    Chen, Qiu-Liang
    Hu, Shi-Min
    PROCEEDINGS OF THE 2019 USENIX ANNUAL TECHNICAL CONFERENCE, 2019, : 255 - 268
  • [38] Mitigating Use-After-Free Attacks Using Memory-Reuse-Prohibited Library
    Yamauchi, Toshihiro
    Ikegami, Yuta
    Ban, Yuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (10): : 2295 - 2306
  • [39] HeapRevolver: Delaying and Randomizing Timing of Release of Freed Memory Area to Prevent Use-After-Free Attacks
    Yamauchi, Toshihiro
    Ikegami, Yuta
    NETWORK AND SYSTEM SECURITY, (NSS 2016), 2016, 9955 : 219 - 234
  • [40] xTag: Mitigating Use-After-Free Vulnerabilities via Software-Based Pointer Tagging on Intel x86-64
    Bernhard, Lukas
    Rodler, Michael
    Holz, Thorsten
    Davit, Lucas
    2022 IEEE 7TH EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P 2022), 2022, : 502 - 519