论文信息 - Non-Malleable Codes

Non-Malleable Codes

In this report,based on the paper of Dziembowski et al.'s [DPW10], we explain how we can construct an e cient code that is nonmalleable with respect to modi cations that e ect each bit of the codeword arbitrarily. A variety of modi cations of codewords are considered such as ipping each bit of the codeword, leaving it untouched, or setting it to either 0 or 1 but independently of the value of the other bits of the codeword. The main idea for constructing an e cient non-malleable code with respect to bit wise tampering family FBit is using Algebraic Manipulation Detection code and a type of Linear Error-Correcting SecretSharing schemes.

B. Abdolmaleki

[1] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .

[2] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[3] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[4] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.

[5] Stefan Dziembowski,et al. Non-Malleable Codes , 2018, ICS.

[6] Stefan Dziembowski,et al. Non-Malleable Codes from Two-Source Extractors , 2013, IACR Cryptol. ePrint Arch..

[7] Moni Naor,et al. How to Share a Secret, Infinitely , 2016, IEEE Transactions on Information Theory.