Publicly verifiable proofs of sequential work

Abstract

We construct a publicly verifiable protocol for proving computational work based on collision-resistant hash functions and a new plausible complexity assumption regarding the existence of "inherently sequential" hash functions. Our protocol is based on a novel construction of time-lock puzzles. Given a sampled "puzzle" P getsr D<sub>n</sub>, where $n$ is… (More)
DOI: 10.1145/2422436.2422479

Statistics

050100150201520162017
Citations per Year

Citation Velocity: 38

Averaging 38 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Mahmoody2013PubliclyVP, title={Publicly verifiable proofs of sequential work}, author={Mohammad Mahmoody and Tal Moran and Salil P. Vadhan}, booktitle={ITCS}, year={2013} }