Timeline for Private Randomness extractor
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2014 at 23:39 | comment | added | usul | Good point. I wish I had the knowledge to give a good answer! (I guess there is some naive transformation that works "ok", if we think of Y and Z as being encoded by bitstrings and if we can sample from Z by running a function on uniformly random inputs...) | |
| Feb 7, 2014 at 19:51 | comment | added | math-Student | @usul, thanks for the comment and nice reference you sent me, as far as I could get from this chapter, the output of each extractor should be close to uniform distribution and also all sources are assumed to be binary. However, in this problem, all sources lie in arbitrary spaces, and also output of $f$ are not necessarily uniform binary. | |
| Feb 7, 2014 at 6:27 | comment | added | usul | This is an entire area of study (and I'm kind of surprised you're asking such a broad question because you seem to know most of the terminology already). It would be nice if someone with more expertise than I can summarize the state of the art for you. I can at least point to Vadhan's book on Pseudorandomness which has a chapter on extractors: people.seas.harvard.edu/~salil/pseudorandomness | |
| Feb 7, 2014 at 5:06 | history | asked | math-Student | CC BY-SA 3.0 |