Abstract : In this work an efficient format-compliant encryption approach for regular languages is proposed, block-based cycle-walking. The approach can transparently trade-off security for efficiency and can be adjusted to the desired level of security. The relationship between the encryption of regular languages and the encryption of JPEG2000 bitstreams is established. Block-based cycle-walking for the regular language of JPEG2000 bitstreams is compared to the extensive previous work from the multimedia security community and to the previous work from the cryptographic community, which is analyzed and evaluated.
Type de document :
Communication dans un congrès
Bart Decker; Ingrid Schaumüller-Bichl. 11th IFIP TC 6/TC 11 International Conference on Communications and Multimedia Security (CMS), May 2010, Linz, Austria. Springer, Lecture Notes in Computer Science, LNCS-6109, pp.81-92, 2010, Communications and Multimedia Security. 〈10.1007/978-3-642-13241-4_9〉
https://hal.inria.fr/hal-01056365
Contributeur : Hal Ifip
<>
Soumis le : lundi 18 août 2014 - 18:18:45
Dernière modification le : vendredi 11 août 2017 - 15:29:23
Document(s) archivé(s) le : mardi 11 avril 2017 - 20:05:11
Thomas Stütz, Andreas Uhl. Efficient Format-Compliant Encryption of Regular Languages: Block-Based Cycle-Walking. Bart Decker; Ingrid Schaumüller-Bichl. 11th IFIP TC 6/TC 11 International Conference on Communications and Multimedia Security (CMS), May 2010, Linz, Austria. Springer, Lecture Notes in Computer Science, LNCS-6109, pp.81-92, 2010, Communications and Multimedia Security. 〈10.1007/978-3-642-13241-4_9〉. 〈hal-01056365〉
