Asymmetric watermarking scheme using permutation braids

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

Abstract

In this paper, we propose asymmetric watermarking system using permutation braids. Asymmetric watermarking system uses different keys for watermark embedding and detection. In such a scheme, the detector only needs to know a public key, which does not give enough information to make watermark removal possible. The proposed watermarking scheme can match requirements of asymmetric watermarking system. Our experimental result shows that this scheme provides security from any attempts to identify or remove the secret key. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Song, G. S., Kim, M. A., & Lee, W. H. (2004). Asymmetric watermarking scheme using permutation braids. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2908, 217–226. https://doi.org/10.1007/978-3-540-24591-9_17

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