Non-Malleable Codes from Additive Combinatorics
From MaRDI portal
Publication:4637777
DOI10.1137/140985251zbMath1401.94233OpenAlexW2800743724WikidataQ129978070 ScholiaQ129978070MaRDI QIDQ4637777
Shachar Lovett, Divesh Aggarwal, Yevgeniy Dodis
Publication date: 26 April 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.5917
Related Items (9)
Non-malleable codes for bounded parallel-time tampering ⋮ The Chaining Lemma and Its Application ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Continuously non-malleable codes in the split-state model ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ Non-malleability against polynomial tampering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine-evasive sets modulo a prime
- Non-malleable coding against bit-wise and split-state tampering
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A statistical theorem of set addition
- Inception makes non-malleable codes stronger
- On the Bogolyubov-Ruzsa lemma
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- Capacity of non-malleable codes
- BiTR: Built-in Tamper Resilience
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Extracting Randomness from Multiple Independent Sources
- Leakage-Resilient Storage
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Nonmalleable Cryptography
- Non-Malleable Codes
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Cryptography with Tamperable and Leaky Memory
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Leakage-Resilient Non-malleable Codes
- Tamper Detection and Continuous Non-malleable Codes
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Non-malleable extractors and codes, with their many tampered extensions
- Secure Remote Authentication Using Biometric Data
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Advances in Cryptology - CRYPTO 2003
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Continuous Non-malleable Codes
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
- Four-state non-malleable codes with explicit constant rate
This page was built for publication: Non-Malleable Codes from Additive Combinatorics
