Small, Stupid, and Scalable: Secure Computing With Faerieplay

Free registration required

Executive Summary

How can Agnes trust a computation C occurring at Boris's computer? In particular, how can Agnes trust that C is occurring without Boris even being able to observe its internal state? One way is for Agnes to house C in a strong tamper-protected secure coprocessor at Boris's site. However, this approach is not scalable: neither in terms of computation - once C gets larger than the coprocessor, it becomes vulnerable to Boris again - nor in terms of cost. In this paper, the authors report on the Faerieplay project: rather than worrying about the limited size of a secure coprocessor, they try to make it as small as possible, with limited RAM and CPU.

  • Format: PDF
  • Size: 487.2 KB