Non-Malleable Codes in the Split-State Model
summary
Non-malleable codes in the two-piece split-state model are examined, focusing on constructing codes that prevent an adversary who independently tampers with each half from producing related decoded messages. The talk covers specific constructions and techniques to achieve non-malleability in this model and analyzes their security properties and limitations.
AI-written summary · about
chapters (16)
- 0:00Start
- 0:17Tampering Experiment
- 2:54Example: Error-correcting codes
- 3:49Example: Error-detecting codes
- 6:33Error-correction detection impossible
- 8:49Application of Non-malleable codes
- 13:09Which realistic families F can we tolerate?
- 19:03NM-codes in the t-split state model
- 22:17Non-malleable Reduction: Composability
- 23:12Our results
- 24:05Two simplifying assumptions for the talk
- 33:25Proof Step 1: Partitioning Lemma
- 33:43Main tools used for the proof
- 35:57Step two: Fatine = NM
- 40:36Encoding Rate for k-bit messages?
- 59:57Summarizing and Composing the two reductions We showed
related talks
40mBinary Codes with Resilience Beyond 1/4 via Interaction
32mComputational Wiretap Coding from Indistinguishability Obfuscation
19mError Correcting Codes for Uncompressed Messages
44mCoding Theory in Almost Linear Time and Sublinear Space
58mBosonic (And Other) Codes With Interesting Logical Gate Sets
01h 00mError-Correcting Codes That Enable Efficient SNARKs
41mConstant Query Local Decoding Against Deletions Is Impossible
43mCode-based Cryptography