Pages that link to "Item:Q5486308"
From MaRDI portal
The following pages link to On ε‐biased generators in NC<sup>0</sup> (Q5486308):
Displaying 20 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On the security of Goldreich's one-way function (Q430847) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Local expanders (Q1653336) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Improved bounds on the an-complexity of \(O(1)\)-linear functions (Q2159467) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q5009532) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions (Q5098782) (← links)
- (Q6062142) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
