The present invention concerns a method for encrypting a compressed video stream, particularly allowing to reinforce the level of security and at the same time not penalising the resources during the decryption.
Video compression algorithms are based on the fact that generally the differences between an image and the following one are small, and that the expression of the differences represents a quantity of information much smaller than the whole image. It has been observed that from one image to the other a great amount of information does not change and even is found in a slightly different plane. This principle is applied in the formats of the MPEG-2, MPEG-3, or Quick Time type.
According to these algorithms, a first image, called of reference, is transmitted completely and an analysis of the following images is carried out in order to determine and transmit the differences. According to the MPEG standard we distinguish the frames transmitted integrally (I-Frame) and the differential data of the MV (movement vector) type and of the DFD (difference between the MV model and the real image) type.
According to the known solutions, these data are then encrypted according to an algorithm adapted to the desired level of security. In order to maintain a compatibility during the transmission and the processing, each group is encrypted by itself, that is, that the attribution of the frames remains visible, only the content is encrypted.
With the evolution of storage means it is common to transmit encrypted data, representing for example a film, towards the unit of a user.
Once the file is stored in the user, unit, a third party can have all the necessary time to try to decrypt the data.
In order to avoid this risk, a first approach consists in increasing the level of security on the file, that is, to use powerful algorithms with long keys.
Although this technique is satisfying on the level of security, it presents the inconvenience of requiring important resources on the decryption unit.
The diversification of viewing means progress towards the use of data by units having limited cryptographic capacities. This is the case, for example, of the new mobile telephones that have a view screen. For this type of unit, the use of sophisticated algorithms in real time is not possible without degrading the performance of the unit.
Thus, the use of blocks of data encrypted by powerful algorithms is not incompatible with all types of user units.
The objective of the present application is to enable the use of powerful algorithms with terminals that have limited cryptographic capacities.
This objective is achieved by an encryption method for a compressed video stream, comprising independent data blocks and differential data blocks, comprising encrypting the independent data blocks and the differential data blocks according to different levels of encryption.
“Independent data block” means information allowing one to obtain the decompressed signal without reference to the previous information. It can be, for example, complete frames (I-Frames).
“Differential data block” means information allowing one to obtain the decompressed signal by modification of the previous signal by applying this differential information.
In fact, this solution allows the concentration of the maximum security on the information indispensable for the decompression of the images. According to this method, a first algorithm is applied on the complete (I-Frame) of the compressed video signal, and a second algorithm is applied to the differential information of the MV type or of the DFD type.
This difference can also be accomplished by the use of keys of a different length according to the type of data. Thus, the complete frames will be encrypted by a key of 2048 bits, while the differential information will be encrypted by a key of 128 bits.
According to one embodiment of the invention, the differential information is not encrypted.
It should be noted that other sources of information that work on the differential principle can also use this method. This is the case for example of the compressed music according to the MP3 format.
The present invention will be better understood with the aid of the annexed figures, taken as non-limiting, in which:
In
In the same way, the complete frame 12 is followed by successive differential frames P/B 2–3 allowing for the rebuilding of the complete frame 13.
This stream is then selectively encrypted according to the type of frame illustrated in
The length of the keys k1 and k2 is given here as an example and could be of any other length.
According to the invention, the difference of quality of the encryption can be done at the level of the keys or at the level of the algorithm used. Thus, the encryption according to k1 represents for example an algorithm of the IDEA type, and the encryption according to k2 represents an algorithm of the DES type.
During the transmission of this stream, the complete frames are sent at first as illustrated by
According to an embodiment of the invention, the level of encryption for the complete frames is different depending on if it is a first frame, such as the frame 11, or the following frames (12 and 13). In fact, to benefit from the decrypted and decompressed signal, we have to immediately process the first frame and then the frames of differences. This is why the first frame of a series is encrypted with a faster decryption algorithm than the following complete frames. This algorithm can be the same than the one for the differential frames or another algorithm.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IB02/00557 | 2/25/2002 | WO | 00 | 12/6/2002 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO02/069638 | 9/6/2002 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5623549 | Ritter | Apr 1997 | A |
5838791 | Torii et al. | Nov 1998 | A |
5949884 | Adams et al. | Sep 1999 | A |
6185679 | Coppersmith et al. | Feb 2001 | B1 |
6314186 | Lee et al. | Nov 2001 | B1 |
6490353 | Tan | Dec 2002 | B1 |
6950517 | Hawkes et al. | Sep 2005 | B2 |
20040039908 | Rose et al. | Feb 2004 | A1 |
Number | Date | Country |
---|---|---|
0 984 630 | Mar 2000 | EP |
Number | Date | Country | |
---|---|---|---|
20030133571 A1 | Jul 2003 | US |