Non-malleable Codes for Decision Trees

Marshall Ball, Siyao Guo, Daniel Wichs

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 unconditional non-malleable codes were known for decision trees beyond depth$$O(\log ^2 n)$$. Our result also yields efficient, unconditional non-malleable codes that are$$\exp (-n^{\varOmega (1)})$$ -secure against constant-depth circuits of$$\exp (n^{\varOmega (1)})$$ -size. Prior work of Chattopadhyay and Li (STOC 2017) and Ball et al. (FOCS 2018) only provide protection against$$\exp (O(\log ^2n))$$ -size circuits with$$\exp (-O(\log ^2n))$$ -security. We achieve our result through simple non-malleable reductions of decision tree tampering to split-state tampering. As an intermediary, we give a simple and generic reduction of leakage-resilient split-state tampering to split-state tampering with improved parameters. Prior work of Aggarwal et al. (TCC 2015) only provides a reduction to split-state non-malleable codes with decoders that exhibit particular properties.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings
EditorsDaniele Micciancio, Alexandra Boldyreva
PublisherSpringer Verlag
Number of pages22
ISBN (Print)9783030269470
StatePublished - 2019
Event39th Annual International Cryptology Conference, CRYPTO 2019 - Santa Barbara, United States
Duration: Aug 18 2019Aug 22 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11692 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference39th Annual International Cryptology Conference, CRYPTO 2019
Country/TerritoryUnited States
CitySanta Barbara

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Non-malleable Codes for Decision Trees'. Together they form a unique fingerprint.

Cite this