Paper
22 March 2001 Fast encryption methods for audiovisual data confidentiality
Author Affiliations +
Proceedings Volume 4209, Multimedia Systems and Applications III; (2001) https://doi.org/10.1117/12.420829
Event: Information Technologies 2000, 2000, Boston, MA, United States
Abstract
Two methodologies for efficient audiovisual data encryption are studied in this research, i.e. selective encryption and MHT (multiple-Huffman-table). We first discuss benefits and limitations of selective encryption, and propose a selective encryption scheme for ITU G.723.1 speech coding. A review of all cryptanalysis work of selective encryption algorithms in the literature is given, our cryptanalysis for the JPEG/MPEG sign-bit encryption scheme is presented, and two rules to determine whether selective encryption for a compression system is suitable are concluded. Then, we investigate another encryption methodology via the manipulation of Huffman coding tables of multimedia coding systems. The MHT scheme chooses several different Huffman tables from a vast number of possible candidates, and uses them alternatively to encode multimedia data. The choice of Huffman tables and the order that they are used are kept secret as the key. This method requires very little computational overhead, and can be applied to the encryption of MPEG audio, MPEG video and JPEG/JPEG2000 images.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chung-Ping Wu and C.-C. Jay Kuo "Fast encryption methods for audiovisual data confidentiality", Proc. SPIE 4209, Multimedia Systems and Applications III, (22 March 2001); https://doi.org/10.1117/12.420829
Lens.org Logo
CITATIONS
Cited by 94 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Multimedia

Computer security

Multimedia encryption

Cryptanalysis

Internet

Video

Video compression

RELATED CONTENT


Back to Top