Non-malleable coding against bit-wise and split-state tampering
From MaRDI portal
Publication:514470
DOI10.1007/s00145-015-9219-zzbMath1370.94497arXiv1309.1151OpenAlexW2106066551MaRDI QIDQ514470
Venkatesan Guruswami, Mahdi Cheraghchi
Publication date: 2 March 2017
Published in: Journal of Cryptology, Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1151
cryptographyinformation theoryerror detectioncoding theoryrandomness extractorstamper-resilient cryptographytamper-resilient storage
Related Items (24)
Improved, black-box, non-malleable encryption from semantic security ⋮ The Chaining Lemma and Its Application ⋮ Algebraic restriction codes and their applications ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Codes for Detection of Limited View Algebraic Tampering ⋮ Affine-evasive sets modulo a prime ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ 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 ⋮ Unnamed Item ⋮ Four-state non-malleable codes with explicit constant rate ⋮ 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
Cites Work
- Unnamed Item
- Non-malleable coding against bit-wise and split-state tampering
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Non-malleable Codes from Two-Source Extractors
- Pseudorandomness
- Non-malleable Reductions and Applications
- Capacity of non-malleable codes
- A 2-Source Almost-Extractor for Linear Entropy
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Non-Malleable Codes
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable codes from additive combinatorics
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Non-malleable extractors and codes, with their many tampered extensions
- Secure Computation from Random Error Correcting Codes
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Class of constructive asymptotically good algebraic codes
This page was built for publication: Non-malleable coding against bit-wise and split-state tampering
