Non-malleable Codes for Decision Trees
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, pp. 413-434, 2019.
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by decision trees of depth d = n(1/4-o(1)). In particular, each bit of the tampered codeword is set arbitrarily after adaptively reading up to d arbitrary locations within the original codeword. Prior to this work, no efficient u...More
Full Text (Upload PDF)
PPT (Upload PPT)