Non-malleable Codes from Average-Case Hardness: ${\mathsf {A}}{\mathsf {C}}^0$ , Decision Trees, and Streaming Space-Bounded Tampering

Marshall Ball
Marshall Ball
Mukul Kulkarni
Mukul Kulkarni

EUROCRYPT, pp. 618-650, 2018.

Cited by: 5|Bibtex|Views12|Links
EI

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 ({mathcal {F}}), it suffices to have average-case hard distributions for the class, and un...More

Code:

Data:

Your rating :
0

 

Tags
Comments