A Dichotomy for Local Small-Bias Generators

DOI10.1007/978-3-642-28914-9_34zbMath1304.68041OpenAlexW2165364253MaRDI QIDQ2891508

Alon Rosen, Andrej Bogdanov, Benny Applebaum

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_34

zbMATH Keywords

dichotomylocal functionssmall-bias generatorNC\(^0\)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (10)

On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Cryptographic hardness of random local functions. Survey ⋮ Locally computable UOWHF with linear shrinkage ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Algebraic Attacks against Random Local Functions and Their Countermeasures ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Indistinguishability obfuscation ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

This page was built for publication: A Dichotomy for Local Small-Bias Generators