Addressing the trust asymmetry problem in grid computing with encrypted computation

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

Trust asymmetry is a core, albeit rarely discussed, problem in scalable computing. Techniques for protecting a host's operating system (and other processes) from a user's process are well understood and widely deployed. However, there is currently no way to protect the user's process from the OS. Hence, while the host's owner need not trust the user at all, the user must trust the owner completely. This, we argue, leads to practical limits to scalability for computation that, because of encryption, simply do not exist for communication. We argue that it is imperative for the grid computing community to address this problem using encrypted computation techniques. We then propose a simple mechanism for encrypted computation of Boolean circuits and show how it can likely be generalized for use in an object code translator.

Original languageEnglish (US)
DOIs
StatePublished - Dec 1 2004
Event7th Workshop on Languages, Compilers, and Run-Time Support for Scalable Systems, LCR '04 - Houston, TX, United States
Duration: Oct 22 2004Oct 23 2004

Other

Other7th Workshop on Languages, Compilers, and Run-Time Support for Scalable Systems, LCR '04
CountryUnited States
CityHouston, TX
Period10/22/0410/23/04

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Addressing the trust asymmetry problem in grid computing with encrypted computation'. Together they form a unique fingerprint.

  • Cite this

    Dinda, P. A. (2004). Addressing the trust asymmetry problem in grid computing with encrypted computation. Paper presented at 7th Workshop on Languages, Compilers, and Run-Time Support for Scalable Systems, LCR '04, Houston, TX, United States. https://doi.org/10.1145/1066650.1066656