G-free: Defeating return-oriented programming through gadget-less binaries
Proceedings - Annual Computer Security Applications Conference, ACSAC
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28479
Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still represents a serious threat to the security of software systems and networks. A recent exploitation technique, called Return-Oriented Programming (ROP), has lately attracted a considerable attention from academia. Past research on the topic has mostly focused on refining the original attack technique, or on proposing partial solutions that target only particular variants of the attack. In this paper, we present G-Free, a compiler-based approach that represents the first practical solution against any possible form of ROP. Our solution is able to eliminate all unaligned free-branch instructions inside a binary executable, and to protect the aligned free-branch instructions to prevent them from being misused by an attacker. We developed a prototype based on our approach, and evaluated it by compiling GNU libc and a number of real-world applications. The results of the experiments show that our solution is able to prevent any form of return-oriented programming. © 2010 ACM.
- Conference Paper 
Showing items related by title, author, creator and subject.
Cornett, M.M.; Tanyeri, B.; Tehranian H. (2011)This paper examines investors' anticipation of bidder and target merger candidacy and if investor anticipations about candidacy affect the distribution of value between bidder and target firm shareholders. We find that ...
Umutlu, M.; Akdeniz L.; Altay-Salih, A. (2010)In this study, we address whether the degree of financial liberalization affects the aggregated total volatility of stock returns by considering the time-varying nature of financial liberalization. We also explore channels ...