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
Guesswork and Entropy as Security Measures for Selective Encryption
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (PriSec)
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 [en]
Computer security, security metrics, selective encryption, confidentiality, entropy, guesswork.
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-14032ISBN: 978-91-7063-443-7 (tryckt)OAI: oai:DiVA.org:kau-14032DiVA, id: diva2:537964
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
Delarbeid
1. Middleware Support for Tunable Encryption
Åpne denne publikasjonen i ny fane eller vindu >>Middleware Support for Tunable Encryption
2006 (engelsk)Inngår i: Wireless Information Systems: Proceedings of the 5th International Workshop on Wireless Information Systems / [ed] Qusay H. Mahmoud, Hans Weghorn, Setubal , Portugal: INSTICC Press , 2006, s. 36-46Konferansepaper, Oral presentation only (Fagfellevurdert)
Abstract [en]

To achieve an appropriate tradeoff between security and performance for wireless applications, a tunable and differential treatment of security is required.

In this paper, we present a tunable encryption service designed as a middleware that is based on a selective encryption paradigm. The core component of the middleware provides block-based selective encryption. Although the selection of which data to encrypt is made by the sending application and is typically content-dependent, the representation used by the core component is application and content-independent. This frees the selective decryption module at the receiver from the need for application or content-specific knowledge. The sending application specifies the data to encrypt either directly or through a set of highlevel application interfaces. A prototype implementation of the middleware isdescribed along with an initial performance evaluation. The experimental results demonstrate that the generic middleware service offers a high degree of security adaptiveness at a low cost.

 

sted, utgiver, år, opplag, sider
Setubal , Portugal: INSTICC Press, 2006
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-1919 (URN)978-972-8865-48-1 (ISBN)
Konferanse
The 5th International Workshop on Wireless Information Systems, WIS 2006, in conjunction with ICEIS 2006, Paphos, Cyprus, May 2006
Tilgjengelig fra: 2007-10-09 Laget: 2007-10-09 Sist oppdatert: 2018-06-04bibliografisk kontrollert
2. Using Guesswork as a Measure for Confidentiality of Selectively Encrypted Messages
Åpne denne publikasjonen i ny fane eller vindu >>Using Guesswork as a Measure for Confidentiality of Selectively Encrypted Messages
2006 (engelsk)Inngår i: Quality of Protection: Security Measurements and Metrics / [ed] Dieter Gollmann, Fabio Massacci and Artsiom Yautsiukhin, Boston: Springer, 2006, s. 173-184Kapittel i bok, del av antologi (Fagfellevurdert)
Abstract [en]

n this paper, we start to investigate the security implications of selective encryption. We do this by using the measure guesswork, which gives us the expected number of guesses that an attacker must perform in an optimal brute force attack to reveal an encrypted message. The characteristics of the proposed measure are investigated for zero-order languages. We also introduce the concept of reduction chains to describe how the message (or rather search) space changes for an attacker with different levels of encryption.

sted, utgiver, år, opplag, sider
Boston: Springer, 2006
Serie
Advances in Information Security, ISSN 1568-2633 ; 23-4
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-1915 (URN)10.1007/978-0-387-36584-8_14 (DOI)
Tilgjengelig fra: 2007-10-09 Laget: 2007-10-09 Sist oppdatert: 2018-06-04bibliografisk kontrollert
3. On the Relationship between Confidentiality Measures: Entropy and Guesswork
Åpne denne publikasjonen i ny fane eller vindu >>On the Relationship between Confidentiality Measures: Entropy and Guesswork
2007 (engelsk)Inngår i: WOSIS / [ed] Mariemma Inmaculada Yagüe del Valle and Eduardo Fernández-Medina, INSTICC Press , 2007, s. 135-144Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this paper, we investigate in detail the relationship between entropy and guesswork. The aim of the study is to lay the ground for future efficiency comparison of guessing strategies. After a short discussion of the two measures, and the differences between them, the formal definitions are given. Then, a redefinition of guesswork is made, since the measure is not completely accurate. The change is a minor modification in the last term of the sum expressing guesswork. Finally, two theorems are stated. The first states that the redefined guesswork is equal to the concept of cross entropy, and the second states, as a consequence of the first theorem, that the redefined guesswork is equal to the sum of the entropy and the relative entropy.

sted, utgiver, år, opplag, sider
INSTICC Press, 2007
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-1916 (URN)978-972-8865-96-2 (ISBN)
Konferanse
Proceedings of the 5th International Workshop on Security in Information Systems (WOSIS 2007), In conjunction with ICEIS 2007, Funchal, Madeira, Portugal, June 2007
Tilgjengelig fra: 2007-10-09 Laget: 2007-10-09 Sist oppdatert: 2019-07-12bibliografisk kontrollert
4. Joint and Conditional Guesswork: Definitions and Implications
Åpne denne publikasjonen i ny fane eller vindu >>Joint and Conditional Guesswork: Definitions and Implications
2011 (engelsk)Inngår i: Journal of Information Assurance and Security, ISSN 1554-1010, Vol. 6, nr 2, s. 89-97Artikkel i tidsskrift (Fagfellevurdert) Published
sted, utgiver, år, opplag, sider
Atlanta, GA, USA: Dynamic Publishers Incorporation, 2011
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-10424 (URN)
Tilgjengelig fra: 2012-02-08 Laget: 2012-02-08 Sist oppdatert: 2018-01-12bibliografisk kontrollert
5. Changes in Guesswork over Time in Multi-processor Attacks
Åpne denne publikasjonen i ny fane eller vindu >>Changes in Guesswork over Time in Multi-processor Attacks
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
Emneord
computer security, guesswork, multi-processor attacks, quantitative assessment, security measures
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-14094 (URN)10.1109/ISIAS.2011.6122810 (DOI)
Merknad

Print ISBN 978-1-4577-2154-0

Tilgjengelig fra: 2012-06-29 Laget: 2012-06-29 Sist oppdatert: 2018-01-12bibliografisk kontrollert
6. Security Implications of Selective Encryption
Åpne denne publikasjonen i ny fane eller vindu >>Security Implications of Selective Encryption
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
Computer Security, Security Measures, Selective Encryption, Entropy, Guesswork
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-10005 (URN)10.1145/1853919.1853931 (DOI)978-1-4503-0340-8 (ISBN)
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
7. Entropy of Selectively Encrypted Strings
Åpne denne publikasjonen i ny fane eller vindu >>Entropy of Selectively Encrypted Strings
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
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6633
Emneord
computer security, security measures, selective encryption, entropy
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-10425 (URN)000306225000016 ()978-3-642-21040-2 (ISBN)
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

Open Access i DiVA

fulltext(964 kB)1758 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 964 kBChecksum SHA-512
03245de58425921d213f3f98244330b531d9b2bd11fe5fbd568369a0c2701d5a0eeb315a3b0eeb85af055c185cc06b5b3821fdf0e56d220471dbc4a4e94acea0
Type fulltextMimetype application/pdf

Personposter BETA

Lundin, Reine

Søk i DiVA

Av forfatter/redaktør
Lundin, Reine
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 1758 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

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