Rate-optimizing compilers for continuously non-malleable codes
From MaRDI portal
Publication:2291374
DOI10.1007/978-3-030-21568-2_1zbMath1458.94228OpenAlexW2947779542MaRDI QIDQ2291374
Sandro Coretti, Antonio Faonio, Daniele Venturi
Publication date: 30 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-21568-2_1
Related Items (7)
Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
This page was built for publication: Rate-optimizing compilers for continuously non-malleable codes
