Pages that link to "Item:Q2292875"
From MaRDI portal
The following pages link to Tight proofs of space and replication (Q2292875):
Displaying 10 items.
- Incompressible encodings (Q2096497) (← links)
- New techniques in replica encodings with client setup (Q2119095) (← links)
- Simple proofs of space-time and rational proofs of storage (Q2181858) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- SnarkPack: practical SNARK aggregation (Q6045200) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
- Cryptanalysis of algebraic verifiable delay functions (Q6652907) (← links)
- Universal vector commitments (Q6660388) (← links)