Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography

DOI10.1137/S0097539705446846zbMath1124.68036OpenAlexW2095594956MaRDI QIDQ5422484

Jesse Kamp, David Zuckerman

Publication date: 22 October 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539705446846

zbMATH Keywords

random walkscryptographydeterministicrandomnessresilient functionbit-fixing sourcesExtractorsexposure-resilient

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20)

Related Items (25)

Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ Deterministic extractors for affine sources over large fields ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ Extractors for varieties ⋮ Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound ⋮ Unnamed Item ⋮ How to get more mileage from randomness extractors ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ Computational fuzzy extractors ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ Deterministic extractors for small-space sources ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ An Introduction to Randomness Extractors ⋮ Leakage-resilient attribute based encryption in prime-order groups via predicate encodings ⋮ Improving the Hadamard extractor ⋮ On extractors and exposure‐resilient functions for sublogarithmic entropy ⋮ Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources ⋮ Reusable fuzzy extractors for low-entropy distributions ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ How to extract useful randomness from unreliable sources ⋮ Computing majority by constant depth majority circuits with low fan-in gates ⋮ Increasing the output length of zero-error dispersers ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification ⋮ Extractors for small zero-fixing sources

This page was built for publication: Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography