On the Performance of Secret Entropy Coding: A Perspective Beyond Security
Li, SJ (2012) On the Performance of Secret Entropy Coding: A Perspective Beyond Security In: Autonomous Systems: Developments and Trends. Studies in Computational Intelligence, 391 . Springer, pp. 389-401. ISBN 978-3-642-24805-4
Available under License : See the attached licence file.
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.
|Item Type:||Book Section|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Additional Information :||This is the author’s version of a paper published in Autonomous Systems: Developments and Trends, edited by Herwig Unger, Kyandoghere Kyamaky and Janusz Kacprzyk, Studies in Computational Intelligence, vol. 391, pp. 389-401, Springer-Verlag GmbH, 2011. The original publication is available at www.springerlink.com.|
|Depositing User :||Symplectic Elements|
|Date Deposited :||22 Jun 2012 13:53|
|Last Modified :||23 Sep 2013 19:26|
Actions (login required)
Downloads per month over past year