Compilation Techniques for Efficient Encrypted Computation

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, the authors take a first step toward building a compiler that, given programs with complex control flow, generates efficient code suitable for the application of FHE schemes.

Provided by: International Association for Cryptologic Research Topic: Security Date Added: May 2012 Format: PDF

Find By Topic