Efficient RAM and Control Flow in Verifiable Outsourced Computation

Riad S. Wahby, Srinath Setty, Zuocheng Ren, Andrew J. Blumberg, Michael Walfish

Research output: Contribution to conferencePaperpeer-review


Recent work on proof-based verifiable computation has resulted in built systems that employ tools from complexity theory and cryptography to address a basic problem in systems security: allowing a local computer to outsource the execution of a program while providing the local computer with a guarantee of integrity and the remote computer with a guarantee of privacy. However, support for programs that use RAM and control flow has been problematic. State of the art systems either restrict the use of these constructs (e.g., requiring static loop bounds), incur sizeable overhead on every step, or pay tremendous costs when the constructs are invoked. This paper describes Buffet, a built system that solves these problems by providing inexpensive “a la carte” RAM and dynamic control flow. Buffet composes an elegant prior approach to RAM with a novel adaptation of techniques from the compilers literature. Buffet allows the programmer to express programs in an expansive subset of C (disallowing only “goto” and function pointers), can handle essentially any example in the verifiable computation literature, and achieves the best performance in the area by multiple orders of magnitude.

Original languageEnglish (US)
StatePublished - 2015
Event22nd Annual Network and Distributed System Security Symposium, NDSS 2015 - San Diego, United States
Duration: Feb 8 2015Feb 11 2015


Conference22nd Annual Network and Distributed System Security Symposium, NDSS 2015
Country/TerritoryUnited States
CitySan Diego

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Efficient RAM and Control Flow in Verifiable Outsourced Computation'. Together they form a unique fingerprint.

Cite this