A public key size homomorphic encryption scheme based on the sum of sparse subsets and integers. (December 2018)

• Record Type: Journal Article
• Authors: Yang, Jing; Fan, Mingyu; Wang, Guangwei
• Is Part Of: Cognitive systems research. Volume 52(2018)
• Page Start: 543
• Page End: 549
• Publication Date: 2018-12
• Subjects: Full homomorphic encryption -- Batch processing -- Size of public key -- Ciphertext compression -- Quadric form; Cognition -- Periodicals; Cognitive engineering (System design) -- Periodicals; Artificial intelligence -- Periodicals; 153.05
• DOI: 10.1016/j.cogsys.2018.07.011
• Languages: English
• ISSNs: 1389-0417

Abstract

Abstract: 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 ̃ ( λ 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 ̃ ( λ 5.5 ), a smaller size. Lastly, the scheme is proved to be semantically secure.