Deterministic extractors for affine sources over large fields
From MaRDI portal
Publication:2390150
DOI10.1007/S00493-008-2259-3zbMATH Open1174.05117OpenAlexW2091564680MaRDI QIDQ2390150FDOQ2390150
Authors: Ran Raz, Ariel Gabizon 
Publication date: 20 July 2009
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2259-3
Recommendations
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Extractors for polynomial sources over fields of constant order and small characteristic
- Affine dispersers from subspace polynomials
- Affine extractors over large fields with exponential error
- Deterministic extractors for additive sources (extended abstract)
Cites Work
- On Some Exponential Sums
- Regularity and Positional Games
- Generating quasi-random sequences from semi-random sources
- Equations over finite fields. An elementary approach
- Simulating BPP using a general weak random source
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- A Constructive Solution to a Tournament Problem
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Title not available (Why is that?)
- Simple extractors for all min-entropies and a new pseudorandom generator
- Title not available (Why is that?)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Randomness is linear in space
- On the construction of affine extractors
- Extracting randomness: A survey and new constructions
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extractors with weak random seeds
- Extracting Randomness Using Few Independent Sources
- Simulating independence
- Construction of extractors using pseudo-random generators (extended abstract)
- Extractors from Reed-Muller codes
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Addendum to “simple constructions of almost k-wise independent random variables”
- Theory of Cryptography
Cited In (27)
- Extractors for varieties
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
- From Affine to Two-Source Extractors via Approximate Duality
- Variety evasive sets
- Deterministic Truncation of Linear Matroids
- Variety evasive subspace families
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Succinct non-interactive arguments via linear interactive proofs
- Improving the Hadamard extractor
- Increasing the output length of zero-error dispersers
- Construction of irreducible polynomials through rational transformations
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extractors and lower bounds for locally samplable sources
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits
- How to extract useful randomness from unreliable sources
- Title not available (Why is that?)
- An introduction to randomness extractors
- Affine extractors over large fields with exponential error
- Non-malleability against polynomial tampering
- Affine extractors over prime fields
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Extractors and rank extractors for polynomial sources
- Towards dimension expanders over finite fields
- On the construction of affine extractors
- Title not available (Why is that?)
This page was built for publication: Deterministic extractors for affine sources over large fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390150)
