Nonmalleable Extractors and Codes, with Their Many Tampered Extensions

Combinatorics in computer science (68R05) Cryptography (94A60) Other types of codes (94B60) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Affine-evasive sets modulo a prime
Non-malleable coding against bit-wise and split-state tampering
Non-malleable secret sharing for general access structures
Inception makes non-malleable codes stronger
Constructing locally computable extractors and cryptosystems in the bounded-storage model
Lower bounds for leakage-resilient secret sharing
Privacy amplification from non-malleable codes
Explicit rate-1 non-malleable codes for local tampering
Revisiting non-malleable secret sharing
Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
Explicit two-source extractors and resilient functions
Non-malleable Codes from Two-Source Extractors
Tamper and Leakage Resilience in the Split-State Model
Non-malleable Reductions and Applications
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
Capacity of Non-Malleable Codes
BiTR: Built-in Tamper Resilience
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Concurrent Nonmalleable Commitments
Extractors with weak random seeds
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Key Agreement from Close Secrets over Unsecured Channels
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Non-Malleable Codes
Overcoming Weak Expectations
Improved non-malleable extractors, non-malleable codes and independent source extractors
Towards optimal two-source extractors and Ramsey graphs
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
Extractors for adversarial sources via extremal hypergraphs
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Non-malleable extractors and symmetric key cryptography from weak secrets
Non-malleable secret sharing
Non-malleable codes from additive combinatorics
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
Tamper Detection and Continuous Non-malleable Codes
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
Non-malleable extractors: new tools and improved constructions
Design extractors, non-malleable condensers and privacy amplification
Advances in Cryptology - CRYPTO 2003
Extractors and pseudorandom generators
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
Privacy Amplification and Nonmalleable Extractors Via Character Sums
Privacy amplification with asymptotically optimal entropy loss
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
Continuous Non-malleable Codes
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
Four-state non-malleable codes with explicit constant rate
Extracting all the randomness and reducing the error in Trevisan's extractors
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.