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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Symmetric Fully Homomorphic Encryption Scheme with Polynomials Operations


    Contributors:


    Publication date :

    2018-03-01


    Size :

    1411359 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Secure Signal Processing Using Fully Homomorphic Encryption

    Shortell, Thomas / Shokoufandeh, Ali | British Library Conference Proceedings | 2015


    Fully Homomorphic Encryption for Data Security Over Cloud

    Kumar, A Vijaya / Bhavana, Kollipara / Yamini, Cheedella | IEEE | 2022


    Homomorphic image encryption

    Elashry, I.F. / Allah, O.S.F. / Abbas, A.M. et al. | British Library Online Contents | 2009


    A Useful Homomorphic Encryption Method

    Micali, Silvio | DSpace@MIT | 2009

    Free access