Pages that link to "Item:Q5261621"
From MaRDI portal
The following pages link to On Basing Size-Verifiable One-Way Functions on NP-Hardness (Q5261621):
Displaying 14 items.
- On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- (Q6084358) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
