Paper 2018/1015
Non-Malleable Codes Against Bounded Polynomial Time Tampering
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, and Tal Malkin
Abstract
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) model and requires the assumptions that (1)
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- non-malleable codenon-malleable commitmentderandomization
- Contact author(s)
- danadach @ ece umd edu
- History
- 2018-10-24: received
- Short URL
- https://ia.cr/2018/1015
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/1015, author = {Marshall Ball and Dana Dachman-Soled and Mukul Kulkarni and Huijia Lin and Tal Malkin}, title = {Non-Malleable Codes Against Bounded Polynomial Time Tampering}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/1015}, year = {2018}, url = {https://eprint.iacr.org/2018/1015} }