A public key size homomorphic encryption scheme based on the sum of sparse subsets and integers

作者：Yang, Jing^*; Fan, Mingyu; Wang, Guangwei

来源：Cognitive Systems Research, 2018, 52: 543-549.

DOI：10.1016/j.cogsys.2018.07.011

• Full homomorphic encryption
• Batch processing
• Size of public key
• Ciphertext compression
• Quadric form

The paper proposes a homomorphic encryption scheme with public key size based on summation integer of sparse subset. The full-homomorphic encryption scheme that applies the batch processing technology to the integer can homomorphically process and encrypt a plaintext vector in a ciphertext to improve the efficiency of the original scheme, yet its size of the public key is (O) over tilde(lambda(8)). In an effort to reduce the size of public key for this scheme, we combine quadric form of public key elements and ciphertext compression to present SomeWhat homomorphic public key scheme, which reduces the security of public key scheme into the approximate integer GCD problem, thereby converting the homomorphic encryption scheme into full homomorphic encryption scheme. For the proposed homomorphic encryption scheme with public key size based on summation integer of sparse subset, the public key size for improve scheme is (O) over tilde(lambda(5.5)), a smaller size. Lastly, the scheme is proved to be semantically secure.

• 出版日期2018-12
• 单位电子科技大学