Explicit Resilient Functions Matching Ajtai-Linial

@article{Meka2017ExplicitRF,
  title={Explicit Resilient Functions Matching Ajtai-Linial},
  author={Raghu Meka},
  journal={ArXiv},
  year={2017},
  volume={abs/1509.00092}
}
  • Raghu Meka
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
  • A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most q variables has significant influence on the function. Resilient functions have been extensively studied with a variety of applications in cryptography, distributed computing, and pseudorandomness. The best known balanced resilient function on n variables… CONTINUE READING
    Explicit two-source extractors and resilient functions
    86
    XOR lemmas for resilient functions against polynomials
    1
    A Tight Lower Bound for Entropy Flattening
    9
    Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
    • Xin Li
    • Computer Science, Mathematics
    • 2018
    26

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 36 REFERENCES
    Explicit two-source extractors and resilient functions
    86
    Constant depth circuits, Fourier transform, and learnability
    434
    Mansour's Conjecture is True for Random DNF Formulas
    33
    Improved Pseudorandom Generators for Depth 2 Circuits
    54
    Randomness-Efficient Sampling within NC1
    • A. Healy
    • Computer Science, Mathematics
    • 2007
    28
    Randomness-optimal oblivious sampling
    140
    Pseudorandomness via the Discrete Fourier Transform
    31
    A Chernoff Bound for Random Walks on Expander Graphs
    189
    Three-Source Extractors for Polylogarithmic Min-Entropy
    • X. Li
    • Computer Science, Mathematics
    • 2015
    54