Revisiting the Sanders-Freiman-Ruzsa Theorem in ${\mathbb{F}}_p^n$ and its Application to Non-malleable Codes

Divesh Aggarwal, Jop Briët

Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead that a corrupted codeword decodes correctly or to so…