Exposure-resilient extractors and the derandomization of probabilistic sublinear time

DOI10.1007/s00037-008-0243-3zbMath1149.68035OpenAlexW2091536492MaRDI QIDQ937199

Marius Zimand

Publication date: 20 August 2008

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-008-0243-3

zbMATH Keywords

pseudo-random generatorextractorsublinear-time algorithm

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Adaptive extractors and their application to leakage resilient secret sharing ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ Amplification and Derandomization without Slowdown ⋮ On the Security Loss in Cryptographic Reductions ⋮ Typically-correct derandomization for small time and space

This page was built for publication: Exposure-resilient extractors and the derandomization of probabilistic sublinear time