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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.