This paper proposes a new video watermarking scheme based on a hierarchical motion analysis, that is robust against classical video processing (filtering, lossy compression...). This model works in the uncompressed domain and disturbs the motion vectors computed by an exhaustive BMA on blocks of size n*n in order to insert an invisible watermark enabling a protection against most attacks. Finally, to increase the robustness, our system inserts the mark by generating a hierarchy of motion vectors of size N*N with N=k*n to spread the mark on the lower level associated to block n*n.

Multimedia data security is very important for multimedia commerce on the Internet such as "pay-per-view" services. Thus, watermarking algorithms for data security appear. These algorithms describe methods and technologies that allow information to be hidden, for example a number or text, into a media, such as images, video, audio files... In this paper, we propose a new application of watermarking based on a scrambling process. In this application, we develop a waterscrambling technique in which video data are scrambled efficiently by disturbing a subset of motion vectors. The interest of this approach is its ability to scramble a video while maintaining a certain visibility. Effectively it permits the use of considerable levels of security in order to choose the level of perceptibility of the video. By using watermarking techniques we will be able to combine this approach with a classical copyright watermarking system.