1,790 Hits in 6.6 sec

Are 128 Bits Long Keys Possible in Watermarking? [chapter]

Patrick Bas, Teddy Furon
2012 Lecture Notes in Computer Science  
The question raised in this poster is the following: is the key length of a watermarking system proportional to the key length of the seed used to generate the watermark?  ...  For example, if a watermark is generated from a binary sequence of size n, does it means that the key length is 2 n ? As we shall see in this poster, the answer is no!  ...  The question raised in this poster is the following: is the key length of a watermarking system proportional to the key length of the seed used to generate the watermark?  ... 
doi:10.1007/978-3-642-32805-3_15 fatcat:ru67qcl3xrfytkgno4vwaem54q

Watermark-Based Authentication [chapter]

Angela D'Angelo, Giacomo Cancelli, Mauro Barni
2010 Studies in Computational Intelligence  
In one-bit (oblivious detection) watermarking, D is a three-argument function accepting as input A , a watermark b, and a secret key K.  ...  The only way to counter this attack is to use long keys to dissuade the attacker from trying to discover them, because of the high cost of the attack.  ... 
doi:10.1007/978-3-642-11756-5_16 fatcat:rxlbydycbrfzhpa3sa5ycukaq4

Near-Optimal Watermark Estimation and Its Countermeasure: Antidisclosure Watermark for Multiple Watermark Embedding

Chun-Shien Lu, Chao-Yung Hsu
2007 IEEE transactions on circuits and systems for video technology (Print)  
Subject to these definitions, a new content-dependent watermark (CDW) is proposed to deal with watermark-estimation attack.  ...  Index Terms-Collusion attack, content-dependent watermark, copy attack, cover data recovery, media hash, robustness, watermark estimation.  ...  ACKNOWLEDGMENT The authors thank the anonymous reviewers for their valuable comments in improving this paper.  ... 
doi:10.1109/tcsvt.2006.888837 fatcat:xoekekhhxbfvbgq7guykm5uz4y

Multimedia watermarking techniques

F. Hartung, M. Kutter
1999 Proceedings of the IEEE  
Robustness and security aspects are discussed in detail. Finally, a few remarks are made about the state of the art and possible future developments in watermarking technology.  ...  A watermark typically contains information about the origin, status, or recipient of the host data. In this tutorial paper, the requirements and applications for watermarking are reviewed.  ...  Although it is possible to design robust watermarking techniques, it should be noted that a watermark is only robust as long as it is not public, which means as long as it cannot be read by everyone.  ... 
doi:10.1109/5.771066 fatcat:e3hxw7y2s5hrdmvjrzjabognpi

Watermarking Relational Databases [chapter]

Rakesh Agrawal, Jerry Kiernan
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
The tuples, attributes within a tuple, bit positions in an attribute, and specific bit values are all algorithmically determined under the control of a private key known only to the owner of the data.  ...  The watermark can be detected even in a small subset of a watermarked relation as long as the sample contains some of the marks.  ...  We are also thankful to Ramesh Agarwal, Dan Gruhl and Peter Haas for their thoughtful comments.  ... 
doi:10.1016/b978-155860869-6/50022-6 dblp:conf/vldb/AgrawalK02 fatcat:bvj5mfcntbgh7ibmt66i6slgw4

Sonic Watermarking

Ryuki Tachibana
2004 EURASIP Journal on Advances in Signal Processing  
We propose an audio watermarking algorithm for sonic watermarking that increases the magnitudes of the host signal only in segmented areas pseudorandomly chosen in the time-frequency plane.  ...  Sonic watermarking mixes the sound of the watermark signal and the host sound in the air to detect illegal music recordings recorded from auditoriums.  ...  The values of the pseudorandom numbers and the tile assignments of the bits are determined by a symmetric key shared by the embedder and the detector.  ... 
doi:10.1155/s1110865704403138 fatcat:cru2aanvajdercq6e5jqswmweq

Robust AVS audio watermarking

Yong Wang, JiWu Huang
2010 Science China Information Sciences  
Then we design a novel watermarking algorithm which is integrated into the AVS audio coding process. The watermark bits are embedded into the compressed bit stream.  ...  At the extracting end, the watermark bits can be extracted from the compressed bit stream directly.  ...  Robustness Bit rates of 128 kbps and 32 kbps (the lowest bit rate of AV3) are tested. The tested clips are firstly compressed and embedded.  ... 
doi:10.1007/s11432-010-0049-1 fatcat:mbru5sqopnbsxmbocoh4vxakze

Fragile IP Watermarking Techniques

Amr T. Abdel-Hamid, Sofiène Tahar
2008 2008 NASA/ESA Conference on Adaptive Hardware and Systems  
In this paper, we are trying to solve such challenge by proposing a novel fragile IP watermarking technique.  ...  The approach utilizes existing transitions in a finite state machine (FSM) component of an IP and does not result on any overhead to the IP design.  ...  Yet, as long as the designer protects his key, the watermark inserted int he IP design cannot be detected by any means.  ... 
doi:10.1109/ahs.2008.73 dblp:conf/ahs/Abdel-HamidT08 fatcat:2h3kin2s45c7nooqnfulev26yi

