Skip to main content

Secure Distributed Computing in a Commercial Environment

  • Conference paper
  • First Online:
Financial Cryptography (FC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2339))

Included in the following conference series:

Abstract

The recent successes of a number of nonprofit computing projects distributed over the Internet has generated intense interest in the potential commercial applications of distributed computing. In a commercial setting, where participants might be paid for their contributions, it is crucial to define a security framework to address the threat of cheating and offer guarantees that the computation has been correctly executed. This paper defines and analyzes such a security framework predicated on the assumption that participants are motivated by financial gain. We propose a scheme which deters participants from claiming credit for work they have not done, and puts a high cost on attempts to disrupt the computation. We achieve these two goals by integrating an algorithm to assign computations to participants, an algorithm to verify their work, and an algorithm to pay participants.

Supported by Stanford Graduate Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Blum and S. Kannan. Programs that Check their Work. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 1989.

    Google Scholar 

  2. M. Blum and H. Wasserman. Software reliability via run-time result-checking. In Journal of the ACM, vol. 44, no. 6, pp. 826–849, November 1997.

    Article  MathSciNet  Google Scholar 

  3. J. Cai, R. Lipton, R. Sedgewick, and A. Yao. Towards uncheatable benchmarks. In Proceedings of the 8th Annual Structure in Complexity Theory Conference, pp. 2–11, 1993.

    Google Scholar 

  4. CNET News.com. Buddy, can you spare some processing time? CNET Networks, Inc. 150 Chestnut Street San Francisco, CA 94111. http://news.cnet.com/news/0-1003-200-2671550.html.

  5. Joan Feigenbaum. Encrypting problem instances: Or..., Can you take advantage of someone without having to trust him? In Proceedings of CRYPTO’85, pages 477–488. Lecture Notes in Computer Science, No. 218.

    Google Scholar 

  6. P. Golle and I. Mironov. Uncheatable Distributed Computations. To appear in Proceedings of the RSA Conference 2001, Cryptographers’ Track.

    Google Scholar 

  7. Fritz Hohl. An Approach to Solve the Problem of Malicious Hosts. Technical Report TR-1997-03, Universitat Stuttgart, Fakultat Informatik, Germany, March 1997.

    Google Scholar 

  8. M. Jakobson and A. Juels. Proofs of work and bread pudding protocols. In Proceedings of the 1999 Communications and Multimedia Security Conference.

    Google Scholar 

  9. Y. Minsky, R. van Renesse, F. Schneider, and S. Stoller. Cryptographic Support for Fault-Tolerant Distributed Computing. In Proceedings of the First ACM Conference on Computer and Communications Security, Nov. 1993.

    Google Scholar 

  10. F. Monrose, P. Wyckoff, and A. Rubin. Distributed Execution with Remote Audit. In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, pages 103–113, 1999.

    Google Scholar 

  11. H. Rheingold. You got the power. In Wired magazine, August, 2000.

    Google Scholar 

  12. The Search for Extraterrestrial Intelligence project. University of California, Berkeley. http://setiathome.berkeley.edu.

  13. G. Vigna. Protecting Mobile Agents through Tracing. In Proceedings of the 3rd Workshop on Mobile Object Systems, June 1997.

    Google Scholar 

  14. A. Yao. Protocols for Secure Computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pages 160–164.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golle, P., Stubblebine, S. (2002). Secure Distributed Computing in a Commercial Environment. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-46088-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44079-6

  • Online ISBN: 978-3-540-46088-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics