C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” Proceedings of the 41st Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2009, pp. 169-178.

has been cited by the following article:

• TITLE: Simulation Study Based on Somewhat Homomorphic Encryption

  AUTHORS: Jing Yang, Mingyu Fan, Guangwei Wang, Zhiyin Kong

  KEYWORDS: Somewhat Homomorphic Encryption; Simulation; Clear Text Length; Ciphertext Length

  JOURNAL NAME: Journal of Computer and Communications, Vol.2 No.2, January 10, 2014

  ABSTRACT: At present study, homomorphic encryption scheme is most focusing on algorithm efficiency and security and the rare for homomorphic encryption simulation research. This paper for the Gentry’s Somewhat Homomorphic Encryption scheme for the simulation research, in clear text size within a certain range simulation was Somewhat Homomorphic Encryption scheme, and presents the relationship between the length of plaintext and ciphertext size.