Cryptology ePrint Archive: Report 2021/1269

Practical Continuously Non-Malleable Randomness Encoders in the Random Oracle Model

Antonio Faonio

Abstract: A randomness encoder is a generalization of encoding schemes with an efficient procedure for encoding \emph{uniformly random strings}. In this paper we continue the study of randomness encoders that additionally have the property of being continuous non-malleable. The beautiful notion of non-malleability for encoding schemes, introduced by Dziembowski, Pietrzak and Wichs (ICS’10), states that tampering with the codeword can either keep the encoded message identical or produce an uncorrelated message. Continuous non-malleability extends the security notion to a setting where the adversary can tamper the codeword polynomially many times and where we assume a self-destruction mechanism in place in case of decoding errors. Our contributions are: (1) two practical constructions of continuous non-malleable randomness encoders in the random oracle model, and (2) a new compiler from continuous non-malleable randomness encoders to continuousnon-malleable codes, and (3) a study of lower bounds for continuous non-malleability in the random oracle model.

Category / Keywords: foundations / non-malleble codes

Original Publication (with major differences): CANS'21

Date: received 22 Sep 2021, last revised 28 Sep 2021

Contact author: faonio at eurecom fr

Available format(s): PDF | BibTeX Citation

Note: Note Second version uploaded: fixed first page, added more references.

Version: 20210928:133009 (All versions of this report)

Short URL: ia.cr/2021/1269


[ Cryptology ePrint archive ]