Non-malleable extractors and non-malleable codes: partially optimal constructions
From MaRDI portal
Publication:5091780
Recommendations
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable extractors and codes, with their many tampered extensions
- Nonmalleable extractors and codes, with their many tampered extensions
- Nonmalleable extractors with short seeds and applications to privacy amplification
- Non-malleable extractors: new tools and improved constructions
Cites work
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- Advances in Cryptology - CRYPTO 2003
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- An Entropy Lower Bound for Non-Malleable Extractors
- Capacity of non-malleable codes
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Design extractors, non-malleable condensers and privacy amplification
- Explicit Resilient Functions Matching Ajtai-Linial
- Explicit two-source extractors and resilient functions
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Extractors
- Extractors for a constant number of polynomially small MIN-entropy independent sources
- Extractors for sumset sources
- Extractors with weak random seeds
- Four-state non-malleable codes with explicit constant rate
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- scientific article; zbMATH DE number 1088243 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Kakeya sets, new mergers, and old extractors
- Key Agreement from Close Secrets over Unsecured Channels
- Local correlation breakers and applications to three-source extractors and mergers
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- New independent source extractors with exponential improvement
- Non-malleable codes
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable codes from two-source extractors
- Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable extractors: new tools and improved constructions
- Non-malleable reductions and applications
- Nonmalleable extractors with short seeds and applications to privacy amplification
- Privacy Amplification by Public Discussion
- Privacy amplification with asymptotically optimal entropy loss
- Pseudorandom generators for space-bounded computation
- Pseudorandom generators for width-3 branching programs
- Randomness is linear in space
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Simulating independence
- Some remarks on the theory of graphs
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(22)- Lower bounds for matrix factorization
- Non-malleability against polynomial tampering
- Privacy amplification from non-malleable codes
- Explicit two-source extractors and resilient functions
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Nonmalleable extractors and codes, with their many tampered extensions
- scientific article; zbMATH DE number 7087310 (Why is no real title available?)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- (Nondeterministic) hardness vs. non-malleability
- Extractors: low entropy requirements colliding with non-malleability
- Continuously non-malleable codes against bounded-depth tampering
- Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
- Non-malleable codes with optimal rate for poly-size circuits
- Seed-protecting extractors
- Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
- Uniform black-box separations via non-malleable extractors
- Two-source and affine non-malleable extractors for small entropy
- Split-state non-malleable codes and secret sharing schemes for quantum messages
- On split-state quantum tamper detection
- Bit-fixing extractors for almost-logarithmic entropy
This page was built for publication: Non-malleable extractors and non-malleable codes: partially optimal constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091780)
