Content-fragile commutative watermarking-encryption based on pixel entropy

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Content-fragile commutative watermarking-encryption requires that both the content-fragile image signature and the watermarking process are invariant under encryption. The pixel entropy, being dependent on first-order image statistics only, is invariant under permutations. In the present paper we embed semi-fragile signatures based on pixel entropy by using a histogram-based watermarking algorithm, which is also invariant to permutations. We also show how the problem of collisions, i.e. different images having the same signature, can be overcome in this approach, if embedder and encryptor share a common secret.

Cite

CITATION STYLE

APA

Schmitz, R., Li, S., Grecos, C., & Zhang, X. (2015). Content-fragile commutative watermarking-encryption based on pixel entropy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9386, pp. 474–485). Springer Verlag. https://doi.org/10.1007/978-3-319-25903-1_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free