Non-Malleable Codes from Average-Case Hardness

Dana Dachman-Soled


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.

Time and Place

Friday, October 26, 11:00am
Gates 392