Towards an interpreter for efficient encrypted computation

Christopher Fletcher, Marten Van Dijk, Srinivas Devadas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Fully homomorphic encryption FHEtechniques are capable of performing encrypted computation on Boolean circuits, i.e., the user specifies encrypted inputs to the program, and the server computes on the encrypted inputs. Applying these techniques to general programs with recursive procedures and data-dependent loops has not been a focus of attention. In this paper, we take a first step toward building an interpreter that, given programs with complex control flow, schedules efficient code suitable for the application of FHE schemes. We first describe how programs written in a small Turingcomplete instruction set can be executed with encrypted data and point out inefficiencies in this methodology. We then provide examples of scheduling athe greatest common divisor GCD problem using Euclid's algorithm and bthe 3-Satisfiability 3SATproblem using a recursive backtracking algorithm into path-levelized FHE computations. We describe how path levelization reduces control flow ambiguity and improves encrypted computation efficiency. Using these techniques and data-dependent loops as a starting point, we then build support for hierarchical programs made up of phases, where each phase corresponds to a fixed point computation that can be used to further improve the efficiency of encrypted computation. In our setting, the adversary learns an estimate of the number of steps required to complete the computation, which we show is the least amount of leakage possible.

Original languageEnglish (US)
Title of host publicationCCSW'12 - Proceedings of the Cloud Computing Security Workshop
Pages83-94
Number of pages12
DOIs
StatePublished - Nov 27 2012
Externally publishedYes
Event2012 ACM Workshop on Cloud Computing Security Workshop, CCSW 2012 - Raleigh, NC, United States
Duration: Oct 19 2012Oct 19 2012

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Other

Other2012 ACM Workshop on Cloud Computing Security Workshop, CCSW 2012
CountryUnited States
CityRaleigh, NC
Period10/19/1210/19/12

Keywords

  • Code interpreters
  • Encrypted computation
  • Fully homomorphic encryption

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Towards an interpreter for efficient encrypted computation'. Together they form a unique fingerprint.

  • Cite this

    Fletcher, C., Van Dijk, M., & Devadas, S. (2012). Towards an interpreter for efficient encrypted computation. In CCSW'12 - Proceedings of the Cloud Computing Security Workshop (pp. 83-94). (Proceedings of the ACM Conference on Computer and Communications Security). https://doi.org/10.1145/2381913.2381928