Results 1 -
3 of
3
Scalable protection for MPEG-4 fine granularity scalability
- IEEE Transactions on Multimedia
, 2005
"... Abstract: 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 enc ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Abstract: 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 PSNR or bitrates, with lower quality layers being accessible and reusable by a higher quality layer of the same type, but not vice versa. Both PSNR and bitrate 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
2.3. PERFECT CONFIDENTIALITY OF MULTI-S01 CIPHER........................................................................... 6
, 2001
"... ..."
Cryptanalysis of a Message Authentication
- Venkatesan, Fast Software Encryption 2004, LNCS 3017
, 2003
"... We present a cryptanalysis of a MAC proposal at CRYPTO 2003 due to Cary and Venkatesan. Our attacks nd collisions for the MAC and yield MAC forgeries, both faster than a straightforward application of the birthday paradox would suggest. ..."
Abstract
- Add to MetaCart
We present a cryptanalysis of a MAC proposal at CRYPTO 2003 due to Cary and Venkatesan. Our attacks nd collisions for the MAC and yield MAC forgeries, both faster than a straightforward application of the birthday paradox would suggest.

