Proofs of Space-Time and Rational Proofs of Storage.
作者： Ilan Orlov , Tal Moran
DOI:
关键词:
摘要: We introduce a new cryptographic primitive: Proofs of SpaceTime (PoSTs) and construct practical protocol for implementing these proofs. A PoST allows prover to convince verifier that she spent “spacetime” resource (storing data—space—over period time). Formally, we define the as linear tradeoff between CPU work space-time (under reasonable cost assumptions, rational user will prefer use lower-cost over work). Compared proof-of-work, requires less energy use, “difficulty” can be increased by extending time which data is stored without increasing computation costs. Our definition very similar “Proofs Space” [ePrint 2013/796, 2013/805] but, unlike previous definitions, takes into account amortization attacks storage duration. Moreover, our uses different (and simpler) technique, making fact explicitly allow tradeoff.
参考文章(15)
Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi, Proofs of Space: When Space Is of the Essence international conference on security and cryptography. pp. 538- 557 ,(2014) , 10.1007/978-3-319-10879-7_31
Cynthia Dwork, Moni Naor, Pricing via Processing or Combatting Junk Mail international cryptology conference. pp. 139- 147 ,(1992) , 10.1007/3-540-48071-4_10
Cynthia Dwork, Andrew Goldberg, Moni Naor, On Memory-Bound Functions for Fighting Spam Advances in Cryptology - CRYPTO 2003. pp. 426- 444 ,(2003) , 10.1007/978-3-540-45146-4_25
Andrew Miller, Ari Juels, Elaine Shi, Bryan Parno, Jonathan Katz, Permacoin: Repurposing Bitcoin Work for Data Preservation ieee symposium on security and privacy. pp. 475- 490 ,(2014) , 10.1109/SP.2014.37
Kevin D. Bowers, Ari Juels, Alina Oprea, Proofs of retrievability: theory and implementation ieee international conference on cloud computing technology and science. pp. 43- 54 ,(2009) , 10.1145/1655008.1655015
Joël Alwen, Vladimir Serbinenko, High Parallel Complexity Graphs and Memory-Hard Functions symposium on the theory of computing. pp. 595- 603 ,(2015) , 10.1145/2746539.2746622
Ari Juels, Burton S. Kaliski, Pors: proofs of retrievability for large files computer and communications security. pp. 584- 597 ,(2007) , 10.1145/1315245.1315317
Brent Waters, Ari Juels, J. Alex Halderman, Edward W. Felten, New client puzzle outsourcing techniques for DoS resistance computer and communications security. pp. 246- 256 ,(2004) , 10.1145/1030083.1030117
Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary Peterson, Dawn Song, Provable data possession at untrusted stores computer and communications security. pp. 598- 609 ,(2007) , 10.1145/1315245.1315318
Philippe Golle, Stanislaw Jarecki, Ilya Mironov, Cryptographic primitives enforcing communication and storage complexity financial cryptography. ,vol. 2357, pp. 120- 135 ,(2002) , 10.1007/3-540-36504-4_9