Construction of extractors using pseudo-random generators (extended abstract)

DOI10.1145/301250.301289zbMath1345.68239OpenAlexW2073136473MaRDI QIDQ2819542

Luca Trevisan

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: https://doi.org/10.1145/301250.301289

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Random number generation in numerical analysis (65C10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

Deterministic extractors for affine sources over large fields ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Variations on Muchnik's conditional complexity theorem ⋮ How to get more mileage from randomness extractors ⋮ Long term confidentiality: a survey ⋮ Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive derandomization ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Pseudorandom generators without the XOR lemma ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Storing information with extractors.

This page was built for publication: Construction of extractors using pseudo-random generators (extended abstract)