%0 Conference Proceedings
%T Are 128 Bits Long Keys Possible in Watermarking?
%+ Centrale Lille
%+ Multimedia content-based indexing (TEXMEX)
%A Bas, Patrick
%A Furon, Teddy
%Z Part 3: Extended Abstracts
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th International Conference on Communications and Multimedia Security (CMS)
%C Canterbury, United Kingdom
%Y Bart Decker
%Y David W. Chadwick
%I Springer
%3 Communications and Multimedia Security
%V LNCS-7394
%P 191-191
%8 2012-09-03
%D 2012
%R 10.1007/978-3-642-32805-3_15
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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 2n?
%G English
%Z TC 6
%Z TC 11
%2 https://inria.hal.science/hal-01540890/document
%2 https://inria.hal.science/hal-01540890/file/978-3-642-32805-3_15_Chapter.pdf
%L hal-01540890
%U https://inria.hal.science/hal-01540890
%~ EC-PARIS
%~ UNIV-RENNES1
%~ CNRS
%~ INRIA
%~ INSA-RENNES
%~ INRIA-RENNES
%~ IRISA
%~ IRISA_SET
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-TC6
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ IFIP-CMS
%~ UR1-UFR-ISTIC
%~ IFIP-LNCS-7394
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ INSA-GROUPE
%~ UR1-MATH-NUM