Simple proofs of sequential work

DOI10.1007/978-3-319-78375-8_15MaRDI QIDQ1648847zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Incremental proofs of sequential work
• Publicly verifiable proofs of sequential work
• Reversible proofs of sequential work
• Proofs of space
• Proofs of Work from worst-case assumptions

Cited in

(34)

• PURED: a unified framework for resource-hard functions
• Indistinguishable proofs of work or knowledge
• Continuous verifiable delay functions
• Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
• On sequential functions and fine-grained cryptography
• stoRNA: stateless transparent proofs of storage-time
• 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)
• Practical statistically-sound proofs of exponentiation in any group
• Generic-group delay functions require hidden-order groups
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• On the (im)possibility of time-lock puzzles in the quantum random oracle model
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• Short-lived zero-knowledge proofs and signatures
• Incremental proofs of sequential work
• Proof of necessary work: succinct state verification with fairness guarantees
• SNACKs for proof-of-space blockchains
• Verifiable isogeny walks: towards an isogeny-based postquantum VDF
• An incremental PoSW for general weight distributions
• Time-release cryptography from minimal circuit assumptions
• Non-interactive proofs of proof-of-work
• Proof-of-burn
• Proofs of Work from worst-case assumptions
• Publicly verifiable proofs of sequential work
• On the security of proofs of sequential work in a post-quantum world
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• Reversible proofs of sequential work
• Quadratically sound proof-of-sequential-work
• An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
• uMmine: a blockchain based on human miners
• Lattice-based timed cryptography
• Simple verifiable delay functions
• (Verifiable) delay functions from Lucas sequences
• Pebbling and Proofs of 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)