{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:12:25Z","timestamp":1730193145695,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/35021bigcomp.2015.7072839","type":"proceedings-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T14:19:44Z","timestamp":1428070784000},"page":"7-10","source":"Crossref","is-referenced-by-count":2,"title":["Fast and space-efficient defense against jump-oriented programming attacks"],"prefix":"10.1109","author":[{"given":"Jeehong","family":"Kim","sequence":"first","affiliation":[]},{"given":"Young Ik","family":"Eom","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1587\/transfun.E97.A.303"},{"key":"ref11","first-page":"40","article-title":"ROPdefender: A detection tool to defend agasinat return-oriented programming attacks","author":"davi","year":"2011","journal-title":"Proc ACM Symp Inf Comput Commun Security"},{"key":"ref12","first-page":"993","article-title":"Librando: Transparent code randomization for just-in-time compilers","author":"homescu","year":"2013","journal-title":"Proc 20th ACM Conf on Comput and Commun Security"},{"key":"ref13","first-page":"94","article-title":"Branch regulation: Low-overhead protection from code reuse attacks","author":"kayaapl","year":"2012","journal-title":"Proc 39th int'L Symp on Comput Arch"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1755913.1755934"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/1920261.1920269"},{"year":"2006","journal-title":"Microsoft Data Execution Prevention(DEP)","key":"ref4"},{"key":"ref3","first-page":"7","article-title":"Advances in format string exploitation","volume":"59","year":"2002","journal-title":"Phrack Magazine"},{"year":"1997","journal-title":"Solar Designer Getting around non-executable stack (and fix)","key":"ref6"},{"year":"2003","journal-title":"PaX Team PaX non-executable page design & implementation","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/1866307.1866370"},{"key":"ref7","first-page":"552","article-title":"The geometry of innocent flesh on the bone: Return-into-libc without function calls(on the x86)","author":"shacham","year":"2007","journal-title":"Computer Communications of the ACM"},{"key":"ref2","first-page":"10","article-title":"Basic integer overflows","volume":"60","year":"2002","journal-title":"Phrack Magazine"},{"key":"ref1","first-page":"14","article-title":"Smashing the stack for fun and profit","volume":"49","year":"1996","journal-title":"Phrack Magazine"},{"key":"ref9","first-page":"30","article-title":"Jump-oriented prgramming: A new class of code-reuse attack","author":"bletsch","year":"2011","journal-title":"Computer Communications of the ACM"}],"event":{"name":"2015 International Conference on Big Data and Smart Computing (BigComp)","start":{"date-parts":[[2015,2,9]]},"location":"Jeju, South Korea","end":{"date-parts":[[2015,2,11]]}},"container-title":["2015 International Conference on Big Data and Smart Computing (BIGCOMP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7062153\/7072806\/07072839.pdf?arnumber=7072839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T23:20:44Z","timestamp":1490311244000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7072839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/35021bigcomp.2015.7072839","relation":{},"subject":[],"published":{"date-parts":[[2015,2]]}}}