Fully homomorphic encryption: state of art and comparison
Fully homomorphic encryption (FHE) is an alternative of cryptography that allows evaluating arbitrary functions on encrypted data without the need for decryption of ciphertexts. In this article we present the state of the art of fully homomorphic encryption schemes. In particular we present a classi...
Gespeichert in:
Veröffentlicht in: | International journal of computer science and information security 2016-04, Vol.14 (4), p.159-159 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 159 |
---|---|
container_issue | 4 |
container_start_page | 159 |
container_title | International journal of computer science and information security |
container_volume | 14 |
creator | El-Yahyaoui, Ahmed Elkettani, Mohamed Dafir |
description | Fully homomorphic encryption (FHE) is an alternative of cryptography that allows evaluating arbitrary functions on encrypted data without the need for decryption of ciphertexts. In this article we present the state of the art of fully homomorphic encryption schemes. In particular we present a classification of several existent FHE schemes followed by a comparison of performances and complexity of these cryptosystems. Finally we will give different possible axes of research in the conclusion. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1815988739</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1815988739</sourcerecordid><originalsourceid>FETCH-LOGICAL-p619-e2e4a4ab3a53798fe7e7980dc337156750c0b9916045c73fca4f8d5440140f603</originalsourceid><addsrcrecordid>eNpdjs1qAyEYRaVQaEjzDkI32Qxo9fMnuxKathDIJvvBOEomODpVZ5G3r9Cueu_ibA6X-4BWVHPZARDyhDal3EgLoxworJA-LCHc8TVNrXm-jha7aPN9rmOKO1yqqQ4nj02u2MQB2zTNJo8lxWf06E0obvPHNTof3s_7z-54-vjavx27WVDduVfHDTcXZoBJrbyTroEMljFJQUgglly0poJwsJJ5a7hXA3BOKCdeELZG29_ZOafvxZXaT2OxLgQTXVpKTxUFrZRkuqkv_9RbWnJs53oqlQYumsl-AIeNT1U</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1789546598</pqid></control><display><type>article</type><title>Fully homomorphic encryption: state of art and comparison</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>El-Yahyaoui, Ahmed ; Elkettani, Mohamed Dafir</creator><creatorcontrib>El-Yahyaoui, Ahmed ; Elkettani, Mohamed Dafir</creatorcontrib><description>Fully homomorphic encryption (FHE) is an alternative of cryptography that allows evaluating arbitrary functions on encrypted data without the need for decryption of ciphertexts. In this article we present the state of the art of fully homomorphic encryption schemes. In particular we present a classification of several existent FHE schemes followed by a comparison of performances and complexity of these cryptosystems. Finally we will give different possible axes of research in the conclusion.</description><identifier>EISSN: 1947-5500</identifier><language>eng</language><publisher>Pittsburgh: L J S Publishing</publisher><subject>Algorithms ; Classification ; Cloud computing ; Computer information security ; Computer systems ; Cryptography ; Data encryption ; Encryption ; Mathematical analysis ; Mathematical models ; Mathematical problems ; Multiplication & division ; Network security ; Noise ; Public Key Infrastructure ; State of the art ; Virtual networks</subject><ispartof>International journal of computer science and information security, 2016-04, Vol.14 (4), p.159-159</ispartof><rights>Copyright L J S Publishing Apr 2016</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>El-Yahyaoui, Ahmed</creatorcontrib><creatorcontrib>Elkettani, Mohamed Dafir</creatorcontrib><title>Fully homomorphic encryption: state of art and comparison</title><title>International journal of computer science and information security</title><description>Fully homomorphic encryption (FHE) is an alternative of cryptography that allows evaluating arbitrary functions on encrypted data without the need for decryption of ciphertexts. In this article we present the state of the art of fully homomorphic encryption schemes. In particular we present a classification of several existent FHE schemes followed by a comparison of performances and complexity of these cryptosystems. Finally we will give different possible axes of research in the conclusion.</description><subject>Algorithms</subject><subject>Classification</subject><subject>Cloud computing</subject><subject>Computer information security</subject><subject>Computer systems</subject><subject>Cryptography</subject><subject>Data encryption</subject><subject>Encryption</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mathematical problems</subject><subject>Multiplication & division</subject><subject>Network security</subject><subject>Noise</subject><subject>Public Key Infrastructure</subject><subject>State of the art</subject><subject>Virtual networks</subject><issn>1947-5500</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpdjs1qAyEYRaVQaEjzDkI32Qxo9fMnuxKathDIJvvBOEomODpVZ5G3r9Cueu_ibA6X-4BWVHPZARDyhDal3EgLoxworJA-LCHc8TVNrXm-jha7aPN9rmOKO1yqqQ4nj02u2MQB2zTNJo8lxWf06E0obvPHNTof3s_7z-54-vjavx27WVDduVfHDTcXZoBJrbyTroEMljFJQUgglly0poJwsJJ5a7hXA3BOKCdeELZG29_ZOafvxZXaT2OxLgQTXVpKTxUFrZRkuqkv_9RbWnJs53oqlQYumsl-AIeNT1U</recordid><startdate>20160401</startdate><enddate>20160401</enddate><creator>El-Yahyaoui, Ahmed</creator><creator>Elkettani, Mohamed Dafir</creator><general>L J S Publishing</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160401</creationdate><title>Fully homomorphic encryption: state of art and comparison</title><author>El-Yahyaoui, Ahmed ; Elkettani, Mohamed Dafir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p619-e2e4a4ab3a53798fe7e7980dc337156750c0b9916045c73fca4f8d5440140f603</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Classification</topic><topic>Cloud computing</topic><topic>Computer information security</topic><topic>Computer systems</topic><topic>Cryptography</topic><topic>Data encryption</topic><topic>Encryption</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mathematical problems</topic><topic>Multiplication & division</topic><topic>Network security</topic><topic>Noise</topic><topic>Public Key Infrastructure</topic><topic>State of the art</topic><topic>Virtual networks</topic><toplevel>online_resources</toplevel><creatorcontrib>El-Yahyaoui, Ahmed</creatorcontrib><creatorcontrib>Elkettani, Mohamed Dafir</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer science and information security</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>El-Yahyaoui, Ahmed</au><au>Elkettani, Mohamed Dafir</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fully homomorphic encryption: state of art and comparison</atitle><jtitle>International journal of computer science and information security</jtitle><date>2016-04-01</date><risdate>2016</risdate><volume>14</volume><issue>4</issue><spage>159</spage><epage>159</epage><pages>159-159</pages><eissn>1947-5500</eissn><abstract>Fully homomorphic encryption (FHE) is an alternative of cryptography that allows evaluating arbitrary functions on encrypted data without the need for decryption of ciphertexts. In this article we present the state of the art of fully homomorphic encryption schemes. In particular we present a classification of several existent FHE schemes followed by a comparison of performances and complexity of these cryptosystems. Finally we will give different possible axes of research in the conclusion.</abstract><cop>Pittsburgh</cop><pub>L J S Publishing</pub><tpages>1</tpages></addata></record> |
fulltext | fulltext |
identifier | EISSN: 1947-5500 |
ispartof | International journal of computer science and information security, 2016-04, Vol.14 (4), p.159-159 |
issn | 1947-5500 |
language | eng |
recordid | cdi_proquest_miscellaneous_1815988739 |
source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | Algorithms Classification Cloud computing Computer information security Computer systems Cryptography Data encryption Encryption Mathematical analysis Mathematical models Mathematical problems Multiplication & division Network security Noise Public Key Infrastructure State of the art Virtual networks |
title | Fully homomorphic encryption: state of art and comparison |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T10%3A07%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fully%20homomorphic%20encryption:%20state%20of%20art%20and%20comparison&rft.jtitle=International%20journal%20of%20computer%20science%20and%20information%20security&rft.au=El-Yahyaoui,%20Ahmed&rft.date=2016-04-01&rft.volume=14&rft.issue=4&rft.spage=159&rft.epage=159&rft.pages=159-159&rft.eissn=1947-5500&rft_id=info:doi/&rft_dat=%3Cproquest%3E1815988739%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1789546598&rft_id=info:pmid/&rfr_iscdi=true |