Rate-optimizing compilers for continuously non-malleable codes

DOI10.1007/978-3-030-21568-2_1MaRDI QIDQ2291374zbMATH OpenOpenAlexFDO

Authors Sandro Coretti, Antonio Faonio, D. Venturi

Publication date 30 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-21568-2_1

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Continuously non-malleable codes in the split-state model
• Continuous non-malleable codes
• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Continuously non-malleable codes with split-state refresh
• Continuously non-malleable codes in the split-state model from minimal assumptions

Cited in

(8)

• Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
• Practical continuously non-malleable randomness encoders in the random oracle model
• Continuously non-malleable secret sharing for general access structures
• Interactive non-malleable codes
• Non-malleable encryption: simpler, shorter, stronger
• Continuously non-malleable codes in the split-state model
• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Continuously non-malleable codes against bounded-depth tampering

This page was built for publication: Rate-optimizing compilers for continuously non-malleable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291374)