Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images

This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation ove...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Signal processing 2012-04, Vol.92 (4), p.1069-1078
Hauptverfasser: Li, Li, Abd El-Latif, Ahmed A., Niu, Xiamu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1078
container_issue 4
container_start_page 1069
container_title Signal processing
container_volume 92
creator Li, Li
Abd El-Latif, Ahmed A.
Niu, Xiamu
description This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig–Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal. ► Exploit a new additive homomorphism in EC-ElGamal. ► Propose homomorphic image encryption for sharing secret images based on EC-ElGamal. ► Solve data expansion of EC-ElGamal. ► Uplift the encryption efficiency with shorter key length than methods based on RSA or ElGamal. ► Decrease the computation overhead in the decryption process.
doi_str_mv 10.1016/j.sigpro.2011.10.020
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1010895863</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0165168411003823</els_id><sourcerecordid>1010895863</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-a6d1bdfcef2e3217f6799c9619dc787b818e8bf432a62dc251d4fd72bb2ce1a63</originalsourceid><addsrcrecordid>eNp9kEtLAzEQgIMoWB__wEMugpetSbab7F4EkVoFwYtevCzZyaRN2UfNbAX_vSkrHiWHgZlvMjMfY1dSzKWQ-nY7p7DexWGuhJQpNRdKHLGZLI3KTFGYYzZLWJFJXS5O2RnRVgghcy1m7GPZtmE3BuCwj1_Il-3KdrbljSV0fDN06cXdJtVDZ9fIsYf4nfih5wQb7JD7IXLa2Bj6NSeEiOOE0gU78bYlvPyN5-z9cfn28JS9vK6eH-5fMsh1NWZWO9k4D-gV5koar01VQaVl5cCUpilliWXjF7myWjlQhXQL74xqGgUorc7P2c30bzLwuUca6y4QYNvaHoc91UmRKKui1HlCFxMKcSCK6OtdTMvG7wQdOF1v60llfVB5yCaVqe36d4IlsK2PtodAf72qMIVW4rDJ3cRhOvcrYKwJQjKGLkSEsXZD-H_QD2eDjUU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1010895863</pqid></control><display><type>article</type><title>Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images</title><source>Access via ScienceDirect (Elsevier)</source><creator>Li, Li ; Abd El-Latif, Ahmed A. ; Niu, Xiamu</creator><creatorcontrib>Li, Li ; Abd El-Latif, Ahmed A. ; Niu, Xiamu</creatorcontrib><description>This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig–Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal. ► Exploit a new additive homomorphism in EC-ElGamal. ► Propose homomorphic image encryption for sharing secret images based on EC-ElGamal. ► Solve data expansion of EC-ElGamal. ► Uplift the encryption efficiency with shorter key length than methods based on RSA or ElGamal. ► Decrease the computation overhead in the decryption process.</description><identifier>ISSN: 0165-1684</identifier><identifier>EISSN: 1872-7557</identifier><identifier>DOI: 10.1016/j.sigpro.2011.10.020</identifier><identifier>CODEN: SPRODR</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Additive homomorphism ; Additives ; Applied sciences ; Channels ; Computation ; Cryptography ; Detection, estimation, filtering, equalization, prediction ; Elliptic curve ElGamal ; Encryption ; Exact sciences and technology ; Homomorphisms ; Image encryption ; Information, signal and communications theory ; Resists ; Signal and communications theory ; Signal processing ; Signal, noise ; Telecommunications and information theory</subject><ispartof>Signal processing, 2012-04, Vol.92 (4), p.1069-1078</ispartof><rights>2011 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-a6d1bdfcef2e3217f6799c9619dc787b818e8bf432a62dc251d4fd72bb2ce1a63</citedby><cites>FETCH-LOGICAL-c369t-a6d1bdfcef2e3217f6799c9619dc787b818e8bf432a62dc251d4fd72bb2ce1a63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.sigpro.2011.10.020$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=25756206$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Li, Li</creatorcontrib><creatorcontrib>Abd El-Latif, Ahmed A.</creatorcontrib><creatorcontrib>Niu, Xiamu</creatorcontrib><title>Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images</title><title>Signal processing</title><description>This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig–Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal. ► Exploit a new additive homomorphism in EC-ElGamal. ► Propose homomorphic image encryption for sharing secret images based on EC-ElGamal. ► Solve data expansion of EC-ElGamal. ► Uplift the encryption efficiency with shorter key length than methods based on RSA or ElGamal. ► Decrease the computation overhead in the decryption process.</description><subject>Additive homomorphism</subject><subject>Additives</subject><subject>Applied sciences</subject><subject>Channels</subject><subject>Computation</subject><subject>Cryptography</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Elliptic curve ElGamal</subject><subject>Encryption</subject><subject>Exact sciences and technology</subject><subject>Homomorphisms</subject><subject>Image encryption</subject><subject>Information, signal and communications theory</subject><subject>Resists</subject><subject>Signal and communications theory</subject><subject>Signal processing</subject><subject>Signal, noise</subject><subject>Telecommunications and information theory</subject><issn>0165-1684</issn><issn>1872-7557</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEQgIMoWB__wEMugpetSbab7F4EkVoFwYtevCzZyaRN2UfNbAX_vSkrHiWHgZlvMjMfY1dSzKWQ-nY7p7DexWGuhJQpNRdKHLGZLI3KTFGYYzZLWJFJXS5O2RnRVgghcy1m7GPZtmE3BuCwj1_Il-3KdrbljSV0fDN06cXdJtVDZ9fIsYf4nfih5wQb7JD7IXLa2Bj6NSeEiOOE0gU78bYlvPyN5-z9cfn28JS9vK6eH-5fMsh1NWZWO9k4D-gV5koar01VQaVl5cCUpilliWXjF7myWjlQhXQL74xqGgUorc7P2c30bzLwuUca6y4QYNvaHoc91UmRKKui1HlCFxMKcSCK6OtdTMvG7wQdOF1v60llfVB5yCaVqe36d4IlsK2PtodAf72qMIVW4rDJ3cRhOvcrYKwJQjKGLkSEsXZD-H_QD2eDjUU</recordid><startdate>20120401</startdate><enddate>20120401</enddate><creator>Li, Li</creator><creator>Abd El-Latif, Ahmed A.</creator><creator>Niu, Xiamu</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120401</creationdate><title>Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images</title><author>Li, Li ; Abd El-Latif, Ahmed A. ; Niu, Xiamu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-a6d1bdfcef2e3217f6799c9619dc787b818e8bf432a62dc251d4fd72bb2ce1a63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Additive homomorphism</topic><topic>Additives</topic><topic>Applied sciences</topic><topic>Channels</topic><topic>Computation</topic><topic>Cryptography</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Elliptic curve ElGamal</topic><topic>Encryption</topic><topic>Exact sciences and technology</topic><topic>Homomorphisms</topic><topic>Image encryption</topic><topic>Information, signal and communications theory</topic><topic>Resists</topic><topic>Signal and communications theory</topic><topic>Signal processing</topic><topic>Signal, noise</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Li</creatorcontrib><creatorcontrib>Abd El-Latif, Ahmed A.</creatorcontrib><creatorcontrib>Niu, Xiamu</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications 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>Signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Li</au><au>Abd El-Latif, Ahmed A.</au><au>Niu, Xiamu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images</atitle><jtitle>Signal processing</jtitle><date>2012-04-01</date><risdate>2012</risdate><volume>92</volume><issue>4</issue><spage>1069</spage><epage>1078</epage><pages>1069-1078</pages><issn>0165-1684</issn><eissn>1872-7557</eissn><coden>SPRODR</coden><abstract>This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig–Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal. ► Exploit a new additive homomorphism in EC-ElGamal. ► Propose homomorphic image encryption for sharing secret images based on EC-ElGamal. ► Solve data expansion of EC-ElGamal. ► Uplift the encryption efficiency with shorter key length than methods based on RSA or ElGamal. ► Decrease the computation overhead in the decryption process.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.sigpro.2011.10.020</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0165-1684
ispartof Signal processing, 2012-04, Vol.92 (4), p.1069-1078
issn 0165-1684
1872-7557
language eng
recordid cdi_proquest_miscellaneous_1010895863
source Access via ScienceDirect (Elsevier)
subjects Additive homomorphism
Additives
Applied sciences
Channels
Computation
Cryptography
Detection, estimation, filtering, equalization, prediction
Elliptic curve ElGamal
Encryption
Exact sciences and technology
Homomorphisms
Image encryption
Information, signal and communications theory
Resists
Signal and communications theory
Signal processing
Signal, noise
Telecommunications and information theory
title Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T10%3A16%3A25IST&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=Elliptic%20curve%20ElGamal%20based%20homomorphic%20image%20encryption%20scheme%20for%20sharing%20secret%20images&rft.jtitle=Signal%20processing&rft.au=Li,%20Li&rft.date=2012-04-01&rft.volume=92&rft.issue=4&rft.spage=1069&rft.epage=1078&rft.pages=1069-1078&rft.issn=0165-1684&rft.eissn=1872-7557&rft.coden=SPRODR&rft_id=info:doi/10.1016/j.sigpro.2011.10.020&rft_dat=%3Cproquest_cross%3E1010895863%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=1010895863&rft_id=info:pmid/&rft_els_id=S0165168411003823&rfr_iscdi=true