Non-malleable codes against bounded polynomial time tampering
From MaRDI portal
Publication:2292657
DOI10.1007/978-3-030-17653-2_17zbMath1470.94076OpenAlexW2903482297MaRDI QIDQ2292657
Tal Malkin, Mukul Kulkarni, Marshall Ball, Huijia Lin, Dana Dachman-Soled
Publication date: 4 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17653-2_17
Related Items (9)
Non-malleable codes for bounded parallel-time tampering ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Interactive non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model
This page was built for publication: Non-malleable codes against bounded polynomial time tampering
