The following pages link to One-way permutations in NC 0 (Q1108786):
Displayed 7 items.
- One-way functions and circuit complexity (Q1096587) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Unconditionally secure NIZK in the fine-grained setting (Q6132420) (← links)