Pages that link to "Item:Q2875143"
From MaRDI portal
The following pages link to Public-key cryptography from different assumptions (Q2875143):
Displaying 30 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- On the security of Goldreich's one-way function (Q430847) (← links)
- Information-theoretic thresholds from the cavity method (Q1649349) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- On the One-Way Function Candidate Proposed by Goldreich (Q2828220) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- (Q5009502) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- (Q5743407) (← links)
- (Q5743436) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- (Q6062142) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
