Pages that link to "Item:Q5757460"

The following pages link to On Worst‐Case to Average‐Case Reductions for NP Problems (Q5757460):

Displaying 31 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
• Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
• Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• Generic complexity of Presburger arithmetic (Q848747) (← links)
• Improved hardness amplification in NP (Q868960) (← 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)
• Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
• On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
• Fine-Grained Cryptography (Q2829959) (← links)
• Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← 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)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
• (Q5002697) (← links)
• (Q5092470) (← links)
• Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
• Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← 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)