On extractors and exposure‐resilient functions for sublogarithmic entropy

DOI10.1002/rsa.20424zbMath1311.68094arXiv1003.4029OpenAlexW2134274427MaRDI QIDQ4921889

Yakir A. Reshef, Salil P. Vadhan

Publication date: 28 May 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4029

zbMATH Keywords

pseudorandomnessrandomness extractorbit-fixing sourceexposure-resilient function

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Measures of information, entropy (94A17) Randomized algorithms (68W20) Pseudo-random numbers; Monte Carlo methods (11K45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Zero-Fixing Extractors for Sub-Logarithmic Entropy

Cites Work

• Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
• Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
• Randomness is linear in space
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Privacy Amplification by Public Discussion
• Probability Inequalities for Sums of Bounded Random Variables
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed