Research on strong robustness watermarking algorithm based on dynamic difference expansion
A surge in the amount of information comes with the rapid development of the technology industry.Across all industries, there is a need to collect and utilize vast amounts of data.While this big data holds immense value, it also poses unprecedented challenges to the field of data security.As relatio...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2023-10-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023065 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841529616307585024 |
|---|---|
| author | Tianqi WANG Yingzhou ZHANG Yunlong DI Dingwen LI Linlin ZHU |
| author_facet | Tianqi WANG Yingzhou ZHANG Yunlong DI Dingwen LI Linlin ZHU |
| author_sort | Tianqi WANG |
| collection | DOAJ |
| description | A surge in the amount of information comes with the rapid development of the technology industry.Across all industries, there is a need to collect and utilize vast amounts of data.While this big data holds immense value, it also poses unprecedented challenges to the field of data security.As relational databases serve as a fundamental storage medium for data, they often contain large-scale data rich in content and privacy.In the event of a data leak, significant losses may occur, highlighting the pressing need to safeguard database ownership and verify data ownership.However, existing database watermarking technologies face an inherent tradeoff between improving watermark embedding capacity and reducing data distortion.To address this issue and enhance watermark robustness, a novel robust database watermarking algorithm based on dynamic difference expansion was introduced.The QR code was employed as the watermark, the SVD decomposition of the low frequency part of the image was utilized after Haar wavelet transform.By extracting specific feature values and using residual feature values as the watermark sequence, it was ensured that the same-length watermark sequence contains more information and the embedded watermark length can be reduced.Furthermore, by combining the adaptive differential evolution algorithm and the minimum difference algorithm, the optimal embedding attribute bits were selected to alleviate the problems of low computational efficiency, high data distortion and poor robustness of traditional difference expansion techniques in embedding watermarks, and to improve the embedding capacity of watermarks while reducing the distortion of data.Experimental results demonstrate that the proposed algorithm achieves a high watermark embedding rate with low data distortion.It is resilient against multiple attacks, exhibiting excellent robustness and strong traceability.Compared to existing algorithms, it offers distinct advantages and holds great potential for broad application in the field of data security. |
| format | Article |
| id | doaj-art-7416b338be224b7ea5191d06d19c5731 |
| institution | Kabale University |
| issn | 2096-109X |
| language | English |
| publishDate | 2023-10-01 |
| publisher | POSTS&TELECOM PRESS Co., LTD |
| record_format | Article |
| series | 网络与信息安全学报 |
| spelling | doaj-art-7416b338be224b7ea5191d06d19c57312025-01-15T03:17:03ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2023-10-01915016559581494Research on strong robustness watermarking algorithm based on dynamic difference expansionTianqi WANGYingzhou ZHANGYunlong DIDingwen LILinlin ZHUA surge in the amount of information comes with the rapid development of the technology industry.Across all industries, there is a need to collect and utilize vast amounts of data.While this big data holds immense value, it also poses unprecedented challenges to the field of data security.As relational databases serve as a fundamental storage medium for data, they often contain large-scale data rich in content and privacy.In the event of a data leak, significant losses may occur, highlighting the pressing need to safeguard database ownership and verify data ownership.However, existing database watermarking technologies face an inherent tradeoff between improving watermark embedding capacity and reducing data distortion.To address this issue and enhance watermark robustness, a novel robust database watermarking algorithm based on dynamic difference expansion was introduced.The QR code was employed as the watermark, the SVD decomposition of the low frequency part of the image was utilized after Haar wavelet transform.By extracting specific feature values and using residual feature values as the watermark sequence, it was ensured that the same-length watermark sequence contains more information and the embedded watermark length can be reduced.Furthermore, by combining the adaptive differential evolution algorithm and the minimum difference algorithm, the optimal embedding attribute bits were selected to alleviate the problems of low computational efficiency, high data distortion and poor robustness of traditional difference expansion techniques in embedding watermarks, and to improve the embedding capacity of watermarks while reducing the distortion of data.Experimental results demonstrate that the proposed algorithm achieves a high watermark embedding rate with low data distortion.It is resilient against multiple attacks, exhibiting excellent robustness and strong traceability.Compared to existing algorithms, it offers distinct advantages and holds great potential for broad application in the field of data security.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023065database watermarkingdifferential evolutiondifference expansionsingular value decompositionHaar wavelet transformquick response code |
| spellingShingle | Tianqi WANG Yingzhou ZHANG Yunlong DI Dingwen LI Linlin ZHU Research on strong robustness watermarking algorithm based on dynamic difference expansion 网络与信息安全学报 database watermarking differential evolution difference expansion singular value decomposition Haar wavelet transform quick response code |
| title | Research on strong robustness watermarking algorithm based on dynamic difference expansion |
| title_full | Research on strong robustness watermarking algorithm based on dynamic difference expansion |
| title_fullStr | Research on strong robustness watermarking algorithm based on dynamic difference expansion |
| title_full_unstemmed | Research on strong robustness watermarking algorithm based on dynamic difference expansion |
| title_short | Research on strong robustness watermarking algorithm based on dynamic difference expansion |
| title_sort | research on strong robustness watermarking algorithm based on dynamic difference expansion |
| topic | database watermarking differential evolution difference expansion singular value decomposition Haar wavelet transform quick response code |
| url | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023065 |
| work_keys_str_mv | AT tianqiwang researchonstrongrobustnesswatermarkingalgorithmbasedondynamicdifferenceexpansion AT yingzhouzhang researchonstrongrobustnesswatermarkingalgorithmbasedondynamicdifferenceexpansion AT yunlongdi researchonstrongrobustnesswatermarkingalgorithmbasedondynamicdifferenceexpansion AT dingwenli researchonstrongrobustnesswatermarkingalgorithmbasedondynamicdifferenceexpansion AT linlinzhu researchonstrongrobustnesswatermarkingalgorithmbasedondynamicdifferenceexpansion |