A fragile watermarking based on knapsack problem

Authors:
Hui Han;HongXun Yao;ShaoHui Liu;Yan Liu
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China
Venue:
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Year:
2004

Citing 2
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Pitfalls in Public Key Watermarking

SIBGRAPI '99 Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new fragile watermarking is proposed. It is different from most existing schemes to resist the famous birthday attack. The classic NPC problem knapsack problem in algorithm is introduced. It uses a random sequence to encrypt the bit planes of image pixels and regard the encrypted result as the indicative vector for knapsack set. The NP computation of knapsack problem is applied to make the fragile watermarking system secure.This scheme can effectively resist the birthday attack with a higher resolution than the algorithm before. Theoretical analysis and experimental results demonstrate its effectiveness in resisting the birthday attack and good property of localization.