Ph.D. Dissertation Defense: Mukul Ramesh Kulkarni

Thursday, July 18, 2019
11:00 a.m.
105 Brendan Iribe Center for Computer Science and Engineering (IRB)
Maria Hoo
301 405 3681
mch@umd.edu


ANNOUNCEMENT: Ph.D. Dissertation Defense   



Name: Mukul Ramesh Kulkarni

Advisory Committee:
Professor Dana Dachman-Soled, Chair/Advisor
Professor Gang Qu
Professor Charalampos (Babis) Papamanthou
Dr. Tal Malkin, Columbia University
Professor Jonathan Katz, Dean's Representative

Date/Time: Thursday, July 18, 2019 at 11:00 am - 1:00 pm

Location: 5105 Brendan Iribe Center for Computer Science and Engineering (IRB) 

Title: EXTENDING THE APPLICABILITY OF NON-MALLEABLE CODES


Abstract: 
Side-channel attacks (like power analysis, timing analysis etc.) are one of the
most effective tools employed by the adversaries to learn information pertaining
to cryptographic secrets; which the security guarantees of system rely upon. An
adversary can also tamper with secret keys (say flip some bits) and observe the
modified behavior of the device, thereby leaking information about the secret keys.
Dziembowski et al. (JACM 2018) defined the notion of non-malleable codes, a tool to
protect memory against tampering. Non-malleable codes ensure that, for a codeword
(generated by encoding underlying message) when the codeword is modified by some tampering function in given tampering class, if the decoding of tampered codeword is incorrect then the decoded message is independent of the original message.

In this dissertation, we focus on improving different aspects of non-malleable
codes. Specifically, (1) we extend the class of tampering functions and present explicit constructions as well as general frameworks for constructing non-malleable
codes. (2) The locality of code is the number of codeword blocks required to be
accessed in order to decode/update the codeword. We improve the efficiency and
usability by studying the optimal locality, and (3) we investigate a stronger variant
called continuous non-malleable codes, which are impossible to construct with
information-theoretic security; to understand what computational assumptions are
necessary to construct these stronger codes.
 
 

Audience: Graduate  Faculty 

 

October 2019

SU MO TU WE TH FR SA
29 30 1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31 1 2
Submit an Event