Randomized C/C++ dynamic memory allocator

Author:

Aleksandrovna Astrakhantseva Irina,Gennadevich Astrakhantsev Roman,Viktorovich Mitin Arseny

Abstract

Abstract Dynamic memory management requires special attention in programming. It should be fast and secure at the same time. This paper proposes a new randomized dynamic memory management algorithm designed to meet these requirements. Randomization is a key feature intended to protect applications from “use-after-free” or similar attacks. At the same time, the state in the algorithm consists only of one pointer, so it does not consume extra memory for itself. However, our algorithm is not a universal solution. It does not solve the memory fragmentation problem and it needs further development and testing.

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Reference11 articles.

1. Uncovering Use-After-Free Conditions in Compiled Code;David;International Conference on Availability, Reliability and Security ARES,2015

2. Heap Therapy+: Efficient Handling of (Almost) All Heap Vulnerabilities Using Tagged Calling-Context Encoding;Zeng Golam;49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN),2019

3. ASLR: How Robust is the Randomness?”;Jonathan,2017

4. Dynamic Storage Allocation: A Survey and Critical Review;Wilson Paul;International WWorkshop on Memory Management,1995

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Concretely Mapped Symbolic Memory Locations for Memory Error Detection;IEEE Transactions on Software Engineering;2024-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3