Paper 2016/307

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

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin

Abstract

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}$ bits, where $n$ is the total number of bits in a codeword and $0 \leq \delta < 1$ a constant. Notably, this tampering class includes $\mathsf{NC}^0$.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A major revision of an IACR publication in Eurocrypt 2016
Keywords
non-malleable codebounded output localitybounded-depth circuit
Contact author(s)
danadach @ ece umd edu
History
2016-03-18: received
Short URL
https://ia.cr/2016/307
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/307,
      author = {Marshall Ball and Dana Dachman-Soled and Mukul Kulkarni and Tal Malkin},
      title = {Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits},
      howpublished = {Cryptology ePrint Archive, Paper 2016/307},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/307}},
      url = {https://eprint.iacr.org/2016/307}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.