On the Performance of Secret Entropy Coding: A Perspective Beyond Security
Tools
Tools
Tools
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, 389 - 401. ISBN 978-3-642-24805-4
![[img]](/style/images/fileicons/application_pdf.png)
| PDF (licence) 32Kb | |
| PDF Available under License : See the attached licence file. 130Kb |
Official URL: http://dx.doi.org/10.1007/978-3-642-24806-1_30
Abstract
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 |
|---|---|
| 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. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 532424 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 22 Jun 2012 14:53 |
| Last Modified: | 07 Apr 2013 14:33 |
Document Downloads
Repository Staff Only: item control page