Paper 2014/374

Optimal Contracts for Outsourced Computation

Viet Pham, MHR. Khouzani, and Carlos Cid

Abstract

While expensive cryptographically verifiable computation aims at defeating malicious agents, many civil purposes of outsourced computation tolerate a weaker notion of security, i.e., ``lazy-but-honest'' contractors. Targeting this type of agents, we develop optimal contracts for outsourcing of computational tasks via appropriate use of rewards, punishments, auditing rate, and ``redundancy''. Our contracts provably minimize the expense of the outsourcer (principal) while guaranteeing correct computation. Furthermore, we incorporate practical restrictions of the maximum enforceable fine, limited and/or costly auditing, and bounded budget of the outsourcer. By examining the optimal contracts, we provide insights on how resources should be utilized when auditing capacity and enforceability are limited. Finally, we present a light-weight cryptographic implementation of the contracts and discuss a comparison across different implementations of auditing in outsourced computation.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
Keywords
game theoryoutsourced computationcontract design
Contact author(s)
viet pham 2010 @ live rhul ac uk
History
2014-05-27: received
Short URL
https://ia.cr/2014/374
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/374,
      author = {Viet Pham and MHR.  Khouzani and Carlos Cid},
      title = {Optimal Contracts for Outsourced Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2014/374},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/374}},
      url = {https://eprint.iacr.org/2014/374}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.