<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T01:24:27Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/115035" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/115035</identifier><datestamp>2026-06-06T00:55:38Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Martin Rinard and Hamed Okhravi.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Soderstrom, Eric K</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-04-27T18:11:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-04-27T18:11:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2014</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2014</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/115035</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">1031984780</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Missing pages 3 and 4 (abstract). Cataloged from student-submitted PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 63-65).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Introduction: Attackers have relatively success in defeating modern defensive techniques by using an exploitation method known as "code reuse." This class of exploitation techniques makes use of the lack of memory safety in C which allows an attacker to redirect a program's control flow to pre-existing snippets of code. Code reuse attacks have historically been a powerful and ubiquitous exploitation technique [2]. Even as recently as 2014 there has been an outbreak of these code reuse attacks, targeting such applications as Adobe, Internet Explorer, and Firefox 15]. Many defensive countermeasures have been taken by the security community, ranging from data execution prevention to varying degrees of code randomization. This thesis can roughly be broken into two halves: 1. Show how code reuse attacks can leverage timing information in order to break many existing defenses. 2. Investigate how control flow integrity can be improved upon as a countermeasure to code reuse attacks ...</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Eric K. Soderstrom.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">65 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Analysis of return oriented programming and countermeasures</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bace7a1c-3afb-4cb4-a298-3f03d3dc2f3c">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Analysis of return oriented programming and countermeasures&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2014&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Soderstrom, Eric K&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>Introduction: Attackers have relatively success in defeating modern defensive techniques by using an exploitation method known as &amp;quot;code reuse.&amp;quot; This class of exploitation techniques makes use of the lack of memory safety in C which allows an attacker to redirect a program&amp;apos;s control flow to pre-existing snippets of code. Code reuse attacks have historically been a powerful and ubiquitous exploitation technique [2]. Even as recently as 2014 there has been an outbreak of these code reuse attacks, targeting such applications as Adobe, Internet Explorer, and Firefox 15]. Many defensive countermeasures have been taken by the security community, ranging from data execution prevention to varying degrees of code randomization. This thesis can roughly be broken into two halves: 1. Show how code reuse attacks can leverage timing information in order to break many existing defenses. 2. Investigate how control flow integrity can be improved upon as a countermeasure to code reuse attacks ...&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>