Explicit non-malleable codes against bit-wise tampering and permutations

DOI10.1007/978-3-662-47989-6_26MaRDI QIDQ3457127zbMATH OpenOpenAlexFDO

Authors Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47989-6_26

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Block-wise non-malleable codes
• Linear-time non-malleable codes in the bit-wise independent tampering model
• Non-malleable codes
• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Non-malleable codes against bounded polynomial time tampering

Cited in

(28)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Non-malleable codes against lookahead tampering
• Non-malleable codes for bounded parallel-time tampering
• Practical continuously non-malleable randomness encoders in the random oracle model
• Interactive non-malleable codes
• Strong continuous non-malleable encoding schemes with tamper-detection
• Non-malleable encryption: simpler, shorter, stronger
• Continuously non-malleable codes in the split-state model
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Non-malleable codes against bounded polynomial time tampering
• Locally decodable and updatable non-malleable codes and their applications
• Non-malleable encryption: simpler, shorter, stronger
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Optimal computational split-state non-malleable codes
• The Chaining Lemma and its application
• scientific article; zbMATH DE number 1303962 (Why is no real title available?)
• Block-wise non-malleable codes
• Non-Malleable Codes from Additive Combinatorics
• Non-malleable codes and extractors for small-depth circuits, and affine functions
• Bounded tamper resilience: how to go beyond the algebraic barrier
• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Continuously non-malleable codes with split-state refresh
• (Nondeterministic) hardness vs. non-malleability
• Explicit non-malleable codes from bipartite graphs
• Continuously non-malleable codes against bounded-depth tampering
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Non-malleable fuzzy extractors

This page was built for publication: Explicit non-malleable codes against bit-wise tampering and permutations

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