Block-wise non-malleable codes

DOI10.4230/LIPICS.ICALP.2016.31MaRDI QIDQ4598167zbMATH OpenFDO

Authors Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay

Publication date 19 December 2017

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2016.31

zbMATH Keywords

block-wise tamperingcomplexity-leveragingnon-malleable codesnon-malleable commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Explicit non-malleable codes against bit-wise tampering and permutations
• Non-malleable codes against bounded polynomial time tampering
• Non-malleable reductions and applications
• Non-malleable codes
• Linear-time non-malleable codes in the bit-wise independent tampering model

Cited in

(15)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Non-malleable codes for bounded parallel-time tampering
• Interactive non-malleable codes
• Non-malleable encryption: simpler, shorter, stronger
• Continuously non-malleable codes in the split-state model
• Optimal computational split-state non-malleable codes
• Capacity of non-malleable codes
• Explicit non-malleable codes against bit-wise tampering and permutations
• Non-Malleable Codes from Additive Combinatorics
• Nonmalleable extractors and codes, with their many tampered extensions
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Continuously non-malleable codes with split-state refresh
• Four-state non-malleable codes with explicit constant rate
• Rate one-third non-malleable codes
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates

This page was built for publication: Block-wise non-malleable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598167)