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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Symmetric Fully Homomorphic Encryption Scheme with Polynomials Operations


    Beteiligte:
    Aganya, Kavita (Autor:in) / Sharma, Iti (Autor:in)


    Erscheinungsdatum :

    01.03.2018


    Format / Umfang :

    1411359 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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


    H3PC: Enhanced Security and Privacy-Preserving Platoon Construction Based on Fully Homomorphic Encryption

    Chah, Badreddine / Lombard, Alexandre / Bkakria, Anis et al. | IEEE | 2023



    Preserving Data Privacy in Cloud using Homomorphic Encryption

    Murthy, Shrujana / C.R., Kavitha | IEEE | 2019