Arrow Research search
Back to STOC

STOC 2022

Rate one-third non-malleable codes

Conference Paper Session 8A Algorithms and Complexity ยท Theoretical Computer Science

Abstract

At ITCS 2010, Dziembowski, Pietrzak, and Wichs introduced Non-malleable Codes (NMCs) which protect against tampering of a codeword of a given message into the codeword of a related message. A well-studied model of tampering is the 2-split-state model where the codeword consists of two independently tamperable states. As with standard error-correcting codes, it is of great importance to build codes with high rates.

Authors

Keywords

  • Non-malleable Codes
  • Randomness Extractors

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
844560560157859047
v2026.09.13