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