Non-malleability for binary discrete memoryless AVCs is achievable at rate asymptotically approaching 1.
Non-malleable codes and extractors for small-depth circuits, and affine functions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-malleable Coding for Arbitrary Varying Channels
Non-malleability for binary discrete memoryless AVCs is achievable at rate asymptotically approaching 1.