skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · colloquia · 2002-2003 · 
 

Colloquium - Lookabaugh

 
4/24/2003
3:30pm-4:30pm
ECCR 265

Multimedia and Security Selective Encryption
Tom D. Lookabaugh
Department of Interdisciplinary Telecommunications

Most multimedia content is compressed to save on communication bandwidth or storage; although the cost of both has declined rapidly, the cost of computation has declined even faster so ubiquitous compression makes sense. Moreover, much multimedia content needs to be secured for privacy or for rights management. Increasingly, then, multimedia is subject to both compression and encryption operations.

Tom Lookabaugh photo

Selective encryption leverages this now common combination; rather than encrypt all the content, we only encrypt a small but critical fraction, relying on the characteristics of compression algorithms to make the remainder (in the clear) unusable. This basic idea has occurred to a number of authors in scattered applications, including MPEG-1 video, wireless video, MP-3 audio, and G.723 audio. But the fundamental idea has much broader applicability, both in terms of the range of compression and encryption algorithms that can be exploited and in terms of functionality.

For example, selective encryption can be used to reduce computational complexity, a potentially important feature in any kind of portable multimedia application. (Indeed, this feature is likely to be important outside of multimedia as well.) It can allow for the overlaying of multiple security systems on a single multimedia stream with low overhead (a commercially important application in digital television). It can allow for efficient caching of bulk "in-the-clear" content close to users while providing a small fraction of encrypted content at decode time from more distant locations.

This presentation starts the process of building a comprehensive theoretical basis for selective encryption (and the more general variable encryption), and takes a cryptanalytic approach to validating the security implications; both of these are novel contributions to the field. The commercially important MPEG-2 algorithm is taken as a test case and selective encryption choices and their security consequences are experimentally analyzed. From this work, we validate the key insight that practical high performance selective encryption will be strongly dependent on the way in which the compressor is operated: a cooperative compressor can yield good security even with a low fraction of encryption, while an antagonistic compressor can easily undermine selective encryption unless much higher fractions of the content are encrypted (while a neutral compressor might do either).


The Department holds colloquia throughout the Fall and Spring semesters. These colloquia, open to the public, are typically held on Thursday afternoons, but sometimes occur at other times as well. If you would like to receive email notification of upcoming colloquia, subscribe to our Colloquia Mailing List. If you would like to schedule a colloquium, see Colloquium Scheduling.

Sign language interpreters are available upon request. Please contact Stephanie Morris at least five days prior to the colloquium.

 
See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Questions/Comments?
Send email to

Engineering Center Office Tower
ECOT 717
+1-303-492-7514
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:29)
 
.