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
Security Implications of Selective Encryption
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. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. (Datavetenskap)ORCID-id: 0000-0003-0778-4736
2010 (engelsk)Inngår i: MetriSec'10: Proceedings of the 6th International Workshop on Security Measurements and Metrics, New York: ACM , 2010Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

To be able to perform an analytical and more exact description of security, quantitative security measures are desirable. Two proposed quantitative security measures are entropy and guesswork. When breaking an encrypted message, entropy measures the average number of guesses in an optimal binary search attack, whereas guesswork measures the average number of guesses in an optimal linear search attack. In this paper, we continue to investigate the security implications of a generic selective encryption procedure. That is, how entropy and guesswork changes with the number of encrypted units, i.e., the encryption level. This is done for languages up to thesecond order by deriving equations for entropy of selectively encrypted messages and then transferring the result to guesswork through an equation relating the two measures. Furthermore, unlike entropy, guesswork does not possess the chain rule, however, through the equation relating entropy and guesswork an equation connecting the different guessworks is derived.

sted, utgiver, år, opplag, sider
New York: ACM , 2010.
Emneord [en]
Computer Security, Security Measures, Selective Encryption, Entropy, Guesswork
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-10005DOI: 10.1145/1853919.1853931ISBN: 978-1-4503-0340-8 (tryckt)OAI: oai:DiVA.org:kau-10005DiVA, id: diva2:493521
Konferanse
MetriSec'10 The 6th International Workshop on Security Measurements and Metrics(Conference ESEM '10 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement) Bolzano, Italy — September 16 - 17, 2010
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

Andre lenker

Forlagets fulltekst

Personposter BETA

Lundin, ReineLindskog, Stefan

Søk i DiVA

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

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 389 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