Alteration-Locating Authentication Watermarking for Binary Images [chapter]

Hae Yong Kim, Ricardo Lopes de Queiroz
2005 Lecture Notes in Computer Science  
Data Hiding and Authentication Watermarking There are three basic ways of embedding a sequence of bits in binary/halftone images: Pixel-wise: Change the values of (usually pseudo-randomly chosen) individual  ...  In the literature, quite a small number of cryptography-based secure authentication methods are available for binary images.  ...  Barreto for warning us about the possibility of an improved birthday attack against the AWTRAL. One of the authors, H. Y.  ... 
doi:10.1007/978-3-540-31805-7_11 fatcat:jdqhawkctffadfd7w6ypuvvjrm

Watermarking JBIG2 text region for image authentication

S.V.D. Pamboukian, Hae Yong Kim, R.L. de Queiroz
2005 IEEE International Conference on Image Processing 2005  
ABSTRACT An authentication watermarking technique (AWT) inserts hidden data into an image in order to detect any accidental or malicious alteration to the image.  ...  The authentication verification is performed using the same secret-key used in the insertion. JBIG2 is an international standard for lossy and lossless binary image compression.  ...  Usually, a 128 bits long MAC is considered secure. Using AWTRJ, only the owner of the secret-key can insert the valid watermark.  ... 
doi:10.1109/icip.2005.1530246 dblp:conf/icip/PamboukianKQ05 fatcat:uxdlnypg3ndibhqzwncpjvcc2i

Watermarking via zero assigned filter banks

Zeynep Yücel, A. Bülent Özgüler
2010 Signal Processing  
In order to identify the owner and distributor of digital data, a watermarking scheme in frequency domain for multimedia files is proposed.  ...  The information is then inserted in the wavelet-decomposed and compressed signal. Several robustness tests are performed on male voice, female voice, and music files, color and gray level images.  ...  . ; N are of size 128 Â 128.  ... 
doi:10.1016/j.sigpro.2009.07.012 fatcat:xf5ozrfrgjarzdmwztwcdzm2rm

Advanced audio watermarking benchmarking

Jana Dittman, Martin Steinebach, Andreas Lang, Sascha Zmudizinski, Edward J. Delp III, Ping W. Wong
2004 Security, Steganography, and Watermarking of Multimedia Contents VI  
A key issue in the usage of robust watermarking is the evaluation of robustness and security.  ...  StirMark Benchmarking has been taken to set a benchmarking suite for audio watermarking in addition to existing still image evaluation solutions.  ...  While embedding 5 to 10 bits per second of audio data for robust PCM audio watermarking have been seen as satisfying for a long time, today demands like 128 bits in 5 seconds appear.  ... 
doi:10.1117/12.538691 dblp:conf/sswmc/DittmanSLZ04 fatcat:nxyat7dfyvbv5fr7w2jskcvwo4

WAN: Watermarking Attack Network [article]

Seung-Hun Nam, In-Jae Yu, Seung-Min Mun, Daesik Kim, Wonhyuk Ahn
2021 arXiv   pre-print
watermark bit, thereby considerably reducing the watermark extractability.  ...  In addition, these attacks are usually devised without consideration of visual quality, which rarely occurs in the real world.  ...  Watermarked images with resolutions of 128 × 128 and 256 × 256 have a watermark capacity of 4 bits and 16 bits, respectively.  ... 
arXiv:2008.06255v3 fatcat:5btwtuutlbhdtn46j6vtipcqye

A New Crypto-Watermarking Method For Medical Images Safe Transfer

W. Puech, José Rodrigues
2004 Zenodo  
Publication in the conference proceedings of EUSIPCO, Viena, Austria, 2004  ...  We did not give him the supplementary place in the key, but their values are deducted from the effective key of 128 bits, by an operation that we have defined.  ...  The length of the key is 128 bits. Then, we embed the RSA encrypted key in the encrypted image, Figure 5 .c.  ... 
doi:10.5281/zenodo.38352 fatcat:rdqehdyq6nan3ie7l4el35u3ae

Robust Multiple Image Watermarking Based on Spread Transform [chapter]

Jaishree Jain, Vijendra Rai
2012 Watermarking - Volume 2  
Nasir has divided the host image into four different regions each consisting of 128 ×128 blocks in order to hide a watermark [8] .  ...  Therefore, it may be sufficient that the modifications in the watermarked data go unnoticed as long as the data are not compared with the original data.  ...  Watermarking -Volume 2 This collection of books brings some of the latest developments in the field of watermarking.  ... 
doi:10.5772/37546 fatcat:yd6yvy4nejegff5yw3ctmnjpeq
« Previous Showing results 1 — 15 out of 1,790 results