Pages that link to "Item:Q2931429"

The following pages link to On basing one-way functions on NP-hardness (Q2931429):

Displaying 20 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
• On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← 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 Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
• Fine-Grained Cryptography (Q2829959) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← 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)
• Dynamic full quantum one-way function based on quantum circuit mapping (Q6073993) (← links)
• (Q6084353) (← links)
• (Q6084358) (← links)
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← 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)