Security analysis of selectively encrypted MPEG-2 streams

Lookabaugh, Tom; Sicker, Douglas; Keaton, David M.; Guo, Wang; Vedula, Indrani

doi:10.1117/12.512635

Cited by 32 publications

(26 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For an overview of selective encryption and attacks see Engel et al [7] for JPEG2000, and Lookabaugh et al [15] for MPEG-2. Specifically there are attacks which copy structurally similar symbols from one part of the bitstream to another or inject a forged version into the bitstream.…”

Section: Resultsmentioning

confidence: 99%

Selective encryption of the MC EZBC bitstream for DRM scenarios

Hofbauer

Uhl

2009

Proceedings of the 11th ACM Workshop on Multimedia and Security

View full text Add to dashboard Cite

Universal Multimedia Access (UMA) calls for solutions where content is created once and subsequently adapted to given requirements. With regard to UMA and scalability, which is required often due to a wide variety of end clients, the best suited codecs are wavelet based (like the MC-EZBC) due to their inherent high number of scaling options. However, we do not only want to adapt the content to given requirements but we want to do so in a secure way. Through DRM we can ensure that the actual content is safe and copyright is observed. However, traditional encryption removes the option of scalability in the encrypted domain which is opposed to what we want to achieve for UMA. The solution is selective encryption where only a part of the content is encrypted, enough to ensure safety but at the same time little enough to keep scalability intact. Towards this goal we discuss various methods of applying encryption to the bitstream produced by the MC-EZBC in order to keep scalability intact in the encrypted domain while also keeping security intact with regard to various DRM scenarios.

show abstract

Section: Resultsmentioning

confidence: 99%

Selective encryption of the MC EZBC bitstream for DRM scenarios

Hofbauer

Uhl

2009

Proceedings of the 11th ACM Workshop on Multimedia and Security

View full text Add to dashboard Cite

show abstract

“…Unfortunately, if too many syntax elements containing perceptual information are left unencrypted, the security might be compromised. A lot of research [1,8,23,24,26,31,37,39,41] has shown that some perceptual information can be recovered from various kinds of unencrypted syntax elements. This problem is due to the following fact: most multimedia coding standards are designed in such a way that many syntax elements can be decoded independently without decoding other syntax elements.…”

Section: Multimedia Encryptionmentioning

confidence: 99%

On the Performance of Secret Entropy Coding: A Perspective Beyond Security

2012

Autonomous Systems: Developments and Trends

View full text Add to dashboard Cite

In this paper, we study the overall performance of two main forms of secret entropy coding -secret Huffman coding and secret arithmetic coding, as solutions to multimedia encryption. We consider a set of criteria, which include not only security but also other aspects of the performance. We draw the conclusion that neither can fulfill all the criteria, but secret arithmetic coding can offer a better solution. We also point out the possibility of amending existing multimedia coding standards to facilitate multimedia encryption.

show abstract

“…Tang modified the order of coefficient scanning to make the technique more secure 16) . However, Uehara and Safavi-Naini 25) , and Qiao Lookabaugh et al reviewed these proposals and proposed a combination method of encryption and compression 26) .…”

Section: Related Workmentioning

confidence: 99%

[Paper] Practical Update of Scrambling Scheme and its Security Analysis

Ogawa¹,

Inoue²

2018

MTA

View full text Add to dashboard Cite

Content distributed by broadcast and multicast services is often encrypted (scrambled) to protect copyrighted material. When any cryptanalysis of the current cryptographic scheme used in such services is found, the scheme must be updated. However, the scheme cannot be updated suddenly because a lot of subscribers have receivers with the current scheme.We have previously proposed two cryptographic scheme updating methods. The two methods have trade-off relationship between security and transmission bit rate. However, our security analysis was insufficient. We revisit the security analysis on the methods. In addition, we show a new strong attack against the methods and we evaluate the security against the new attack. As a result, we show that, even if the new attack is implemented in a pirate receiver (PR), its probability to reconstruct content in real-time is very small and that the proposed methods are secure against such a new attack from the viewpoint of service quality. Totally, we show the update methods are practical and secure.

show abstract

Security analysis of selectively encrypted MPEG-2 streams

Cited by 32 publications

References 21 publications

Selective encryption of the MC EZBC bitstream for DRM scenarios

Selective encryption of the MC EZBC bitstream for DRM scenarios

On the Performance of Secret Entropy Coding: A Perspective Beyond Security

[Paper] Practical Update of Scrambling Scheme and its Security Analysis

Contact Info

Product

Resources

About