On ε‐biased generators in NC0

DOI10.1002/RSA.20112zbMATH Open1102.68024OpenAlexW2988890240MaRDI QIDQ5486308FDOQ5486308

Authors: Elchanan Mossel, Amir Shpilka, Luca Trevisan 

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

Recommendations

• scientific article; zbMATH DE number 1834654
• Cryptography in $NC^0$
• Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• A dichotomy for local small-bias generators

zbMATH Keywords

pseudorandom generator

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cryptographic hardness of distribution-specific learning
• Extractors
• Title not available (Why is that?)

Cited In (27)

• Expander-Based Cryptography Meets Natural Proofs
• Pseudorandom generators for combinatorial checkerboards
• Title not available (Why is that?)
• Public-key encryption, local pseudorandom generators, and the low-degree method
• Expander-based cryptography meets natural proofs
• On the Complexity of Random Satisfiability Problems with Planted Solutions
• Towards breaking the exponential barrier for general secret sharing
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
• Title not available (Why is that?)
• A dichotomy for local small-bias generators
• Randomness-Efficient Sampling Within NC 1
• Title not available (Why is that?)
• Non-interactive zero-knowledge from non-interactive batch arguments
• On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
• Local expanders
• On the security of Goldreich's one-way function
• Improved bounds on the an-complexity of \(O(1)\)-linear functions
• Fine-Grained Cryptography
• A dichotomy for local small-bias generators
• Cryptographic hardness of random local functions. Survey
• Cryptography with constant input locality
• Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
• Fast Correlation Attacks: Methods and Countermeasures
• Matrix rigidity of random Toeplitz matrices
• Actively secure garbled circuits with constant communication overhead in the plain model

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

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