Non-malleable codes from two-source extractors

DOI10.1007/978-3-642-40084-1_14MaRDI QIDQ2849399zbMATH OpenOpenAlexFDO

Authors Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_14

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
• Non-malleable reductions and applications
• Non-malleable codes

Cited in

(44)

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Non-malleability against polynomial tampering
• Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
• Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
• Practical continuously non-malleable randomness encoders in the random oracle model
• Continuously non-malleable secret sharing for general access structures
• 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
• 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
• Codes for detection of limited view algebraic tampering
• Non-Malleable Codes from Additive Combinatorics
• Affine-evasive sets modulo a prime
• Non-malleable codes and extractors for small-depth circuits, and affine functions
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
• Non-malleable extractors and non-malleable codes: partially optimal constructions
• Nonmalleable extractors and codes, with their many tampered extensions
• Bounded tamper resilience: how to go beyond the algebraic barrier
• Non-malleable codes from additive combinatorics (extended abstract)
• Leakage-resilient non-malleable codes
• Explicit two-source extractors and resilient functions
• Non-malleable Codes with Split-State Refresh
• 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
• Algebraic restriction codes and their applications
• (Nondeterministic) hardness vs. non-malleability
• Extractors: low entropy requirements colliding with non-malleability
• Explicit non-malleable codes from bipartite graphs
• Practical non-malleable codes from symmetric-key primitives in 2-split-state model
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
• Non-malleable fuzzy extractors
• Non-malleable codes from leakage resilient cryptographic primitives
• Non-malleable codes with optimal rate for poly-size circuits
• Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• Codes for adversaries: between worst-case and average-case jamming
• On split-state quantum tamper detection

This page was built for publication: Non-malleable codes from two-source extractors

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