A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
From MaRDI portal
Publication:5261637
DOI10.1007/978-3-662-46494-6_16zbMath1359.94567OpenAlexW2236413529MaRDI QIDQ5261637
Shashank Agrawal, Omkant Pandey, Manoj Prabhakaran, Hemanta K. Maji, Divya Gupta
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_16
Related Items (20)
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Interactive non-malleable codes ⋮ Privacy amplification from non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable Codes with Split-State Refresh ⋮ 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 ⋮ Four-state non-malleable codes with explicit constant rate ⋮ 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 ⋮ Non-malleability against polynomial tampering
This page was built for publication: A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
