Paper Info
Title
Proofs of Space-Time and Rational Proofs of Storage.
Abstract
We introduce a new cryptographic primitive: Proofs of SpaceTime (PoSTs) and construct a practical protocol for implementing these proofs. A PoST allows a prover to convince a verifier that she spent a “spacetime” resource (storing data—space—over a period of time). Formally, we define the PoST resource as a linear tradeoff between CPU work and space-time (under reasonable cost assumptions, a rational user will prefer to use the lower-cost space-time resource over CPU work). Compared to a proof-of-work, a PoST requires less energy use, as the “difficulty” can be increased by extending the time period over which data is stored without increasing computation costs. Our definition is very similar to “Proofs of Space” [ePrint 2013/796, 2013/805] but, unlike the previous definitions, takes into account amortization attacks and storage duration. Moreover, our protocol uses a very different (and simpler) technique, making use of the fact that we explicitly allow a space-time tradeoff.
Year
Venue
Field
2016
IACR Cryptology ePrint Archive
Space time,Eprint,Computer science,Proofs involving the addition of natural numbers,Spacetime,Theoretical computer science,Cryptographic primitive,Mathematical proof,Gas meter prover,Computation
DocType
Volume
Citations 
Journal
2016
3
PageRank 
References 
Authors
0.55
12
2
Name
Order
Citations
PageRank
Tal Moran143925.36
Ilan Orlov2654.52