On ε‐biased generators in NC0

DOI10.1002/rsa.20112zbMath1102.68024OpenAlexW2988890240MaRDI QIDQ5486308

Luca Trevisan, Elchanan Mossel, Amir Shpilka

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20112

zbMATH Keywords

pseudorandom generator

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Combinatorial probability (60C05)

Related Items (21)

Expander-based cryptography meets natural proofs ⋮ On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ A dichotomy for local small-bias generators ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Cryptographic hardness of random local functions. Survey ⋮ Local expanders ⋮ Matrix rigidity of random Toeplitz matrices ⋮ Improved bounds on the an-complexity of \(O(1)\)-linear functions ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ On the security of Goldreich's one-way function ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast Correlation Attacks: Methods and Countermeasures ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Expander-Based Cryptography Meets Natural Proofs ⋮ Fine-Grained Cryptography ⋮ Cryptography with constant input locality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extractors
• Cryptographic hardness of distribution-specific learning

This page was built for publication: On ε‐biased generators in NC⁰