Abstract
Feasible homomorphic encryption schemes are being proposed in literature regularly, yet the message space is very restricted or limited. This makes the existing schemes costly to adopt for practical use where data is too large. This paper proposes a homomorphic encryption scheme that has very large message space. Polynomials are used to assemble chunks of data and encrypt them. The coefficients of polynomials are the encrypted messages. Addition and multiplication of the polynomials are the homomorphic functions to achieve functions on messages. Decryption and Refresh Primitives consists of single mathematical operations, which makes them fast. This meets the requirement of a feasible FHE.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
