kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Strategies of Honeypot Placement in Cyberspace
KTH, School of Electrical Engineering and Computer Science (EECS).
KTH, School of Electrical Engineering and Computer Science (EECS).
2023 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In order to improve cyber security and deceive potential attackers, strategies forcyber defense must be developed and continuously improved. The purpose of thisarticle was to investigate how to protect an organization against cyberattackscontrolled by humans. This was done by comparing six defense strategies anddetermine which strategy is best at deceiving a potential attacker.

The strategies were analyzed using a game called HoneyGame where the defensealgorithms place traps, so called honeypots, on different nodes. The players chose toattack one of six nodes during each round, earning points for evading honeypots andlosing points for encountering them. The players' goal is to get as many points aspossible. The performance of each strategy and the behavior of the attacker were bothinvestigated.

In the study, it is concluded that strategies that are adaptive or incorporate somedegree of randomness perform best against a potential attacker. These turned out tobe the most difficult for attackers to figure out over time. The strategies that appearedstatic were quickly outsmarted by the players, learning which nodes to attack.Learning with Linear Rewards is concluded to be the best algorithm.

Abstract [sv]

För att förbättra cybersäkerhet och vilseleda potentiella angripare måste strategiermot cyberattacker utvecklas och ständigt förbättras. Syftet med dettakandidatexamensarbete var att undersöka hur en kan försvara en organisation motcyberattacker utförda av människor. Detta genom att jämföra sex försvarsstrategieroch avgöra vilken strategi som är bäst på att vilseleda en potentiell angripare.

Strategierna analyserades med hjälp av ett spel som kallas HoneyGame därförsvarsalgoritmerna placerar fällor, så kallade honungsfällor, på olika noder.Spelarna valde att attackera en av sex noder varje omgång och fick poäng om deundvek en honungsfälla och förlorade poäng om de träffade en honungsfälla.Spelarnas mål var att få så många poäng som möjligt. Hur väl strategierna presterademot potentiella angripare och beteendet hos angriparen undersöktes.

Slutsatsen av studien är att strategier som är adaptiva eller använder någon form avslumpmässighet fungerar bäst mot en potentiell angripare. Dessa strategier visade sigvara svårast att överlista under spelets gång. Strategierna som var statiska blevsnabbt överlistade av spelarna som lärde sig vilka noder som skulle attackeras för attmaximera sin poäng. Den bästa strategin visade sig vara Learning with LinearRewards.

Place, publisher, year, edition, pages
2023. , p. 657-668
Series
TRITA-EECS-EX ; 2023:194
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-341784OAI: oai:DiVA.org:kth-341784DiVA, id: diva2:1823495
Supervisors
Examiners
Projects
Kandidatexjobb i elektroteknik 2023, KTH, StockholmAvailable from: 2024-01-02 Created: 2024-01-02

Open Access in DiVA

fulltext(211487 kB)445 downloads
File information
File name FULLTEXT01.pdfFile size 211487 kBChecksum SHA-512
69786101c351a58f7bd524c3aeee40c661028b577366c4a725033372b88c624c87c2183b6acca2d3d43bbd2bb2f3942326c69263e70c99cf1db027ce9c4e9ae2
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 445 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 444 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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