%0 Conference Proceedings
%T Entropy of Selectively Encrypted Strings
%+ Karlstad University [Sweden]
%A Lundin, Reine
%A Lindskog, Stefan
%Z Part 7: Security Attacks and Measures (Short Papers)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 5th Workshop on Information Security Theory and Practices (WISTP)
%C Heraklion, Crete, Greece
%Y Claudio A. Ardagna
%Y Jianying Zhou
%I Springer
%3 Information Security Theory and Practice. Security and Privacy of Mobile Devices in Wireless Communication
%V LNCS-6633
%P 234-243
%8 2011-06-01
%D 2011
%R 10.1007/978-3-642-21040-2_16
%K computer security
%K security measures
%K selective encryption
%K entropy
%Z Computer Science [cs]Conference papers
%X A feature that has become desirable for low-power mobile devices with limited computing and energy resources is the ability to select a security configuration in order to create a trade-off between security and other important parameters such as performance and energy consumption. Selective encryption can be used to create this trade-off by only encrypting chosen units of the information. In this paper, we continue the investigation of the confidentiality implications of selective encryption by applying entropy on a generic selective encryption scheme. By using the concept of run-length vector from run-length encoding theory, an expression is derived for entropy of selectively encrypted strings when the number of encrypted substrings, containing one symbol, and the order of the language change.
%G English
%Z TC 11
%Z WG 11.2
%2 https://inria.hal.science/hal-01573290/document
%2 https://inria.hal.science/hal-01573290/file/978-3-642-21040-2_16_Chapter.pdf
%L hal-01573290
%U https://inria.hal.science/hal-01573290
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-6633