Tamper Detection and Continuous Non-malleable Codes
WeN consider a public and keyless code (Enc,Dec) which is used to encode a message m and derive a codeword c = Enc(m). The codeword can be adversarially tampered via a function \(f \in{\mathcal F}\) from some “tampering function family” \(\mathcal F\), resulting in a tampered value c′ = f(c). We study the different types of security guarantees that can be achieved in this scenario for different families \(\mathcal{F}\) of tampering attacks.