Simple proofs of sequential work
From MaRDI portal
Publication:1648847
DOI10.1007/978-3-319-78375-8_15zbMATH Open1428.94067OpenAlexW2795301572MaRDI QIDQ1648847FDOQ1648847
Authors: Bram Cohen, Krzysztof Pietrzak 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_15
Recommendations
Cited In (32)
- stoRNA: stateless transparent proofs of storage-time
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- uMmine: a blockchain based on human miners
- Simple verifiable delay functions
- SNACKs for proof-of-space blockchains
- Indistinguishable proofs of work or knowledge
- Time-release cryptography from minimal circuit assumptions
- (Verifiable) delay functions from Lucas sequences
- Pebbling and Proofs of Work
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- An incremental PoSW for general weight distributions
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Non-interactive proofs of proof-of-work
- Proof-of-burn
- Continuous verifiable delay functions
- Lattice-based timed cryptography
- PURED: a unified framework for resource-hard functions
- Practical statistically-sound proofs of exponentiation in any group
- Short-lived zero-knowledge proofs and signatures
- Quadratically sound proof-of-sequential-work
- Generic-group delay functions require hidden-order groups
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Proofs of Work from worst-case assumptions
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- Incremental proofs of sequential work
- Reversible proofs of sequential work
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- On sequential functions and fine-grained cryptography
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Publicly verifiable proofs of sequential work
This page was built for publication: Simple proofs of sequential work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648847)
