Pages that link to "Item:Q332271"
From MaRDI portal
The following pages link to Cryptographic hardness of random local functions. Survey (Q332271):
Displaying 10 items.
- Cryptography in constant parallel time (Q625101) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- (Q5875699) (← links)
- (Q6062142) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
