Name
Abstract | ||
|---|---|---|
Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving a statement chi and a time parameter T computes a proof phi(chi, T) which is efficiently and publicly verifiable. The proof can be computed in T sequential steps, but not much less, even by a malicious party having large parallelism. A PoSW thus serves as a proof that T units of time have passed since chi was received. PoSW were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical construction was only recently proposed by Cohen and Pietrzak [CP18]. In this work we construct a new simple PoSW in the random permutation model which is almost as simple and efficient as [CP18] but conceptually very different. Whereas the structure underlying [CP18] is a hash tree, our construction is based on skip lists and has the interesting property that computing the PoSW is a reversible computation. The fact that the construction is reversible can potentially be used for new applications like constructing proofs of replication. We also show how to "embed" the sloth function of Lenstra and Weselowski [LW17] into our PoSW to get a PoSW where one additionally can verify correctness of the output much more efficiently than recomputing it (though recent constructions of "verifiable delay functions" subsume most of the applications this construction was aiming at). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-17656-3_10 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT II |
Field | DocType | Volume |
Discrete mathematics,Computer science,Verifiable secret sharing,Mathematical proof,Unit of time,Gas meter prover | Journal | 11477 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamza Abusalah | 1 | 3 | 1.74 |
| Chethan Kamath | 2 | 23 | 5.50 |
| Karen Klein | 3 | 1 | 0.69 |
| Krzysztof Pietrzak | 4 | 1513 | 72.60 |
| Michael Walter | 5 | 111 | 10.36 |