Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > CODE:
Reports tagged with code:
TR09-007 | 9th January 2009
Eli Ben-Sasson, Michael Viderman

#### Tensor Products of Weakly Smooth Codes are Robust

We continue the study of {\em robust} tensor codes and expand the
class of base codes that can be used as a starting point for the
construction of locally testable codes via robust two-wise tensor
products. In particular, we show that all unique-neighbor expander
codes and all locally correctable codes, ... more >>>

TR14-102 | 4th August 2014

#### Non-Malleable Codes Against Constant Split-State Tampering

Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs \cite{DPW10} as an elegant generalization of the classical notions of error detection, where the corruption of a codeword is viewed as a tampering function acting on it. Informally, a non-malleable code with respect to a family of tampering functions $\mathcal{F}$ consists ... more >>>

TR15-075 | 29th April 2015
Eshan Chattopadhyay, Vipul Goyal, Xin Li

#### Non-Malleable Extractors and Codes, with their Many Tampered Extensions

Revisions: 1

Randomness extractors and error correcting codes are fundamental objects in computer science. Recently, there have been several natural generalizations of these objects, in the context and study of tamper resilient cryptography. These are \emph{seeded non-malleable extractors}, introduced by Dodis and Wichs \cite{DW09}; \emph{seedless non-malleable extractors}, introduced by Cheraghchi and Guruswami ... more >>>

ISSN 1433-8092 | Imprint