Advertisement

NDSS 2019 Pointer Invalidation with Reference Counting in Legacy C/C++

NDSS 2019  Pointer Invalidation with Reference Counting in Legacy C/C++ SESSION 5A-4 CRCount: Pointer Invalidation with Reference Counting to Mitigate Use-after-free in Legacy C/C++

Pointer invalidation has been a popular approach adopted in many recent studies to mitigate use-after-free errors. The approach can be divided largely into two different schemes: explicit invalidation and implicit invalidation. The former aims to eradicate the root cause of use-after-free errors by invalidating every dangling pointer one by one explicitly. In contrast, the latter aims to prevent dangling pointers by freeing an object only if there is no pointer referring to it. A downside of the explicit scheme is that it is expensive, as it demands high-cost algorithms or a large amount of space to maintain every up-to-date list of pointer locations linking to each object at all times. Implicit invalidation is more efficient in that even without any explicit effort, it can eliminate dangling pointers by leaving objects undeleted until all the links between the objects and their referring pointers vanish by themselves during program execution. However, such an argument only holds if the scheme knows exactly when each link is created and deleted. Reference counting is a traditional method to determine the existence of reference links between objects and pointers. Unfortunately, impeccable reference counting for legacy C/C++ code is very difficult and expensive to achieve in practice, mainly because of the type unsafe operations in the code. In this paper, we present a solution, called CRCount, to the use-after-free problem in legacy C/C++. For effective and efficient problem solving, CRCount is armed with the pointer footprinting technique that enables us to compute, with high accuracy, the reference count of every object referred to by the pointers in the legacy code. Our experiments demonstrate that CRCount mitigates the use-after-free errors with a lower performance-wise and space-wise overhead than the existing pointer invalidation solutions.

PAPER


SLIDES


AUTHORS
Jangseop Shin (Seoul National University and Inter-University Semiconductor Research Center)
Donghyun Kwon (Seoul National University and Inter-University Semiconductor Research Center)
Jiwon Seo (Seoul National University and Inter-University Semiconductor Research Center)
Yeongpil Cho (Soongsil University)
Yunheung Paek (Seoul National University and Inter-University Semiconductor Research Center)


Network and Distributed System Security (NDSS) Symposium 2019, 24-27 February 2019, Catamaran Resort Hotel & Spa in San Diego, California.



ABOUT NDSS
The Network and Distributed System Security Symposium (NDSS) fosters information exchange among researchers and practitioners of network and distributed system security. The target audience includes those interested in practical aspects of network and distributed system security, with a focus on actual system design and implementation. A major goal is to encourage and enable the Internet community to apply, deploy, and advance the state of available security technologies.


#NDSS #NDSS19 #NDSS2019 #InternetSecurity

NDSS,NDSS19,NDSS2019,Internet Security,Internet Society,cybersecurity,cyber security,Dangling pointers,Use-after-free,LLVM,Memory safety,Temporal errors,

Post a Comment

0 Comments