Extracting all the randomness and reducing the error in Trevisan's extractors
From MaRDI portal
Publication:5890865
DOI10.1145/301250.301292zbMath1345.68136OpenAlexW2119913278MaRDI QIDQ5890865
Omer Reingold, Ran Raz, Salil P. Vadhan
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2958609
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
On explicit constructions of designs ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Constant time parallel sorting: An empirical view. ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Extractors from Reed-Muller codes ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ On the distribution of the number of roots of polynomials and explicit weak designs ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Storing information with extractors.
This page was built for publication: Extracting all the randomness and reducing the error in Trevisan's extractors
