Sign in
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering.
Marshall Ball
Dana Dachman-Soled
Mukul Kulkarni
Tal Malkin
Published in:
EUROCRYPT (3) (2018)
Keyphrases
</>
average case
worst case
decision trees
worst case analysis
uniform distribution
learning curves
machine learning
lower bound
digital images
low dimensional
vc dimension
average case complexity
computational complexity
np hard
error correction
streaming data