Simple proofs of sequential work

DOI10.1007/978-3-319-78375-8_15zbMath1428.94067OpenAlexW2795301572MaRDI QIDQ1648847

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

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

Related Items (12)

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) ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Lattice-based timed cryptography ⋮ Continuous verifiable delay functions ⋮ Generic-group delay functions require hidden-order groups ⋮ On the compressed-oracle technique, and post-quantum security of proofs of sequential work ⋮ Simple verifiable delay functions ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

This page was built for publication: Simple proofs of sequential work