HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Non-Malleable Codes for Small-Depth Circuits

Marshall Ball
Marshall Ball
Dana Dachman-Soled
Dana Dachman-Soled
Siyao Guo
Siyao Guo
Tal Malkin
Tal Malkin
Li-Yang Tan
Li-Yang Tan

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 826.0-837, 2018.

Cited by: 20|Bibtex|Views38|DOI:https://doi.org/10.1109/FOCS.2018.00083
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org
Keywords:
Non-malleable codesSmall-depth circuitsSwitching lemma

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments