A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations

DOI10.1007/978-3-662-46494-6_16MaRDI QIDQ5261637zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

explicit constructionnon-malleable codesinformation theoreticrate onerate-optimizing compiler

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Rate-optimizing compilers for continuously non-malleable codes
• Explicit rate-1 non-malleable codes for local tampering
• Linear-time non-malleable codes in the bit-wise independent tampering model
• Explicit non-malleable codes against bit-wise tampering and permutations

Cited in

(25)

• Locally decodable and updatable non-malleable codes and their applications
• Continuously non-malleable codes with split-state refresh
• Four-state non-malleable codes with explicit constant rate
• Continuously non-malleable codes in the split-state model
• Non-malleable encryption: simpler, shorter, stronger
• Strong continuous non-malleable encoding schemes with tamper-detection
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Subversion-resilient signatures: definitions, constructions and applications
• Nonmalleable extractors and codes, with their many tampered extensions
• Privacy amplification from non-malleable codes
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Explicit rate-1 non-malleable codes for local tampering
• Rate-optimizing compilers for continuously non-malleable codes
• Explicit non-malleable codes against bit-wise tampering and permutations
• Non-malleability against polynomial tampering
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
• Non-malleable Codes with Split-State Refresh
• Non-Malleable Codes from Additive Combinatorics
• Interactive non-malleable codes
• Non-malleable codes with optimal rate for poly-size circuits
• 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
• Optimal computational split-state non-malleable codes
• (Nondeterministic) hardness vs. non-malleability
• Information-Theoretic Local Non-malleable Codes and Their Applications

This page was built for publication: A rate-optimizing compiler for 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 Q5261637)