Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.

We show how to construct efficient, unconditionally secure non-malleable codes for bounded output locality. In particular, our scheme is resilient against functions such that any output bit is dependent on at most $$n^{\\delta }$$n﾿ bits, where n is the total number of bits in a codeword and $$0\\le \\delta < 1$$0≤﾿<1 a constant. Notably, this tampering class includes $$\\mathsf {NC}^0$$NC0.