Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ORI FRIDMAN:
All reports by Author Ori Fridman:

TR25-012 | 17th February 2025
Dean Doron, Ori Fridman

Bit-Fixing Extractors for Almost-Logarithmic Entropy

An oblivious bit-fixing source is a distribution over $\{0,1\}^n$, where $k$ bits are uniform and independent and the rest $n-k$ are fixed a priori to some constant value. Extracting (close to) true randomness from an oblivious bit-fixing source has been studied since the 1980s, with applications in cryptography and complexity ... more >>>




ISSN 1433-8092 | Imprint