Cryptology ePrint Archive: Report 2018/596

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments

Ivan Damgård and Tomasz Kazana and Maciej Obremski and Varun Raj and Luisa Siniscalchi

Abstract: Non-Malleable Codes (NMC) were introduced by Dziembowski, Pietrzak and Wichs in ICS 2010 as a relaxation of error correcting codes and error detecting codes. Faust, Mukherjee, Nielsen, and Venturi in TCC 2014 introduced an even stronger notion of non-malleable codes called continuous non-malleable codes where security is achieved against continuous tampering of a single codeword without re-encoding. We construct information theoretically secure CNMC resilient to bit permutations and overwrites, this is the first Continuous NMC constructed outside of the split-state model. In this work we also study relations between the CNMC and parallel CCA commitments. We show that the CNMC can be used to bootstrap a self-destruct parallel CCA bit commitment to a self-destruct parallel CCA string commitment, where self-destruct parallel CCA is a weak form of parallel CCA security. Then we can get rid of the self-destruct limitation obtaining a parallel CCA commitment, requiring only one-way functions.

Category / Keywords: non-malleable codes, continuous non-malleable codes, non-malleable commitments

Date: received 9 Jun 2018, last revised 17 Jul 2018

Contact author: luisa siniscalchi88 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20180717:092158 (All versions of this report)

Short URL: ia.cr/2018/596


[ Cryptology ePrint archive ]