112,22 €
124,69 €
-10% with code: EXTRA
Network Hardening
Network Hardening
112,22
124,69 €
  • We will send in 10–14 business days.
This Springer Brief examines the tools based on attack graphs that help reveal network hardening threats. Existing tools detail all possible attack paths leading to critical network resources. Though no current tool provides a direct solution to remove the threats, they are a more efficient means of network defense than relying solely on the experience and skills of a human analyst. Key background information on attack graphs and network hardening helps readers understand the complexities of th…
  • Publisher:
  • Year: 2014
  • Pages: 60
  • ISBN-10: 331904611X
  • ISBN-13: 9783319046112
  • Format: 15.6 x 23.4 x 0.4 cm, softcover
  • Language: English
  • SAVE -10% with code: EXTRA

Network Hardening (e-book) (used book) | Lingyu Wang | bookbook.eu

Reviews

Description

This Springer Brief examines the tools based on attack graphs that help reveal network hardening threats. Existing tools detail all possible attack paths leading to critical network resources. Though no current tool provides a direct solution to remove the threats, they are a more efficient means of network defense than relying solely on the experience and skills of a human analyst. Key background information on attack graphs and network hardening helps readers understand the complexities of these tools and techniques. A common network hardening technique generates hardening solutions comprised of initially satisfied conditions, thereby making the solution more enforceable. Following a discussion of the complexity issues in this technique, the authors provide an improved technique that considers the dependencies between hardening options and employs a near-optimal approximation algorithm to scale linearly with the size of the inputs. Also included are automated solutions for hardening a network against sophisticated multi-step intrusions. Network Hardening: An Automated Approach to Improving Network Security is a valuable resource for researchers and professionals working in network security. It is also a useful tool for advanced-level students focused on security in computer science and electrical engineering.

EXTRA 10 % discount with code: EXTRA

112,22
124,69 €
We will send in 10–14 business days.

The promotion ends in 20d.19:29:16

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,25 Book Euros!?
  • Author: Lingyu Wang
  • Publisher:
  • Year: 2014
  • Pages: 60
  • ISBN-10: 331904611X
  • ISBN-13: 9783319046112
  • Format: 15.6 x 23.4 x 0.4 cm, softcover
  • Language: English English

This Springer Brief examines the tools based on attack graphs that help reveal network hardening threats. Existing tools detail all possible attack paths leading to critical network resources. Though no current tool provides a direct solution to remove the threats, they are a more efficient means of network defense than relying solely on the experience and skills of a human analyst. Key background information on attack graphs and network hardening helps readers understand the complexities of these tools and techniques. A common network hardening technique generates hardening solutions comprised of initially satisfied conditions, thereby making the solution more enforceable. Following a discussion of the complexity issues in this technique, the authors provide an improved technique that considers the dependencies between hardening options and employs a near-optimal approximation algorithm to scale linearly with the size of the inputs. Also included are automated solutions for hardening a network against sophisticated multi-step intrusions. Network Hardening: An Automated Approach to Improving Network Security is a valuable resource for researchers and professionals working in network security. It is also a useful tool for advanced-level students focused on security in computer science and electrical engineering.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)