Simple proofs of space-time and rational proofs of storage
From MaRDI portal
Recommendations
- Proofs of storage: theory, constructions and applications
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Tight proofs of space and replication
- Efficient rational proofs for space bounded computations
- Compact proofs of retrievability
- Compact Proofs of Retrievability
- Proofs of storage from homomorphic identification protocols
- Publicly verifiable static proofs of storage: a novel scheme and efficiency comparisons
- scientific article; zbMATH DE number 512803
- Proofs of replicated storage without timing assumptions
Cited in
(18)- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Proofs of replicated storage without timing assumptions
- Proof-of-burn
- Minting mechanism for proof of stake blockchains
- Reversible proofs of sequential work
- Tight proofs of space and replication
- Bankrupting Sybil despite churn
- Proofs of space: when space is of the essence
- Cryptographic primitives enforcing communication and storage complexity
- Proof of space from stacked expanders
- Proofs of space
- Proofs of Catalytic Space
- Resource Burning for Permissionless Systems (Invited Paper)
- Achieving almost all blockchain functionalities with polylogarithmic storage
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Permissionless and asynchronous asset transfer
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- stoRNA: stateless transparent proofs of storage-time
This page was built for publication: Simple proofs of space-time and rational proofs of storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181858)
