Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Entropy of Selectively Encrypted Strings
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. (Datavetenskap)
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (Datavetenskap)
2011 (English)In: Information Security Theory and Practice: Security and Privacy of Mobile Devices in Wireless Communication / [ed] Claudio A. Ardagna, Jianying Zhou, Springer Berlin/Heidelberg, 2011, 234-243 p.Conference paper, (Refereed)
Abstract [en]

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

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2011. 234-243 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6633
Keyword [en]
computer security, security measures, selective encryption, entropy
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-10425ISI: 000306225000016ISBN: 978-3-642-21040-2 (print)OAI: oai:DiVA.org:kau-10425DiVA: diva2:493959
Conference
WISTP11 - 5th IFIP WG 11.2 International Workshop in Information Security Theory and Practice, Heraklion, Crete, Greece, June 1-3, 2011
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2015-12-29Bibliographically approved
In thesis
1. Guesswork and Entropy as Security Measures for Selective Encryption
Open this publication in new window or tab >>Guesswork and Entropy as Security Measures for Selective Encryption
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

More and more effort is being spent on security improvements in today's computer environments, with the aim to achieve an appropriate level of security. However, for small computing devices it might be necessary to reduce the computational cost imposed by security in order to gain reasonable performance and/or energy consumption. To accomplish this selective encryption can be used, which provides confidentiality by only encrypting chosen parts of the information. Previous work on selective encryption has chiefly focused on how to reduce the computational cost while still making the information perceptually secure, but not on how computationally secure the selectively encrypted information is. 

Despite the efforts made and due to the harsh nature of computer security, good quantitative assessment methods for computer security are still lacking. Inventing new ways of measuring security are therefore needed in order to better understand, assess, and improve the security of computer environments. Two proposed probabilistic quantitative security measures are entropy and guesswork. Entropy gives the average number of guesses in an optimal binary search attack, and guesswork gives the average number of guesses in an optimal linear search attack. In information theory, a considerable amount of research has been carried out on entropy and on entropy-based metrics. However, the same does not hold for guesswork.

In this thesis, we evaluate the performance improvement when using the proposed generic selective encryption scheme. We also examine the confidentiality strength of selectively encrypted information by using and adopting entropy and guesswork. Moreover, since guesswork has been less theoretical investigated compared to entropy, we extend guesswork in several ways and investigate some of its behaviors.

Place, publisher, year, edition, pages
Karlstad: Karlstad University Press, 2012. 30 p.
Series
Karlstad University Studies, ISSN 1403-8099 ; 2012:36
Keyword
Computer security, security metrics, selective encryption, confidentiality, entropy, guesswork.
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-14032 (URN)978-91-7063-443-7 (ISBN)
Public defence
2012-09-27, 9C 203, Karlstads universitet, 65187 Karlstad, 13:15 (English)
Opponent
Supervisors
Available from: 2012-09-04 Created: 2012-06-28 Last updated: 2012-09-04Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lundin, ReineLindskog, Stefan
By organisation
Department of Computer ScienceCentre for HumanIT
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 335 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf