Pages that link to "Item:Q1703929"
From MaRDI portal
The following pages link to Beyond Hellman's time-memory trade-offs with applications to proofs of space (Q1703929):
Displaying 13 items.
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Efficient rational proofs for space bounded computations (Q1675446) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Simple proofs of space-time and rational proofs of storage (Q2181858) (← links)
- Tight proofs of space and replication (Q2292875) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- On the virtue of succinct proofs (Q5415478) (← links)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency (Q5445495) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)
- SNACKs for proof-of-space blockchains (Q6573987) (← links)
- Trapdoor memory-hard functions (Q6637334) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)