NAL Level Encryption for Scalable Video Coding
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Hash-Based Key Management Schemes for MPEG4-FGS
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Multimedia Tools and Applications
A novel H.264 SVC encryption scheme for secure bit-rate transcoding
PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
A quality-controllable encryption for H.264/AVC video coding
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
A scalable and format-compliant encryption scheme for H.264/SVC bitstreams
Image Communication
No tradeoff between confidentiality and performance: an analysis on H.264/SVC partial encryption
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Hi-index | 0.00 |
The newly adopted MPEG-4 fine granularity scalability (FGS) video coding standard offers easy and flexible adaptation to varying network bandwidths and different application needs. Encryption for FGS should preserve such adaptation capabilities and enable intermediate stages to process encrypted data directly without decryption. In this paper, we propose two novel encryption algorithms for MPEG-4 FGS that meet these requirements. The first algorithm encrypts an FGS stream (containing both the base and the enhancement layers) into a single access layer and preserves the original fine granularity scalability and error resilience performance in an encrypted stream. The second algorithm encrypts an FGS stream into multiple quality layers divided according to either peak signal-to-noise ratio (PSNR) or bit rates, with lower quality layers being accessible and reusable by a higher quality layer of the same type, but not vice versa. Both PSNR and bit-rate layers are supported simultaneously so a layer of either type can be selected on the fly without decryption. The base layer for the second algorithm may be unencrypted to allow free view of the content at low-quality or content-based search of a video database without decryption. Both algorithms are fast, error-resilient, and have negligible compression overhead. The same approach can be applied to other scalable multimedia formats.