Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations

DOI10.1007/978-3-662-47989-6_26zbMath1375.94095OpenAlexW2189597476MaRDI QIDQ3457127

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

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)

Related Items (18)

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Practical continuously non-malleable randomness encoders in the random oracle model ⋮ Interactive non-malleable codes ⋮ The Chaining Lemma and Its Application ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Continuously non-malleable codes with split-state refresh ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Locally decodable and updatable non-malleable codes and their applications

This page was built for publication: Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations