Pages that link to "Item:Q4977996"
From MaRDI portal
The following pages link to Average-case fine-grained hardness (Q4977996):
Displaying 15 items.
- Fine-grained secure computation (Q1631318) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- (Q4993281) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002697) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Towards permissionless consensus in the standard model via fine-grained complexity (Q6648203) (← links)
- Fine-grained non-interactive key exchange, revisited (Q6648208) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
