About: Game Theoretic Model of Strategic Honeypot Selection in Computer Networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Game Theoretic Model of Strategic Honeypot Selection in Computer Networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-3-642-34265-3
Description	A honeypot is a decoy computer system used in network security to waste the time and resources of attackers and to analyze their behaviors. While there has been significant research on how to design honeypot systems, less is known about how to use honeypots strategically in network defense. Based on formal deception games, we develop two game-theoretic models that provide insight into how valuable should honeypots look like to maximize the probability that a rational attacker will attack a honeypot. The first model captures a static situation and the second allows attackers to imperfectly probe some of the systems on the network to determine which ones are likely to be real systems (and not honeypots) before launching an attack. We formally analyze the properties of the optimal strategies in the games and provide linear programs for their computation. Finally, we present the optimal solutions for a set of instances of the games and evaluate their quality in comparison to several baselines. A honeypot is a decoy computer system used in network security to waste the time and resources of attackers and to analyze their behaviors. While there has been significant research on how to design honeypot systems, less is known about how to use honeypots strategically in network defense. Based on formal deception games, we develop two game-theoretic models that provide insight into how valuable should honeypots look like to maximize the probability that a rational attacker will attack a honeypot. The first model captures a static situation and the second allows attackers to imperfectly probe some of the systems on the network to determine which ones are likely to be real systems (and not honeypots) before launching an attack. We formally analyze the properties of the optimal strategies in the games and provide linear programs for their computation. Finally, we present the optimal solutions for a set of instances of the games and evaluate their quality in comparison to several baselines. (en)
Title	Game Theoretic Model of Strategic Honeypot Selection in Computer Networks Game Theoretic Model of Strategic Honeypot Selection in Computer Networks (en)
skos:prefLabel	Game Theoretic Model of Strategic Honeypot Selection in Computer Networks Game Theoretic Model of Strategic Honeypot Selection in Computer Networks (en)
skos:notation	RIV/68407700:21230/12:00197018!RIV13-MSM-21230___
http://linked.open...avai/riv/aktivita	P V
http://linked.open...avai/riv/aktivity	P(GAP202/12/2054), V
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Pěchouček, Michal Píbil, Radek Bošanský, Branislav Lisý, Viliam
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	137695
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/12:00197018
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	honeypots; game theory; network security; deception (en)
http://linked.open.../riv/klicoveSlovo	network security deception game theory honeypots
http://linked.open...ontrolniKodProRIV	[347F146BA9BD]
http://linked.open...v/mistoKonaniAkce	Budapest
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Decision and Game Theory for Security
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Bezpečnostní hry v extenzivní formě
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Lisý, Viliam Pěchouček, Michal Kiekintveld, C. D. Píbil, Radek
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-11-05 (xsd:date)
issn	0302-9743
number of pages	20 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-34266-0_12
http://purl.org/ne...btex#hasPublisher	Springer-Verlag, GmbH
https://schema.org/isbn	978-3-642-34265-3
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software