Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Entropy of Selectively Encrypted Strings
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. (Datavetenskap)
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (Datavetenskap)ORCID-id: 0000-0003-0778-4736
2011 (engelsk)Inngår i: Information Security Theory and Practice: Security and Privacy of Mobile Devices in Wireless Communication / [ed] Claudio A. Ardagna, Jianying Zhou, Springer Berlin/Heidelberg, 2011, s. 234-243Konferansepaper, Publicerat paper (Fagfellevurdert)
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

sted, utgiver, år, opplag, sider
Springer Berlin/Heidelberg, 2011. s. 234-243
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6633
Emneord [en]
computer security, security measures, selective encryption, entropy
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-10425ISI: 000306225000016ISBN: 978-3-642-21040-2 (tryckt)OAI: oai:DiVA.org:kau-10425DiVA, id: diva2:493959
Konferanse
WISTP11 - 5th IFIP WG 11.2 International Workshop in Information Security Theory and Practice, Heraklion, Crete, Greece, June 1-3, 2011
Tilgjengelig fra: 2012-02-08 Laget: 2012-02-08 Sist oppdatert: 2018-01-12bibliografisk kontrollert
Inngår i avhandling
1. Guesswork and Entropy as Security Measures for Selective Encryption
Åpne denne publikasjonen i ny fane eller vindu >>Guesswork and Entropy as Security Measures for Selective Encryption
2012 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Karlstad: Karlstad University Press, 2012. s. 30
Serie
Karlstad University Studies, ISSN 1403-8099 ; 2012:36
Emneord
Computer security, security metrics, selective encryption, confidentiality, entropy, guesswork.
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-14032 (URN)978-91-7063-443-7 (ISBN)
Disputas
2012-09-27, 9C 203, Karlstads universitet, 65187 Karlstad, 13:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2012-09-04 Laget: 2012-06-28 Sist oppdatert: 2018-06-25bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Personposter BETA

Lundin, ReineLindskog, Stefan

Søk i DiVA

Av forfatter/redaktør
Lundin, ReineLindskog, Stefan
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 394 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf