The following pages link to On hardness of one-way functions (Q1097693):
Displaying 20 items.
- Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Quasi-injective reductions (Q1314394) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- On continuous one-way functions (Q2220825) (← links)
- Security-preserving hardness-amplification for any regular one-way function (Q2819544) (← links)
- Erratum for: ``On basing one-way functions on NP-hardness'' (Q2875206) (← links)
- On basing one-way functions on NP-hardness (Q2931429) (← links)
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation (Q2936603) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- Limitations of the upward separation technique (Q3490941) (← links)
- (Q4319246) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- Provably Hard Zero-Way Functions (Q4784455) (← links)
- On the Cryptographic Complexity of the Worst Functions (Q5746343) (← links)
