<node id="663472">
  <nid>663472</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1669671887</created>
  <changed>1669671887</changed>
  <title><![CDATA[PhD Proposal by Yonghae Kim ]]></title>
  <body><![CDATA[<p><strong>Title:</strong>&nbsp;Hardware-based Always-On Memory Safety</p>

<p><strong>Date:</strong>&nbsp;Tuesday, November 29th&nbsp;</p>

<p><strong>Time:&nbsp;9:30</strong>am&nbsp;- 11:00am EST</p>

<p><strong>Location:&nbsp;</strong>1202 Conference Room Klaus,&nbsp;Virtual:&nbsp;<a href="https://gatech.zoom.us/j/96289990465?pwd=TE9jOGp1anFDNDZxMU5KSktPTWZBQT09">Zoom Link</a>&nbsp;(Meeting Code:&nbsp;962 8999 0465)</p>

<p>&nbsp;</p>

<p><strong>Yonghae Kim</strong></p>

<p>Ph.D. Computer Science</p>

<p>School of Computer Science</p>

<p>Georgia Institute of Technology</p>

<p>&nbsp;</p>

<p><strong>Committee:</strong></p>

<p>Dr. Hyesoon Kim (Advisor) - School of Computer Science, Georgia Institute of Technology</p>

<p>Dr. Moinuddin Qureshi&nbsp;- School of&nbsp;Computer Science, Georgia Institute of Technology</p>

<p>Dr. Taesoo Kim&nbsp;- School of&nbsp;Computer Science, Georgia Institute of Technology</p>

<p>Dr. Jaekyu Lee - Arm</p>

<p>&nbsp;</p>

<p><strong>Abstract:</strong></p>

<p>For decades, memory safety issues have exposed substantial security threats to computer systems. Memory safety violations occur when instructions perform illegitimate memory accesses to a program&rsquo;s address space. There are broadly two types of memory safety violations. If a memory access occurs outside of its allowed range, e.g., buffer overflow and out-of- bounds (OOB) access, it violates spatial memory safety. When a memory region is accessed after the region is no longer valid, temporal memory safety is violated, e.g., use-after-free (UAF). Despite long-term efforts to resolve, memory safety issues are still the most prevalent and problematic in the wild. Recent studies show that &sim;70% of security vulnerabilities addressed in industry stemmed from memory violations. This dissertation&nbsp;presents a&nbsp;multidisciplinary&nbsp;approach that addresses challenges of&nbsp;previous memory safety solutions and achieves practical memory safety.</p>

<p>&nbsp;</p>

<p>First, we present&nbsp;AOS, a low-overhead heap protection mechanism. AOS proposes a data-pointer signing scheme that utilizes the unused upper bits of a pointer for a security purpose. With the&nbsp;proposed hardware&nbsp;support, AOS achieves efficient metadata management and bounds checks transparently performed in hardware.&nbsp;Second, we present RV-CURE, a RISC-V capability architecture that orchestrates compiler, architecture, and system designs for practical memory safety. RV-CURE proposes data-pointer tagging (DPT) that generalizes a&nbsp;pointer-tagging method for all memory types, including stack, heap, and global memory. In addition, RV-CURE investigates efficient, lightweight hardware extensions for DPT based on the RISC-V BOOM core. Furthermore, DPT utilizes static taint analysis that enables identifying vulnerable (tainted) memory objects and enabling selective protection only to those.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Hardware-based Always-On Memory Safety]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2022-11-29T09:30:00-05:00]]></value>
      <value2><![CDATA[2022-11-29T11:30:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
