Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Towards an interpreter for efficient encrypted computation

Towards an interpreter for efficient encrypted computation

Thumbnail Image
Download
Name

Devadas_Towards an.pdf

Size

1017.82 KB

Format

Adobe PDF

Checksum (MD5)

1ef79cd56ab67bbdecc03dd0180dde5b

Author(s)
Devadas, Srinivas
•
Fletcher, Christopher Wardlaw
•
Van Dijk, Marten
Date Issued
October 2012
Journal
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop (CCSW '12)
Publisher
Association for Computing Machinery (ACM)
Citation
Christopher W. Fletcher, Marten van Dijk, and Srinivas Devadas. 2012. Towards an interpreter for efficient encrypted computation. In Proceedings of the 2012 ACM Workshop on Cloud computing security workshop (CCSW '12). ACM, New York, NY, USA, 83-94.
Version
Author's final manuscript
Abstract
Fully homomorphic encryption (FHE) techniques 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 Turing-complete instruction set can be executed with encrypted data and point out inefficiencies in this methodology. We then provide examples of scheduling (a) the greatest common divisor (GCD) problem using Euclid's algorithm and (b) the 3-Satisfiability (3SAT) problem 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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/86170
DOI of Published Version
https://doi.org/10.1145/2381913.2381928
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.