Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
From MaRDI portal
Publication:5757458
DOI10.1137/S0097539705447049zbMath1118.68096MaRDI QIDQ5757458
Ronen Shaltiel, Ran Raz, Ariel Gabizon
Publication date: 7 September 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (21)
Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ Deterministic extractors for affine sources over large fields ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ Extractors for varieties ⋮ Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound ⋮ Unnamed Item ⋮ How to get more mileage from randomness extractors ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ Deterministic extractors for small-space sources ⋮ An Introduction to Randomness Extractors ⋮ Proved Random Numbers Obtained from Hardware Devices ⋮ Improving the Hadamard extractor ⋮ On extractors and exposure‐resilient functions for sublogarithmic entropy ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ How to extract useful randomness from unreliable sources ⋮ Explicit two-source extractors and resilient functions ⋮ Increasing the output length of zero-error dispersers ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification ⋮ Extractors for small zero-fixing sources
This page was built for publication: Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
