Control-Flow Integrity
Authors:
Top Cited Papers
Open Access
- 4 April 2017
- journal article
- survey
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 50 (1) , 1-33
Abstract
Memory corruption errors in C/C++ programs remain the most common source of security vulnerabilities in today’s systems. Control-flow hijacking attacks exploit memory corruption vulnerabilities to divert program execution away from the intended control flow. Researchers have spent more than a decade studying and refining defenses based on Control-Flow Integrity (CFI); this technique is now integrated into several production compilers. However, so far, no study has systematically compared the various proposed CFI mechanisms nor is there any protocol on how to compare such mechanisms. We compare a broad range of CFI mechanisms using a unified nomenclature based on (i) a qualitative discussion of the conceptual security guarantees, (ii) a quantitative security evaluation, and (iii) an empirical evaluation of their performance in the same test environment. For each mechanism, we evaluate (i) protected types of control-flow transfers and (ii) precision of the protection for forward and backward edges. For open-source, compiler-based implementations, we also evaluate (iii) generated equivalence classes and target sets and (iv) runtime performance.Keywords
Funding Information
- Defense Advanced Research Projects Agency (FA8750-15-C-0124, FA8750-15-C-0085 and FA8750-10-C-0237)
- National Science Foundation (CNS-1464155, CNS-1513783, CNS-1657711, CNS-1513837, CNS-1619211, and IIP-1520552)
- COMET K1 of the Austrian Research Promotion Agency
This publication has 55 references indexed in Scilit:
- Return-Oriented ProgrammingACM Transactions on Information and System Security, 2012
- Pick your contexts wellACM SIGPLAN Notices, 2011
- A brief history of just-in-timeACM Computing Surveys, 2003
- Language-based information-flow securityIEEE Journal on Selected Areas in Communications, 2003
- Parameterized object sensitivity for points-to and side-effect analyses for JavaACM SIGSOFT Software Engineering Notes, 2002
- A framework for call graph construction algorithmsACM Transactions on Programming Languages and Systems, 2001
- Scalable propagation-based call graph construction algorithmsACM SIGPLAN Notices, 2000
- Which pointer analysis should I use?ACM SIGSOFT Software Engineering Notes, 2000
- Fast static analysis of C++ virtual function callsACM SIGPLAN Notices, 1996
- Threaded codeCommunications of the ACM, 1973