Three-source extractors for polylogarithmic min-entropy

DOI10.1109/FOCS.2015.58MaRDI QIDQ6946854zbMATH OpenFDO

Authors Xin Li

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.58

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(7)

• Seed-protecting extractors
• Uniform black-box separations via non-malleable extractors
• Two-source and affine non-malleable extractors for small entropy
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection
• Multi-source randomness extraction and generation in the random-oracle model
• Bit-fixing extractors for almost-logarithmic entropy

This page was built for publication: Three-source extractors for polylogarithmic min-entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946854)