Proofs of space
From MaRDI portal
Recommendations
Cites work
- A cryptanalytic time-memory trade-off
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Computationally Sound Proofs
- Cryptographic primitives enforcing communication and storage complexity
- Formalizing human ignorance
- Key-evolution schemes resilient to space-bounded leakage
- Mitigating Dictionary Attacks on Password-Protected Local Storage
- On Time Versus Space
- One-time computable self-erasing functions
- Pebbling and Proofs of Work
- Secure Code Update for Embedded Devices via Proofs of Secure Erasure
- Universal Arguments and their Applications
Cited in
(48)- Static-memory-hard functions, and modeling the cost of space vs. time
- Simple proofs of sequential work
- Proofs of Work from worst-case assumptions
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- CArrency: an energy-efficient proof-of-work scheme for crypto-currencies
- Non-interactive proofs of proof-of-work
- Proof-of-burn
- Minting mechanism for proof of stake blockchains
- Tight proofs of space and replication
- Proofs of space: when space is of the essence
- Indistinguishable proofs of work or knowledge
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Cryptographic primitives enforcing communication and storage complexity
- Proof of space from stacked expanders
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Specifying and Verifying Properties of Space
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
- Proofs of Catalytic Space
- Resource Burning for Permissionless Systems (Invited Paper)
- Depth-robust graphs and their cumulative memory complexity
- Scrypt is maximally memory-hard
- Pebbling and Proofs of Work
- On the application of clique problem for proof-of-work in cryptocurrencies
- Consensus in Data Management: From Distributed Commit to Blockchain
- An incremental PoSW for general weight distributions
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Permissionless and asynchronous asset transfer
- A comprehensive review on blockchains for Internet of Vehicles: challenges and directions
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Individual cryptography
- On elapsed time consensus protocols
- Decentralizing information technology: the advent of resource based systems
- Answers in search of a question: `proofs' of the tri-dimensionality of space
- stoRNA: stateless transparent proofs of storage-time
- SNACKs for proof-of-space blockchains
- Defending hash tables from algorithmic complexity attacks with resource burning
- PURED: a unified framework for resource-hard functions
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Fully automated selfish mining analysis in efficient proof systems blockchains
- Subverting cryptographic hardware used in blockchain consensus
- A new connection between node and edge depth robust graphs
- Space-deniable proofs
- Provably memory-hard proofs of work with memory-easy verification
- Universally composable succinct vector commitments and applications
- Lower bounding update frequency in short accumulators and vector commitments
- Unlocking potential: a review of blockchain and Artificial Intelligence integration
This page was built for publication: Proofs of space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457086)
