1204129593
elbaz.jpg
"Solutions for Memory Authentication"


<br>
<b>Speaker:</b> Dr. Reouven Elbaz
<br>
<b>Time and Location:</b> Thursday, Feb. 28 at 11 am in LC400
<br>

<br>
<b>Abstract:</b>
<br>

One objective in the design of a secure platform is to
ensure that sensitive application outcomes have not been
corrupted by a malicious party.  For example, an adversary
tampering with the memory space of an application can affect
the results of its computations. Verifying the integrity (or
authenticate) data processed and stored by those secure
platforms is then an essential security service to provide.
After an overview of existing techniques ensuring memory
authentication, namely integrity trees, this talk presents a
new parallelizable integrity tree (TEC-Tree: Tamper-Evident
Counter Tree). Among other benefits, TEC-Tree provides data
confidentiality in addition to data integrity.

<br>
<br>
<b>Bio:</b>
<br>
Dr. Reouven Elbaz received his PhD. in Computer Engineering
from University of Montpellier II in December 2006. The
research project (Hardware Mechanisms for Secure
Processor-Memory Transactions) he carried out during his
graduate studies was a collaboration between the
Microelectronics department of the LIRMM (Laboratory of
Computer Science, Robotics and Microelectronics - University
of Montpellier II) and the Security Group of the company
STMicroelectronics. He is now a Research Associate in the
Computer Engineering Department of the Princeton University
(PALMS Laboratory). His research interests are in computer
security, computer architecture, applied cryptography,
trusted computing and reconfigurable architectures.