High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain
Information hiding researchers have been exploring techniques to improve the security of transmitting sensitive data through an unsecured channel. This paper proposes an audio steganography model for secure audio transmission during communication based on fractal coding and a chaotic least significa...
Gespeichert in:
| Veröffentlicht in: | Multimedia tools and applications 2018-12, Vol.77 (23), p.31487-31516 |
|---|---|
| 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 | 31516 |
|---|---|
| container_issue | 23 |
| container_start_page | 31487 |
| container_title | Multimedia tools and applications |
| container_volume | 77 |
| creator | Ali, Ahmed Hussain George, Loay Edwar Zaidan, A. A. Mokhtar, Mohd Rosmadi |
| description | Information hiding researchers have been exploring techniques to improve the security of transmitting sensitive data through an unsecured channel. This paper proposes an audio steganography model for secure audio transmission during communication based on fractal coding and a chaotic least significant bit or also known as HASFC. This model contributes to enhancing the hiding capacity and preserving the statistical transparency and security. The HASFC model manages to embed secret audio into a cover audio with the same size. In order to achieve this result, fractal coding is adopted which produces high compression ratio with the acceptable reconstructed signal. The chaotic map is used to randomly select the cover samples for embedding and its initial parameters are utilized as a secret key to enhancing the security of the proposed model. Unlike the existing audio steganography schemes, The HASFC model outperforms related studies by improving the hiding capacity up to 30% and maintaining the transparency of stego audio with average values of SNR at 70.4, PRD at 0.0002 and SDG at 4.7. Moreover, the model also shows resistance against brute-force attack and statistical analysis. |
| doi_str_mv | 10.1007/s11042-018-6213-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2051403454</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2051403454</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-3583bb7d283ae2fdd24a4354e447a45b629995991d6ef993c155fd80c4f9dca33</originalsourceid><addsrcrecordid>eNp1kD1PwzAQQC0EEqXwA9gssRLwZxKPqAKKVIkFZutqO2mqxg62M5RfTyBITEx3w3t30kPompI7Skh1nyglghWE1kXJKC_ICVpQWfGiqhg9nXZek6KShJ6ji5T2hNBSMrFAn-uu3WEDA5guH29xjuDTANH5jMFbnJwZo8Mw2i7glF0LPrQRht0R98G6A95CchYHj5sIJsMBm2A73_7IZgchdwb3MODO4-z6IcQJsaGHzl-iswYOyV39ziV6f3p8W62Lzevzy-phUxhOy1xwWfPttrKs5uBYYy0TILgUTogKhNyWTCkllaK2dI1S3FApG1sTIxplDXC-RDfz3SGGj9GlrPdhjH56qRmRVBAupJgoOlMmhpSia_QQux7iUVOivxPrObGeEuvvxJpMDpudNLG-dfHv8v_SF86ef30</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2051403454</pqid></control><display><type>article</type><title>High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain</title><source>SpringerLink Journals - AutoHoldings</source><creator>Ali, Ahmed Hussain ; George, Loay Edwar ; Zaidan, A. A. ; Mokhtar, Mohd Rosmadi</creator><creatorcontrib>Ali, Ahmed Hussain ; George, Loay Edwar ; Zaidan, A. A. ; Mokhtar, Mohd Rosmadi</creatorcontrib><description>Information hiding researchers have been exploring techniques to improve the security of transmitting sensitive data through an unsecured channel. This paper proposes an audio steganography model for secure audio transmission during communication based on fractal coding and a chaotic least significant bit or also known as HASFC. This model contributes to enhancing the hiding capacity and preserving the statistical transparency and security. The HASFC model manages to embed secret audio into a cover audio with the same size. In order to achieve this result, fractal coding is adopted which produces high compression ratio with the acceptable reconstructed signal. The chaotic map is used to randomly select the cover samples for embedding and its initial parameters are utilized as a secret key to enhancing the security of the proposed model. Unlike the existing audio steganography schemes, The HASFC model outperforms related studies by improving the hiding capacity up to 30% and maintaining the transparency of stego audio with average values of SNR at 70.4, PRD at 0.0002 and SDG at 4.7. Moreover, the model also shows resistance against brute-force attack and statistical analysis.</description><identifier>ISSN: 1380-7501</identifier><identifier>EISSN: 1573-7721</identifier><identifier>DOI: 10.1007/s11042-018-6213-0</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Audio data ; Coding ; Compression ratio ; Computer Communication Networks ; Computer Science ; Cybersecurity ; Data Structures and Information Theory ; Fractal models ; Fractals ; Multimedia Information Systems ; Special Purpose and Application-Based Systems ; Statistical analysis ; Statistical methods ; Steganography</subject><ispartof>Multimedia tools and applications, 2018-12, Vol.77 (23), p.31487-31516</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>Multimedia Tools and Applications is a copyright of Springer, (2018). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-3583bb7d283ae2fdd24a4354e447a45b629995991d6ef993c155fd80c4f9dca33</citedby><cites>FETCH-LOGICAL-c316t-3583bb7d283ae2fdd24a4354e447a45b629995991d6ef993c155fd80c4f9dca33</cites><orcidid>0000-0001-8561-1991</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11042-018-6213-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11042-018-6213-0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,41487,42556,51318</link.rule.ids></links><search><creatorcontrib>Ali, Ahmed Hussain</creatorcontrib><creatorcontrib>George, Loay Edwar</creatorcontrib><creatorcontrib>Zaidan, A. A.</creatorcontrib><creatorcontrib>Mokhtar, Mohd Rosmadi</creatorcontrib><title>High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain</title><title>Multimedia tools and applications</title><addtitle>Multimed Tools Appl</addtitle><description>Information hiding researchers have been exploring techniques to improve the security of transmitting sensitive data through an unsecured channel. This paper proposes an audio steganography model for secure audio transmission during communication based on fractal coding and a chaotic least significant bit or also known as HASFC. This model contributes to enhancing the hiding capacity and preserving the statistical transparency and security. The HASFC model manages to embed secret audio into a cover audio with the same size. In order to achieve this result, fractal coding is adopted which produces high compression ratio with the acceptable reconstructed signal. The chaotic map is used to randomly select the cover samples for embedding and its initial parameters are utilized as a secret key to enhancing the security of the proposed model. Unlike the existing audio steganography schemes, The HASFC model outperforms related studies by improving the hiding capacity up to 30% and maintaining the transparency of stego audio with average values of SNR at 70.4, PRD at 0.0002 and SDG at 4.7. Moreover, the model also shows resistance against brute-force attack and statistical analysis.</description><subject>Audio data</subject><subject>Coding</subject><subject>Compression ratio</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Cybersecurity</subject><subject>Data Structures and Information Theory</subject><subject>Fractal models</subject><subject>Fractals</subject><subject>Multimedia Information Systems</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Statistical analysis</subject><subject>Statistical methods</subject><subject>Steganography</subject><issn>1380-7501</issn><issn>1573-7721</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kD1PwzAQQC0EEqXwA9gssRLwZxKPqAKKVIkFZutqO2mqxg62M5RfTyBITEx3w3t30kPompI7Skh1nyglghWE1kXJKC_ICVpQWfGiqhg9nXZek6KShJ6ji5T2hNBSMrFAn-uu3WEDA5guH29xjuDTANH5jMFbnJwZo8Mw2i7glF0LPrQRht0R98G6A95CchYHj5sIJsMBm2A73_7IZgchdwb3MODO4-z6IcQJsaGHzl-iswYOyV39ziV6f3p8W62Lzevzy-phUxhOy1xwWfPttrKs5uBYYy0TILgUTogKhNyWTCkllaK2dI1S3FApG1sTIxplDXC-RDfz3SGGj9GlrPdhjH56qRmRVBAupJgoOlMmhpSia_QQux7iUVOivxPrObGeEuvvxJpMDpudNLG-dfHv8v_SF86ef30</recordid><startdate>20181201</startdate><enddate>20181201</enddate><creator>Ali, Ahmed Hussain</creator><creator>George, Loay Edwar</creator><creator>Zaidan, A. A.</creator><creator>Mokhtar, Mohd Rosmadi</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-8561-1991</orcidid></search><sort><creationdate>20181201</creationdate><title>High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain</title><author>Ali, Ahmed Hussain ; George, Loay Edwar ; Zaidan, A. A. ; Mokhtar, Mohd Rosmadi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-3583bb7d283ae2fdd24a4354e447a45b629995991d6ef993c155fd80c4f9dca33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Audio data</topic><topic>Coding</topic><topic>Compression ratio</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Cybersecurity</topic><topic>Data Structures and Information Theory</topic><topic>Fractal models</topic><topic>Fractals</topic><topic>Multimedia Information Systems</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Statistical analysis</topic><topic>Statistical methods</topic><topic>Steganography</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ali, Ahmed Hussain</creatorcontrib><creatorcontrib>George, Loay Edwar</creatorcontrib><creatorcontrib>Zaidan, A. A.</creatorcontrib><creatorcontrib>Mokhtar, Mohd Rosmadi</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</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>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</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>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</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><collection>ProQuest Central Basic</collection><jtitle>Multimedia tools and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ali, Ahmed Hussain</au><au>George, Loay Edwar</au><au>Zaidan, A. A.</au><au>Mokhtar, Mohd Rosmadi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain</atitle><jtitle>Multimedia tools and applications</jtitle><stitle>Multimed Tools Appl</stitle><date>2018-12-01</date><risdate>2018</risdate><volume>77</volume><issue>23</issue><spage>31487</spage><epage>31516</epage><pages>31487-31516</pages><issn>1380-7501</issn><eissn>1573-7721</eissn><abstract>Information hiding researchers have been exploring techniques to improve the security of transmitting sensitive data through an unsecured channel. This paper proposes an audio steganography model for secure audio transmission during communication based on fractal coding and a chaotic least significant bit or also known as HASFC. This model contributes to enhancing the hiding capacity and preserving the statistical transparency and security. The HASFC model manages to embed secret audio into a cover audio with the same size. In order to achieve this result, fractal coding is adopted which produces high compression ratio with the acceptable reconstructed signal. The chaotic map is used to randomly select the cover samples for embedding and its initial parameters are utilized as a secret key to enhancing the security of the proposed model. Unlike the existing audio steganography schemes, The HASFC model outperforms related studies by improving the hiding capacity up to 30% and maintaining the transparency of stego audio with average values of SNR at 70.4, PRD at 0.0002 and SDG at 4.7. Moreover, the model also shows resistance against brute-force attack and statistical analysis.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11042-018-6213-0</doi><tpages>30</tpages><orcidid>https://orcid.org/0000-0001-8561-1991</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1380-7501 |
| ispartof | Multimedia tools and applications, 2018-12, Vol.77 (23), p.31487-31516 |
| issn | 1380-7501 1573-7721 |
| language | eng |
| recordid | cdi_proquest_journals_2051403454 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Audio data Coding Compression ratio Computer Communication Networks Computer Science Cybersecurity Data Structures and Information Theory Fractal models Fractals Multimedia Information Systems Special Purpose and Application-Based Systems Statistical analysis Statistical methods Steganography |
| title | High capacity, transparent and secure audio steganography model based on fractal coding and chaotic map in temporal domain |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T09%3A06%3A23IST&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=High%20capacity,%20transparent%20and%20secure%20audio%20steganography%20model%20based%20on%20fractal%20coding%20and%20chaotic%20map%20in%20temporal%20domain&rft.jtitle=Multimedia%20tools%20and%20applications&rft.au=Ali,%20Ahmed%20Hussain&rft.date=2018-12-01&rft.volume=77&rft.issue=23&rft.spage=31487&rft.epage=31516&rft.pages=31487-31516&rft.issn=1380-7501&rft.eissn=1573-7721&rft_id=info:doi/10.1007/s11042-018-6213-0&rft_dat=%3Cproquest_cross%3E2051403454%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=2051403454&rft_id=info:pmid/&rfr_iscdi=true |