Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering

DOI10.1007/978-3-319-78372-7_20zbMath1415.94406OpenAlexW2795091282MaRDI QIDQ1653115

Tal Malkin, Mukul Kulkarni, Dana Dachman-Soled, Marshall Ball

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_20

Related Items (11)

Non-malleable codes for bounded parallel-time tampering ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Proofs of Work from worst-case assumptions ⋮ Interactive non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Continuously non-malleable codes with split-state refresh ⋮ Four-state non-malleable codes with explicit constant rate

This page was built for publication: Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering