Pages that link to "Item:Q1673424"
From MaRDI portal
The following pages link to Proofs of Work from worst-case assumptions (Q1673424):
Displaying 12 items.
- 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)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- The superlinearity problem in post-quantum blockchains (Q6573965) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← 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 building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
