• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhao Xianfeng, Li Ning, and Huang Wei. Reversible R-S Digital Watermarking Using the Subliminal Channel[J]. Journal of Computer Research and Development, 2009, 46(1): 100-107.
Citation: Zhao Xianfeng, Li Ning, and Huang Wei. Reversible R-S Digital Watermarking Using the Subliminal Channel[J]. Journal of Computer Research and Development, 2009, 46(1): 100-107.

Reversible R-S Digital Watermarking Using the Subliminal Channel

More Information
  • Published Date: January 14, 2009
  • Because of the difficulty of making adequate redundant capacity for watermarking, some reversible watermarking schemes for content authentication just embed a symmetrically encrypted hash value, the size of which is significantly smaller than that of a digital signature. It makes a dishonest verifier be capable of fabricating legal contents. However, the research finds that introducing a public-key signature, which is usually several times longer than a hash code, can only need several bytes more capacity if the subliminal channel in the signature scheme can be used. And it is shown that RSA-PSS (RSA-probabilistic signature scheme) has such an exploitable subliminal channel. Then an improved reversible R-S (regular-singular) watermarking scheme, which adopts RSA-PSS, is proposed. It still produces the redundant watermarking capacity by compressing the R-S vector but stores partial or entire compressed R-S vector in the subliminal channel. As a result, the new scheme only needs 4 bytes more additional capacity. By the reduced size of overall embedded data, the new scheme can even partition an original image into several tens of blocks and embed data block-wise so that it has the capability of localizing tampering. And by not revealing any information directly about the private key, it has reliable security also.
  • Related Articles

    [1]Wang Ruiqin, Jiang Yunliang, Li Yixiao, Lou Jungang. A Collaborative Filtering Recommendation Algorithm Based on Multiple Social Trusts[J]. Journal of Computer Research and Development, 2016, 53(6): 1389-1399. DOI: 10.7544/issn1000-1239.2016.20150307
    [2]Xia Nu, Li Wei, Lu You, Jiang Jian, Shan Feng, Luo Junzhou. A Trust Model for the Inter-Domain Routing System[J]. Journal of Computer Research and Development, 2016, 53(4): 845-860. DOI: 10.7544/issn1000-1239.2016.20151121
    [3]Guo Lei, Ma Jun, and Chen Zhumin. Trust Strength Aware Social Recommendation Method[J]. Journal of Computer Research and Development, 2013, 50(9): 1805-1813.
    [4]Jia Dongyan and Zhang Fuzhi. A Collaborative Filtering Recommendation Algorithm Based on Double Neighbor Choosing Strategy[J]. Journal of Computer Research and Development, 2013, 50(5): 1076-1084.
    [5]Jiang Liming, Zhang Kun, Xu Jian, Zhang Hong. A New Evidential Trust Model Based on Graph Theory for Open Computing Systems[J]. Journal of Computer Research and Development, 2013, 50(5): 921-931.
    [6]Luo Junhai, Fan Mingyu. A Subjective Trust Management Model Based on Certainty-Factor for MANETs[J]. Journal of Computer Research and Development, 2010, 47(3): 515-523.
    [7]Ye Ayong, Ma Jianfeng. A Trust Valuation Model in MANET[J]. Journal of Computer Research and Development, 2008, 45(5): 765-771.
    [8]Wu Peng, Wu Guoxin, and Fang Qun. A Reputation-Based Trust Model Based on Probability and Statistics for P2P Systems[J]. Journal of Computer Research and Development, 2008, 45(3): 408-416.
    [9]Wu Peng, Wu Guoxin, and Fang Qun. A Reputation-Based Trust Model Based on Probability and Statistics for P2P Systems[J]. Journal of Computer Research and Development, 2008, 45(3): 408-416.
    [10]Zhu Junmao, Yang Shoubao, Fan Jianping, Chen Mingyu. A Grid & P2P Trust Model Based on Recommendation Evidence Reasoning[J]. Journal of Computer Research and Development, 2005, 42(5): 797-803.

Catalog

    Article views (783) PDF downloads (543) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return