Revisiting Fully Homomorphic Encryption Schemes

Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jain, Nimish, Cherukuri, Aswani Kumar
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jain, Nimish
Cherukuri, Aswani Kumar
description Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exchange, and financial transactions. The data is encrypted using a public key in homomorphic encryption, and the calculation is conducted on the encrypted data using an algorithm that retains the encryption. The computed result is then decrypted with a private key to acquire the final output. This abstract notion protects data while allowing complicated computations to be done on the encrypted data, resulting in a secure and efficient approach to analysing sensitive information. This article is intended to give a clear idea about the various fully Homomorphic Encryption Schemes present in the literature and analyse and compare the results of each of these schemes. Further, we also provide applications and open-source tools of homomorphic encryption schemes.
doi_str_mv 10.48550/arxiv.2305.05904
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2305_05904</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2305_05904</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-7ae41f20f188727cbd60211bc6f8f12bfa89111c1896a72f4fb255f56ca72eaf3</originalsourceid><addsrcrecordid>eNotzssKwjAUBNBsXIj6Aa7sD7Tmpnl1KeILBEHdlzTmaqCtJVWxf--TWQyzGQ4hY6AJ10LQqQlP_0hYSkVCRUZ5n0z37uFbf_P1OVrey7KL1tfqndBcvI0WtQ1dc_PXOjrYi6tcOyQ9NGXrRv8ekONycZyv4-1utZnPtrGRisfKOA7IKILWiilbnCRlAIWVqBFYgUZnAGBBZ9IohhwLJgQKad_LGUwHZPK7_YrzJvjKhC7_yPOvPH0BJak-BA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Revisiting Fully Homomorphic Encryption Schemes</title><source>arXiv.org</source><creator>Jain, Nimish ; Cherukuri, Aswani Kumar</creator><creatorcontrib>Jain, Nimish ; Cherukuri, Aswani Kumar</creatorcontrib><description>Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exchange, and financial transactions. The data is encrypted using a public key in homomorphic encryption, and the calculation is conducted on the encrypted data using an algorithm that retains the encryption. The computed result is then decrypted with a private key to acquire the final output. This abstract notion protects data while allowing complicated computations to be done on the encrypted data, resulting in a secure and efficient approach to analysing sensitive information. This article is intended to give a clear idea about the various fully Homomorphic Encryption Schemes present in the literature and analyse and compare the results of each of these schemes. Further, we also provide applications and open-source tools of homomorphic encryption schemes.</description><identifier>DOI: 10.48550/arxiv.2305.05904</identifier><language>eng</language><subject>Computer Science - Cryptography and Security</subject><creationdate>2023-05</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2305.05904$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2305.05904$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jain, Nimish</creatorcontrib><creatorcontrib>Cherukuri, Aswani Kumar</creatorcontrib><title>Revisiting Fully Homomorphic Encryption Schemes</title><description>Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exchange, and financial transactions. The data is encrypted using a public key in homomorphic encryption, and the calculation is conducted on the encrypted data using an algorithm that retains the encryption. The computed result is then decrypted with a private key to acquire the final output. This abstract notion protects data while allowing complicated computations to be done on the encrypted data, resulting in a secure and efficient approach to analysing sensitive information. This article is intended to give a clear idea about the various fully Homomorphic Encryption Schemes present in the literature and analyse and compare the results of each of these schemes. Further, we also provide applications and open-source tools of homomorphic encryption schemes.</description><subject>Computer Science - Cryptography and Security</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzssKwjAUBNBsXIj6Aa7sD7Tmpnl1KeILBEHdlzTmaqCtJVWxf--TWQyzGQ4hY6AJ10LQqQlP_0hYSkVCRUZ5n0z37uFbf_P1OVrey7KL1tfqndBcvI0WtQ1dc_PXOjrYi6tcOyQ9NGXrRv8ekONycZyv4-1utZnPtrGRisfKOA7IKILWiilbnCRlAIWVqBFYgUZnAGBBZ9IohhwLJgQKad_LGUwHZPK7_YrzJvjKhC7_yPOvPH0BJak-BA</recordid><startdate>20230510</startdate><enddate>20230510</enddate><creator>Jain, Nimish</creator><creator>Cherukuri, Aswani Kumar</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230510</creationdate><title>Revisiting Fully Homomorphic Encryption Schemes</title><author>Jain, Nimish ; Cherukuri, Aswani Kumar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-7ae41f20f188727cbd60211bc6f8f12bfa89111c1896a72f4fb255f56ca72eaf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Cryptography and Security</topic><toplevel>online_resources</toplevel><creatorcontrib>Jain, Nimish</creatorcontrib><creatorcontrib>Cherukuri, Aswani Kumar</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jain, Nimish</au><au>Cherukuri, Aswani Kumar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Revisiting Fully Homomorphic Encryption Schemes</atitle><date>2023-05-10</date><risdate>2023</risdate><abstract>Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exchange, and financial transactions. The data is encrypted using a public key in homomorphic encryption, and the calculation is conducted on the encrypted data using an algorithm that retains the encryption. The computed result is then decrypted with a private key to acquire the final output. This abstract notion protects data while allowing complicated computations to be done on the encrypted data, resulting in a secure and efficient approach to analysing sensitive information. This article is intended to give a clear idea about the various fully Homomorphic Encryption Schemes present in the literature and analyse and compare the results of each of these schemes. Further, we also provide applications and open-source tools of homomorphic encryption schemes.</abstract><doi>10.48550/arxiv.2305.05904</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2305.05904
ispartof
issn
language eng
recordid cdi_arxiv_primary_2305_05904
source arXiv.org
subjects Computer Science - Cryptography and Security
title Revisiting Fully Homomorphic Encryption Schemes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A52%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Revisiting%20Fully%20Homomorphic%20Encryption%20Schemes&rft.au=Jain,%20Nimish&rft.date=2023-05-10&rft_id=info:doi/10.48550/arxiv.2305.05904&rft_dat=%3Carxiv_GOX%3E2305_05904%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true