Non-malleable codes for bounded depth, bounded fan-in circuits

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

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

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δbits, where n is the total number of bits in a codeword and 0 ≤ δ < 1 a constant. Notably, this tampering class includes NC0.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsMarc Fischlin, Jean-Sebastien Coron
PublisherSpringer Verlag
Pages881-908
Number of pages28
ISBN (Print)9783662498958
DOIs
StatePublished - 2016
Event35th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016 - Vienna, Austria
Duration: May 8 2016May 12 2016

Publication series

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

Other

Other35th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016
Country/TerritoryAustria
CityVienna
Period5/8/165/12/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Non-malleable codes for bounded depth, bounded fan-in circuits'. Together they form a unique fingerprint.

Cite this