Paper Info
Title
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.
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 }$$n﾿ bits, where n is the total number of bits in a codeword and $$0\\le \\delta < 1$$0≤﾿<1 a constant. Notably, this tampering class includes $$\\mathsf {NC}^0$$NC0.
Year
DOI
Venue
2016
10.1007/978-3-662-49896-5_31
IACR Cryptology ePrint Archive
Field
DocType
Volume
Discrete mathematics,Locality,Combinatorics,Fan-in,Theoretical computer science,Code word,Electronic circuit,Mathematics,Bounded function
Journal
2016
ISSN
Citations 
PageRank 
0302-9743
15
0.54
References 
Authors
24
4
Name
Order
Citations
PageRank
Marshall Ball1448.81
Dana Dachman-Soled244628.69
Mukul Kulkarni3222.65
Tal G. Malkin42633152.56