2006 IEEE International Conference on Multimedia and Expo
On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)
Toronto, ON, Canada
July 09-July 12
ISBN: 1-4244-0366-7
Jiantao Zhou, Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China. Email: eejtzhou@ust.hk
Zhiqin Liang, Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China. Email: zhiqin@ust.hk
Yan Chen, Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China. Email: eecyan@ust.hk
Oscar Au, Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China. Email: eeau@ust.hk
This paper addresses the security issues of the multimedia encryption schemes based on multiple Huffman table (MHT). A detailed analysis of known-plaintext attack is presented to show that the Huffman tables used for encryption should be carefully selected to avoid the weak keys problem. Further, we propose an efficient chosen-plaintext attack on the basic MHT method as well as the enhanced scheme inserting random bits. We also show that random rotation in partitioned bit stream cannot essentially improve the security.
Citation:
Jiantao Zhou, Zhiqin Liang, Yan Chen, Oscar Au, "On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)," icme, pp.2185-2188, 2006 IEEE International Conference on Multimedia and Expo, 2006
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb