Non-Malleable Codes for Small-Depth Circuits
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 826.0-837, 2018.
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by small-depth circuits. For constant-depth circuits of polynomial size (i.e. AC(0) tampering functions), our codes have codeword length n = k(1+o(1)) for a k-bit message. This is an exponential improvement of the previous best c...More
Full Text (Upload PDF)
PPT (Upload PPT)