Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > CHOR-GOLDREICH SOURCES:
Reports tagged with Chor-Goldreich sources:
TR24-154 | 10th October 2024
Jesse Goodman, Xin Li, David Zuckerman

Improved Condensers for Chor-Goldreich Sources

One of the earliest models of weak randomness is the Chor-Goldreich (CG) source. A (t,n,k)-CG source is a sequence of random variables \mathbf{X}=(\mathbf{X}_1,\dots,\mathbf{X}_t) \sim (\{0,1\}^n)^t, where each \mathbf{X}_i has min-entropy k conditioned on any fixing of \mathbf{X}_1,\dots,\mathbf{X}_{i-1}. Chor and Goldreich proved that there is no deterministic way to extract randomness ... more >>>


TR24-171 | 6th November 2024
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach

Condensing against Online Adversaries

Revisions: 1

We investigate the task of deterministically condensing randomness from Online Non-Oblivious Symbol Fixing (oNOSF) sources, a natural model of defective random sources for which it is known that extraction is impossible [AORSV, EUROCRYPT'20]. A (g,\ell)-oNOSF source is a sequence of \ell blocks \mathbf{X} = (\mathbf{X}_1, \dots, \mathbf{X}_{\ell})\sim (\{0, 1\}^{n})^{\ell}, where ... more >>>




ISSN 1433-8092 | Imprint