Non-Malleable Codes from Additive Combinatorics
From MaRDI portal
Recommendations
- Non-malleable codes from additive combinatorics (extended abstract)
- Continuous non-malleable codes
- Capacity of non-malleable codes
- Capacity of non-malleable codes
- Constacyclic additive codes over finite fields
- Non-malleable codes
- Explicit non-malleable codes from bipartite graphs
- Block-wise non-malleable codes
- Theory of additive complementary dual codes, constructions and computations
- Upper and lower bounds for continuous non-malleable codes
Cites work
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- A statistical theorem of set addition
- Advances in Cryptology - CRYPTO 2003
- Affine-evasive sets modulo a prime
- BiTR: built-in tamper resilience
- Capacity of non-malleable codes
- Continuous non-malleable codes
- Cryptography with tamperable and leaky memory
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Explicit non-malleable codes against bit-wise tampering and permutations
- Extracting Randomness from Multiple Independent Sources
- Finite field models in additive combinatorics
- Four-state non-malleable codes with explicit constant rate
- From single-bit to multi-bit public-key encryption via non-malleable codes
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Inception makes non-malleable codes stronger
- Leakage-resilient non-malleable codes
- Leakage-resilient storage
- Low-degree tests at large distances
- Non-malleable codes
- Non-malleable codes from two-source extractors
- Non-malleable encryption: simpler, shorter, stronger
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Nonmalleable Cryptography
- On the Bogolyubov-Ruzsa lemma
- Optimal computational split-state non-malleable codes
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Public-Key Cryptosystems Resilient to Key Leakage
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Secure Remote Authentication Using Biometric Data
- Tamper and Leakage Resilience in the Split-State Model
- Tamper detection and continuous non-malleable codes
- Theory of Cryptography
Cited in
(15)- Non-malleability against polynomial tampering
- Non-malleable codes for bounded parallel-time tampering
- Continuously non-malleable codes in the split-state model
- The Chaining Lemma and its application
- Capacity of non-malleable codes
- Non-malleable codes from additive combinatorics (extended abstract)
- A generalization of a theorem of Rothschild and van Lint
- A generalization of a theorem of Rothschild and van Lint
- scientific article; zbMATH DE number 7759458 (Why is no real title available?)
- Rate one-third non-malleable codes
- (Nondeterministic) hardness vs. non-malleability
- Extractors: low entropy requirements colliding with non-malleability
- Explicit non-malleable codes from bipartite graphs
- Split-state non-malleable codes and secret sharing schemes for quantum messages
- On split-state quantum tamper detection
This page was built for publication: Non-Malleable Codes from Additive Combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637777)
