Explicit Non-Malleable Codes Against Bitwise Tampering and Permutations

Explore the concept of explicit non-malleable codes designed to resist bit-wise tampering and permutations in this 20-minute conference talk. Delve into the definition and realizability of non-malleable codes, examining order of quantifiers and key results. Learn about existential results and explicit constructions, including Reed-Solomon encoding, augmented RS encoding, balanced unary encoding, and additive secret sharing. Understand the proposed encoding scheme and consider future directions in this field of cryptography.