A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes
Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bot...
Gespeichert in:
| Veröffentlicht in: | Security and communication networks 2018-01, Vol.2018 (2018), p.1-14 |
|---|---|
| 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 | 14 |
|---|---|
| container_issue | 2018 |
| container_start_page | 1 |
| container_title | Security and communication networks |
| container_volume | 2018 |
| creator | Wang, Xun Li, Jianfeng Luo, Tao |
| description | Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level. |
| doi_str_mv | 10.1155/2018/8706940 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2455785808</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2455785808</sourcerecordid><originalsourceid>FETCH-LOGICAL-c290t-c75237f03ae862f1e1e4f848c2a41bad522d8bd3f04a4165c5b1b6b3cd38cc9b3</originalsourceid><addsrcrecordid>eNqF0M9LwzAUB_AgCs7pzbMEPGpdfrbpce6nsKEwxWNI84N1bG1NOmT_vRkdepR3yHsvHxL4AnCL0RPGnA8IwmIgMpTmDJ2BHs5pniBMyPlvj9kluAphg1CKWcZ64G0Il7W3cOJcqUtbtXC6324PcF7vYvlmXWo4qbQ_NG1ZV3Cl13Zn4bMK1sA4z1afUFUGjpenq3ANLpzaBntzOvvgYzp5H82TxevsZTRcJJrkqE10xgnNHKLKipQ4bLFlTjChiWK4UIYTYkRhqEMsLlKueYGLtKDaUKF1XtA-uO_ebXz9tbehlZt676v4pSSM80xwgURUj53Svg7BWycbX-6UP0iM5DEzecxMnjKL_KHj67Iy6rv8T9912kZjnfrTBDPGc_oDgYNzsw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455785808</pqid></control><display><type>article</type><title>A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes</title><source>Wiley-Blackwell Open Access Titles</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Wang, Xun ; Li, Jianfeng ; Luo, Tao</creator><contributor>Hu, Jiankun ; Jiankun Hu</contributor><creatorcontrib>Wang, Xun ; Li, Jianfeng ; Luo, Tao ; Hu, Jiankun ; Jiankun Hu</creatorcontrib><description>Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level.</description><identifier>ISSN: 1939-0114</identifier><identifier>EISSN: 1939-0122</identifier><identifier>DOI: 10.1155/2018/8706940</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Algorithms ; Data encryption ; Efficiency ; Encryption ; Gates (circuits) ; Low level ; Mathematical analysis ; Matrix algebra ; Matrix methods ; Noise ; Privacy</subject><ispartof>Security and communication networks, 2018-01, Vol.2018 (2018), p.1-14</ispartof><rights>Copyright © 2018 Xun Wang et al.</rights><rights>Copyright © 2018 Xun Wang et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c290t-c75237f03ae862f1e1e4f848c2a41bad522d8bd3f04a4165c5b1b6b3cd38cc9b3</citedby><cites>FETCH-LOGICAL-c290t-c75237f03ae862f1e1e4f848c2a41bad522d8bd3f04a4165c5b1b6b3cd38cc9b3</cites><orcidid>0000-0002-7390-6722 ; 0000-0003-4870-5942</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><contributor>Hu, Jiankun</contributor><contributor>Jiankun Hu</contributor><creatorcontrib>Wang, Xun</creatorcontrib><creatorcontrib>Li, Jianfeng</creatorcontrib><creatorcontrib>Luo, Tao</creatorcontrib><title>A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes</title><title>Security and communication networks</title><description>Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level.</description><subject>Algorithms</subject><subject>Data encryption</subject><subject>Efficiency</subject><subject>Encryption</subject><subject>Gates (circuits)</subject><subject>Low level</subject><subject>Mathematical analysis</subject><subject>Matrix algebra</subject><subject>Matrix methods</subject><subject>Noise</subject><subject>Privacy</subject><issn>1939-0114</issn><issn>1939-0122</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqF0M9LwzAUB_AgCs7pzbMEPGpdfrbpce6nsKEwxWNI84N1bG1NOmT_vRkdepR3yHsvHxL4AnCL0RPGnA8IwmIgMpTmDJ2BHs5pniBMyPlvj9kluAphg1CKWcZ64G0Il7W3cOJcqUtbtXC6324PcF7vYvlmXWo4qbQ_NG1ZV3Cl13Zn4bMK1sA4z1afUFUGjpenq3ANLpzaBntzOvvgYzp5H82TxevsZTRcJJrkqE10xgnNHKLKipQ4bLFlTjChiWK4UIYTYkRhqEMsLlKueYGLtKDaUKF1XtA-uO_ebXz9tbehlZt676v4pSSM80xwgURUj53Svg7BWycbX-6UP0iM5DEzecxMnjKL_KHj67Iy6rv8T9912kZjnfrTBDPGc_oDgYNzsw</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>Wang, Xun</creator><creator>Li, Jianfeng</creator><creator>Luo, Tao</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><orcidid>https://orcid.org/0000-0002-7390-6722</orcidid><orcidid>https://orcid.org/0000-0003-4870-5942</orcidid></search><sort><creationdate>20180101</creationdate><title>A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes</title><author>Wang, Xun ; Li, Jianfeng ; Luo, Tao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c290t-c75237f03ae862f1e1e4f848c2a41bad522d8bd3f04a4165c5b1b6b3cd38cc9b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Data encryption</topic><topic>Efficiency</topic><topic>Encryption</topic><topic>Gates (circuits)</topic><topic>Low level</topic><topic>Mathematical analysis</topic><topic>Matrix algebra</topic><topic>Matrix methods</topic><topic>Noise</topic><topic>Privacy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Xun</creatorcontrib><creatorcontrib>Li, Jianfeng</creatorcontrib><creatorcontrib>Luo, Tao</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Security and communication networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Xun</au><au>Li, Jianfeng</au><au>Luo, Tao</au><au>Hu, Jiankun</au><au>Jiankun Hu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes</atitle><jtitle>Security and communication networks</jtitle><date>2018-01-01</date><risdate>2018</risdate><volume>2018</volume><issue>2018</issue><spage>1</spage><epage>14</epage><pages>1-14</pages><issn>1939-0114</issn><eissn>1939-0122</eissn><abstract>Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2018/8706940</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-7390-6722</orcidid><orcidid>https://orcid.org/0000-0003-4870-5942</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1939-0114 |
| ispartof | Security and communication networks, 2018-01, Vol.2018 (2018), p.1-14 |
| issn | 1939-0114 1939-0122 |
| language | eng |
| recordid | cdi_proquest_journals_2455785808 |
| source | Wiley-Blackwell Open Access Titles; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
| subjects | Algorithms Data encryption Efficiency Encryption Gates (circuits) Low level Mathematical analysis Matrix algebra Matrix methods Noise Privacy |
| title | A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM 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-08T22%3A04%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20More%20Efficient%20Fully%20Homomorphic%20Encryption%20Scheme%20Based%20on%20GSW%20and%20DM%20Schemes&rft.jtitle=Security%20and%20communication%20networks&rft.au=Wang,%20Xun&rft.date=2018-01-01&rft.volume=2018&rft.issue=2018&rft.spage=1&rft.epage=14&rft.pages=1-14&rft.issn=1939-0114&rft.eissn=1939-0122&rft_id=info:doi/10.1155/2018/8706940&rft_dat=%3Cproquest_cross%3E2455785808%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455785808&rft_id=info:pmid/&rfr_iscdi=true |