Static analysis with Set-Closure in secrecy

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report that the homomorphic encryption scheme can unleash the possibility of static analysis of encrypted programs. Static analysis in cipher-world is desirable in the static-analysis-as-a-service setting, because it allows the program owners to encrypt and upload their programs to the static analysis service while the service provider can still analyze the encrypted programs without decrypting them. Only the owner of the decryption key (the program owner) is able to decrypt the analysis result. As a concrete example, we describe how to perform a pointer analysis in secrecy. In our method, a somewhat homomorphic encryption scheme of depth O(logm) is able to evaluate a simple pointer analysis with O(logm) homomorphic matrix multiplications, for the number m of pointer variables when the maximal pointer level is bounded. We also demonstrate the viability of our method by implementing the pointer analysis in secrecy.

Cite

CITATION STYLE

APA

Lee, W., Hong, H., Yi, K., & Cheon, J. H. (2015). Static analysis with Set-Closure in secrecy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9291, pp. 18–35). Springer Verlag. https://doi.org/10.1007/978-3-662-48288-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free