[theory-seminar] Fwd: Friday, October 26 -- Dana Dachman-Soled: Non-Malleable Codes from Average-Case Hardness

[Saba Eskandarian]

This week's security seminar talk will likely be of interest to the theory
group as well.

Thanks,
~saba

---------- Forwarded message ---------
From: Saba Eskandarian <saba at cs.stanford.edu>
Date: Sun, Oct 21, 2018 at 6:05 PM
Subject: Friday, October 26 -- Dana Dachman-Soled: Non-Malleable Codes from
Average-Case Hardness
To: <security-seminar at lists.stanford.edu>



       Non-Malleable Codes from Average-Case Hardness

                    Dana Dachman-Soled

                  Friday, October 26, 2018
                      Talk at 11:00am
                         Gates 392

Abstract:

We show a general framework for constructing non-malleable codes
against tampering families with average-case hardness bounds. Our
framework adapts ideas from the Naor-Yung double encryption paradigm
such that to protect against tampering in a class F, it suffices to
have average-case hard distributions for the class, and underlying
primitives satisfying certain properties with respect to the class. We
then present instantiations of the framework to achieve non-malleable
codes for various classes F.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.stanford.edu/pipermail/theory-seminar/attachments/20181021/f6e789ab/attachment.html>