Nonmalleable extractors and codes, with their many tampered extensions
From MaRDI portal
(Redirected from Publication:5129235)
Recommendations
- Non-malleable extractors and codes, with their many tampered extensions
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable extractors: new tools and improved constructions
- Nonmalleable extractors with short seeds and applications to privacy amplification
- Non-malleable extractors with shorter seeds and their applications
Cites work
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
- Advances in Cryptology - CRYPTO 2003
- Affine-evasive sets modulo a prime
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- BiTR: built-in tamper resilience
- Block-wise non-malleable codes
- Capacity of non-malleable codes
- Concurrent Nonmalleable Commitments
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Continuous non-malleable codes
- Design extractors, non-malleable condensers and privacy amplification
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Explicit rate-1 non-malleable codes for local tampering
- Explicit two-source extractors and resilient functions
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extractors and pseudorandom generators
- Extractors for adversarial sources via extremal hypergraphs
- 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?)
- scientific article; zbMATH DE number 1097580 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Inception makes non-malleable codes stronger
- Key Agreement from Close Secrets over Unsecured Channels
- Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Local correlation breakers and applications to three-source extractors and mergers
- Lower bounds for leakage-resilient secret sharing
- Non-malleable codes
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes for bounded depth, bounded fan-in circuits
- 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 non-malleable codes: partially optimal constructions
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable extractors: new tools and improved constructions
- Non-malleable reductions and applications
- Non-malleable secret sharing
- Non-malleable secret sharing for general access structures
- Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
- Nonmalleable extractors with short seeds and applications to privacy amplification
- Overcoming weak expectations
- Privacy amplification from non-malleable codes
- Privacy amplification with asymptotically optimal entropy loss
- Revisiting non-malleable secret sharing
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Tamper and Leakage Resilience in the Split-State Model
- Tamper detection and continuous non-malleable codes
- Towards optimal two-source extractors and Ramsey graphs
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(8)- Low error efficient computational extractors in the CRS model
- Multi-source non-malleable extractors and applications
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Non-malleable extractors and codes, with their many tampered extensions
- Extractors: low entropy requirements colliding with non-malleability
- Split-state non-malleable codes and secret sharing schemes for quantum messages
- On split-state quantum tamper detection
This page was built for publication: Nonmalleable extractors and codes, with their many tampered extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129235)
