Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks
International Journal of Computer Science and Information Security, IJCSIS, Vol. 6, No. 3, pp. 057-063, December 2009, USA For enhancing the protection level of dynamic graph software watermarks and for the purpose of conducting the analysis which evaluates the effect of integrating two software pro...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| 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 | Khiyal, Malik Sikandar Hayat Khan, Aihab Amjad, Sehrish Khalil, M. Shahid |
| description | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 057-063, December 2009, USA For enhancing the protection level of dynamic graph software watermarks and
for the purpose of conducting the analysis which evaluates the effect of
integrating two software protection techniques such as software watermarking
and tamper proofing, constant encoding technique along with the enhancement
through the idea of constant splitting is proposed. In this paper Thomborson
technique has been implemented with the scheme of breaking constants which
enables to encode all constants without having any consideration about their
values with respect to the value of watermark tree. Experimental analysis which
have been conducted and provided in this paper concludes that the constant
encoding process significantly increases the code size, heap space usage, and
execution time, while making the tamper proofed code resilient to variety of
semantic preserving program transformation attacks. |
| doi_str_mv | 10.48550/arxiv.1001.1974 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1001_1974</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1001_1974</sourcerecordid><originalsourceid>FETCH-LOGICAL-a654-51d932bae279b36ecf0101067cc94bf924e933c461897c03e4a87277510b41053</originalsourceid><addsrcrecordid>eNotj7FOwzAURb10QC07E_IPJNixHcdjVUJBqkQlInWMXtxnsNrEkRMC_XsaQHe4y9W5OoTccZbKQin2APHbTylnjKfcaHlD9uUE508YffdOS-fQjn7CDoeBBkcraHuMdB9DcPMgdPTx0kHrLd1G6D_oW3DjF0SkBxgxthBPw4osHJwHvP3vJameymrznOxety-b9S6BXMlE8aMRWQOYadOIHK1j_JpcW2tk40wm0QhhZc4Loy0TKKHQmdaKs0ZypsSS3P9hf43qPvrr-6WezerZTPwAullIOg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks</title><source>arXiv.org</source><creator>Khiyal, Malik Sikandar Hayat ; Khan, Aihab ; Amjad, Sehrish ; Khalil, M. Shahid</creator><creatorcontrib>Khiyal, Malik Sikandar Hayat ; Khan, Aihab ; Amjad, Sehrish ; Khalil, M. Shahid</creatorcontrib><description>International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 057-063, December 2009, USA For enhancing the protection level of dynamic graph software watermarks and
for the purpose of conducting the analysis which evaluates the effect of
integrating two software protection techniques such as software watermarking
and tamper proofing, constant encoding technique along with the enhancement
through the idea of constant splitting is proposed. In this paper Thomborson
technique has been implemented with the scheme of breaking constants which
enables to encode all constants without having any consideration about their
values with respect to the value of watermark tree. Experimental analysis which
have been conducted and provided in this paper concludes that the constant
encoding process significantly increases the code size, heap space usage, and
execution time, while making the tamper proofed code resilient to variety of
semantic preserving program transformation attacks.</description><identifier>DOI: 10.48550/arxiv.1001.1974</identifier><language>eng</language><subject>Computer Science - Cryptography and Security ; Computer Science - Multimedia</subject><creationdate>2010-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.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,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1001.1974$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1001.1974$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Khiyal, Malik Sikandar Hayat</creatorcontrib><creatorcontrib>Khan, Aihab</creatorcontrib><creatorcontrib>Amjad, Sehrish</creatorcontrib><creatorcontrib>Khalil, M. Shahid</creatorcontrib><title>Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks</title><description>International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 057-063, December 2009, USA For enhancing the protection level of dynamic graph software watermarks and
for the purpose of conducting the analysis which evaluates the effect of
integrating two software protection techniques such as software watermarking
and tamper proofing, constant encoding technique along with the enhancement
through the idea of constant splitting is proposed. In this paper Thomborson
technique has been implemented with the scheme of breaking constants which
enables to encode all constants without having any consideration about their
values with respect to the value of watermark tree. Experimental analysis which
have been conducted and provided in this paper concludes that the constant
encoding process significantly increases the code size, heap space usage, and
execution time, while making the tamper proofed code resilient to variety of
semantic preserving program transformation attacks.</description><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Multimedia</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7FOwzAURb10QC07E_IPJNixHcdjVUJBqkQlInWMXtxnsNrEkRMC_XsaQHe4y9W5OoTccZbKQin2APHbTylnjKfcaHlD9uUE508YffdOS-fQjn7CDoeBBkcraHuMdB9DcPMgdPTx0kHrLd1G6D_oW3DjF0SkBxgxthBPw4osHJwHvP3vJameymrznOxety-b9S6BXMlE8aMRWQOYadOIHK1j_JpcW2tk40wm0QhhZc4Loy0TKKHQmdaKs0ZypsSS3P9hf43qPvrr-6WezerZTPwAullIOg</recordid><startdate>20100112</startdate><enddate>20100112</enddate><creator>Khiyal, Malik Sikandar Hayat</creator><creator>Khan, Aihab</creator><creator>Amjad, Sehrish</creator><creator>Khalil, M. Shahid</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20100112</creationdate><title>Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks</title><author>Khiyal, Malik Sikandar Hayat ; Khan, Aihab ; Amjad, Sehrish ; Khalil, M. Shahid</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a654-51d932bae279b36ecf0101067cc94bf924e933c461897c03e4a87277510b41053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Multimedia</topic><toplevel>online_resources</toplevel><creatorcontrib>Khiyal, Malik Sikandar Hayat</creatorcontrib><creatorcontrib>Khan, Aihab</creatorcontrib><creatorcontrib>Amjad, Sehrish</creatorcontrib><creatorcontrib>Khalil, M. Shahid</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Khiyal, Malik Sikandar Hayat</au><au>Khan, Aihab</au><au>Amjad, Sehrish</au><au>Khalil, M. Shahid</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks</atitle><date>2010-01-12</date><risdate>2010</risdate><abstract>International Journal of Computer Science and Information
Security, IJCSIS, Vol. 6, No. 3, pp. 057-063, December 2009, USA For enhancing the protection level of dynamic graph software watermarks and
for the purpose of conducting the analysis which evaluates the effect of
integrating two software protection techniques such as software watermarking
and tamper proofing, constant encoding technique along with the enhancement
through the idea of constant splitting is proposed. In this paper Thomborson
technique has been implemented with the scheme of breaking constants which
enables to encode all constants without having any consideration about their
values with respect to the value of watermark tree. Experimental analysis which
have been conducted and provided in this paper concludes that the constant
encoding process significantly increases the code size, heap space usage, and
execution time, while making the tamper proofed code resilient to variety of
semantic preserving program transformation attacks.</abstract><doi>10.48550/arxiv.1001.1974</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1001.1974 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1001_1974 |
| source | arXiv.org |
| subjects | Computer Science - Cryptography and Security Computer Science - Multimedia |
| title | Evaluating Effectiveness of Tamper Proofing on Dynamic Graph Software Watermarks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T12%3A56%3A51IST&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=Evaluating%20Effectiveness%20of%20Tamper%20Proofing%20on%20Dynamic%20Graph%20Software%20Watermarks&rft.au=Khiyal,%20Malik%20Sikandar%20Hayat&rft.date=2010-01-12&rft_id=info:doi/10.48550/arxiv.1001.1974&rft_dat=%3Carxiv_GOX%3E1001_1974%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 |