The Experts below are selected from a list of 561 Experts worldwide ranked by ideXlab platform
Yishin Tung - One of the best experts on this subject based on the ideXlab platform.
-
an efficient memory construction scheme for an arbitrary side growing Huffman Table
International Conference on Multimedia and Expo, 2006Co-Authors: Sungwen Wang, Shangchih Chuang, Chihchieh Hsiao, Yishin TungAbstract:By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGH-tree), we construct a memory efficient Huffman Table on the basis of an arbitrary-side growing Huffman tree (AGH-tree) to speed up the Huffman decoding. Simulation results show that, in Huffman decoding, an AGH-tree based Huffman Table is 2.35 times faster that of the Hashemian's method (an SGH-tree based one) and needs only one-fifth the corresponding memory size. In summary, a novel Huffman Table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage
-
ICME - An Efficient Memory Construction Scheme for an Arbitrary Side Growing Huffman Table
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Sungwen Wang, Shangchih Chuang, Chihchieh Hsiao, Yishin TungAbstract:By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGH-tree), we construct a memory efficient Huffman Table on the basis of an arbitrary-side growing Huffman tree (AGH-tree) to speed up the Huffman decoding. Simulation results show that, in Huffman decoding, an AGH-tree based Huffman Table is 2.35 times faster that of the Hashemian's method (an SGH-tree based one) and needs only one-fifth the corresponding memory size. In summary, a novel Huffman Table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage
-
An efficient encryption scheme for MPEG video
2005 Digest of Technical Papers. International Conference on Consumer Electronics 2005. ICCE., 2005Co-Authors: In-kuan Cheong, Yishin Tung, Yi-chin Huang, Wen-chin ChenAbstract:We propose an encryption scheme for MPEG video, which uses a permuted Huffman Table to encode the input symbols, and then rotates and XORs (exclusive or) the encoded bit stream. This scheme adds very little computational overhead to the MPEG video compression process, and therefore the implementation is fast enough to meet the real-time requirement of MPEG video applications. In our analysis, it is also robust to both plaintext and ciphertext attacks. In addition, our scheme can be applied to all MPEG compression standards.
Yan Chen - One of the best experts on this subject based on the ideXlab platform.
-
security analysis of multimedia encryption schemes based on multiple Huffman Table
IEEE Signal Processing Letters, 2007Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan Chen, Oscar C AuAbstract:This letter addresses the security issues of the multimedia encryption schemes using multiple Huffman Table (MHT). A known-plaintext attack is presented to show that the MHTs used for encryption should be carefully selected to avoid the weak keys problem. We then propose chosen-plaintext attacks on the basic MHT algorithm as well as the enhanced scheme with random bit insertion. In addition, we suggest two empirical criteria for Huffman Table selection, based on which we can simplify the stream cipher integrated scheme, while ensuring a high level of security
-
on the security of multimedia encryption schemes based on multiple Huffman Table mht
International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.
-
ICME - On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.
Jiantao Zhou - One of the best experts on this subject based on the ideXlab platform.
-
security analysis of multimedia encryption schemes based on multiple Huffman Table
IEEE Signal Processing Letters, 2007Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan Chen, Oscar C AuAbstract:This letter addresses the security issues of the multimedia encryption schemes using multiple Huffman Table (MHT). A known-plaintext attack is presented to show that the MHTs used for encryption should be carefully selected to avoid the weak keys problem. We then propose chosen-plaintext attacks on the basic MHT algorithm as well as the enhanced scheme with random bit insertion. In addition, we suggest two empirical criteria for Huffman Table selection, based on which we can simplify the stream cipher integrated scheme, while ensuring a high level of security
-
on the security of multimedia encryption schemes based on multiple Huffman Table mht
International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.
-
ICME - On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.
Sungwen Wang - One of the best experts on this subject based on the ideXlab platform.
-
an efficient memory construction scheme for an arbitrary side growing Huffman Table
International Conference on Multimedia and Expo, 2006Co-Authors: Sungwen Wang, Shangchih Chuang, Chihchieh Hsiao, Yishin TungAbstract:By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGH-tree), we construct a memory efficient Huffman Table on the basis of an arbitrary-side growing Huffman tree (AGH-tree) to speed up the Huffman decoding. Simulation results show that, in Huffman decoding, an AGH-tree based Huffman Table is 2.35 times faster that of the Hashemian's method (an SGH-tree based one) and needs only one-fifth the corresponding memory size. In summary, a novel Huffman Table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage
-
ICME - An Efficient Memory Construction Scheme for an Arbitrary Side Growing Huffman Table
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Sungwen Wang, Shangchih Chuang, Chihchieh Hsiao, Yishin TungAbstract:By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGH-tree), we construct a memory efficient Huffman Table on the basis of an arbitrary-side growing Huffman tree (AGH-tree) to speed up the Huffman decoding. Simulation results show that, in Huffman decoding, an AGH-tree based Huffman Table is 2.35 times faster that of the Hashemian's method (an SGH-tree based one) and needs only one-fifth the corresponding memory size. In summary, a novel Huffman Table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage
Zhiqin Liang - One of the best experts on this subject based on the ideXlab platform.
-
security analysis of multimedia encryption schemes based on multiple Huffman Table
IEEE Signal Processing Letters, 2007Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan Chen, Oscar C AuAbstract:This letter addresses the security issues of the multimedia encryption schemes using multiple Huffman Table (MHT). A known-plaintext attack is presented to show that the MHTs used for encryption should be carefully selected to avoid the weak keys problem. We then propose chosen-plaintext attacks on the basic MHT algorithm as well as the enhanced scheme with random bit insertion. In addition, we suggest two empirical criteria for Huffman Table selection, based on which we can simplify the stream cipher integrated scheme, while ensuring a high level of security
-
on the security of multimedia encryption schemes based on multiple Huffman Table mht
International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.
-
ICME - On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)
2006 IEEE International Conference on Multimedia and Expo, 2006Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan ChenAbstract: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.