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
Changes in Guesswork over Time in Multi-processor Attacks
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (PriSec)
(PriSec)ORCID-id: 0000-0003-0778-4736
2012 (engelsk)Inngår i: Journal of Information Assurance and Security, ISSN 1554-1010, Vol. 7, s. 145-150Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

More and more effort is being spent on security improvements in today's computer networking environments. However, due to the nature of computer security there is still a lack of good quantitative assessment methods. Inventing and developing new ways of measuring security are therefore needed in order to more exact describe, assess, and improve security of computer environments. One existing quantitative security measure is guesswork. Guesswork gives the average number of guesses in a brute force attack when breaking an encrypted message. In the current definition of guesswork it is assumed that the attacker uses a single processor when breaking an encrypted message. However, an intelligent and motivated attacker will likely use several processors that can work in parallel to break an encrypted message. This paper formally investigates how guesswork changes over time in multi-processor attacks. The result is applied on three probability distributions, the English alphabet, the geometric, and the truncated geometric to illustrate some behaviors.

sted, utgiver, år, opplag, sider
Atlanta, GA, USA: Dynamic Publishers Incorporation , 2012. Vol. 7, s. 145-150
Emneord [en]
computer security, guesswork, multi-processor attacks, quantitative assessment, security measures
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-14094DOI: 10.1109/ISIAS.2011.6122810OAI: oai:DiVA.org:kau-14094DiVA, id: diva2:538568
Merknad

Print ISBN 978-1-4577-2154-0

Tilgjengelig fra: 2012-06-29 Laget: 2012-06-29 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 fullteksthttp://www.mirlabs.org/jias/jias_archives.html

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
urn-nbn

Altmetric

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