2017/01/27 by Ryota Iwamoto, Iwamoto, Ryota, Takeshi Koshiba +1
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1701.07914
openalex publication_date 2017/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original message or a completely unrelated value. Thus, if an adversary corrupts a codeword then he cannot get any information from the codeword. This means that non-malleable codes are useful to provide a security guarantee in such situations that the adversary can overwrite the encoded message. In 2010, Dziembowski et al. showed a construction for non-malleable codes against the adversary who can falsify codewords bitwise independently. In this paper, we consider an extended adversarial model (affine error model) where the adversary can falsify codewords bitwise independently or replace some bit with the value obtained by applying an affine map over a limited number of bits. We prove that the non-malleable codes (for the bitwise error model) provided by Dziembowski et al. are still non-malleable against the adversary in the affine error model.