A Smart Contract Refereed Data Retrieval Protocol with a Provably Low Collateral Requirement

We present a protocol for a cryptoeconomic fair exchange of data previously owned by the purchaser for tokens that functions even when both parties are anonymous. This enables peer-to-peer data storage without identity verification. We use a smart contract on a decentralized ledger as a trusted third party. Actual data transfer can take place with any standard anonymous exchange channel. Due to the anonymity of the parties, the smart contract cannot punish either party’s off-ledger reputation. Furthermore, the contract has limited power to arbitrate fault in off-ledger disputes. Thus, an important feature of our protocol is a collateral mechanism that collectively punishes both Alice and Bob if either of them abandons the protocol or cheats. However, we prove that parameters can be chosen such that the collateral can be made, subject to data size, arbitrarily low and still result in an expected financial loss if either Alice or Bob cheats. We are able to achieve this due to our non-standard use of error-correcting codes. In addition, the protocol allows those storing the data to exchange it without the client’s participation.

[1]  Satoshi Nakamoto Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[2]  Yuto Lim,et al.  A survey on Proof of Retrievability for cloud data integrity and availability: Cloud storage state-of-the-art, issues, solutions and future trends , 2018, J. Netw. Comput. Appl..

[3]  Henning Pagnia,et al.  On the Impossibility of Fair Exchange without a Trusted Third Party , 1999 .

[4]  Stefan Dziembowski,et al.  FairSwap: How To Fairly Exchange Digital Goods , 2018, IACR Cryptol. ePrint Arch..

[5]  W. Güth,et al.  An experimental analysis of ultimatum bargaining , 1982 .

[6]  Franz J. Hauck,et al.  Design of a Privacy-Preserving Decentralized File Storage with Financial Incentives , 2017, 2017 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW).

[7]  Ralph C. Merkle,et al.  A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.

[8]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.

[9]  Lidong Chen,et al.  Recommendation for Key Derivation Using Pseudorandom Functions (Revised) , 2009 .

[10]  T. Elgamal A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[11]  Moni Naor,et al.  The complexity of online memory checking , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[12]  Khaled Salah,et al.  Proof of Delivery of Digital Assets Using Blockchain and Smart Contracts , 2018, IEEE Access.

[13]  Michael Burrows,et al.  A Cooperative Internet Backup Scheme , 2003, USENIX Annual Technical Conference, General Track.

[14]  Ido Kaiser A Decentralized Private Marketplace: DRAFT 0.1 , 2017 .

[15]  Victor Shoup,et al.  A Proposal for an ISO Standard for Public Key Encryption , 2001, IACR Cryptol. ePrint Arch..

[16]  Richard Holden,et al.  Can Blockchain Solve the Holdup Problem in Contracts? , 2017 .

[17]  S. Wicker Error Control Systems for Digital Communication and Storage , 1994 .

[18]  Karen A. Scarfone,et al.  Blockchain Technology Overview , 2018, ArXiv.

[19]  Shawn Wilkinson,et al.  Storj A Peer-to-Peer Cloud Storage Network , 2014 .

[20]  Nick Szabo,et al.  Formalizing and Securing Relationships on Public Networks , 1997, First Monday.

[21]  NaorMoni,et al.  The complexity of online memory checking , 2009 .

[22]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[23]  Elaine B. Barker,et al.  Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography , 2007 .

[24]  James S. Plank,et al.  Erasure Codes for Storage Systems: A Brief Primer , 2013, login Usenix Mag..