Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR16-180 | 15th November 2016 22:00

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions


Authors: Eshan Chattopadhyay, Xin Li
Publication: 15th November 2016 22:20
Downloads: 387


Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs as an elegant relaxation of error correcting codes, where the motivation is to handle more general forms of tampering while still providing meaningful guarantees. This has led to many elegant constructions and applications in cryptography. However, most works so far only studied tampering in the split-state model where different parts of the codeword are tampered independently, and thus do not apply to many other natural classes of tampering functions. The only exceptions are the work of Agrawal et al., which studied non-malleable codes against bit permutation composed with bit-wise tampering, and the work of Ball et al, which studied non-malleable codes against local functions. However, in both cases each tampered bit only depends on a subset of input bits.

In this work, we study the problem of constructing non-malleable codes against more general tampering functions that act on the entire codeword. We give the first efficient constructions of non-malleable codes against $AC^0$ tampering functions and affine tampering functions. These are the first explicit non-malleable codes against tampering functions where each tampered bit can depend on all input bits. We also give efficient non-malleable codes against $t$-local functions for $t=o(\sqrt{n})$, where a $t$-local function has the property that any output bit depends on at most $t$ input bits. In the case of deterministic decoders, this improves upon the results of Ball et al, which can handle $t\le n^{\frac{1}{4}}$.

All our results on non-malleable codes are obtained by using the connection between non-malleable codes and seedless non-malleable extractors discovered by Cheraghchi and Guruswami. Therefore, we also give the first efficient constructions of seedless non-malleable extractors against $\ac$ tampering functions, $t$-local tampering functions for $t=o(\sqrt{n})$, and affine tampering functions. To derive our results on non-malleable codes, we design efficient algorithms to almost uniformly sample from the pre-image of any given output of our non-malleable extractor.

With the recent flurry of work on non-malleable extractors and various connections to more standard seedless extractors, we believe that our results on non-malleable extractors and the techniques developed here are of independent interest.

ISSN 1433-8092 | Imprint