找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Network Hardening; An Automated Approac Lingyu Wang,Massimiliano Albanese,Sushil Jajodia Book 2014 The Author(s) 2014 Attack graph.Intrusio

[復(fù)制鏈接]
查看: 23204|回復(fù): 37
樓主
發(fā)表于 2025-3-21 16:15:02 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Network Hardening
副標(biāo)題An Automated Approac
編輯Lingyu Wang,Massimiliano Albanese,Sushil Jajodia
視頻videohttp://file.papertrans.cn/663/662806/662806.mp4
概述Includes supplementary material:
叢書名稱SpringerBriefs in Computer Science
圖書封面Titlebook: Network Hardening; An Automated Approac Lingyu Wang,Massimiliano Albanese,Sushil Jajodia Book 2014 The Author(s) 2014 Attack graph.Intrusio
描述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 networ
出版日期Book 2014
關(guān)鍵詞Attack graph; Intrusion prevention; Network hardening; Network security; Penetration testing; Vulnerabili
版次1
doihttps://doi.org/10.1007/978-3-319-04612-9
isbn_softcover978-3-319-04611-2
isbn_ebook978-3-319-04612-9Series ISSN 2191-5768 Series E-ISSN 2191-5776
issn_series 2191-5768
copyrightThe Author(s) 2014
The information of publication is updating

書目名稱Network Hardening影響因子(影響力)




書目名稱Network Hardening影響因子(影響力)學(xué)科排名




書目名稱Network Hardening網(wǎng)絡(luò)公開度




書目名稱Network Hardening網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Network Hardening被引頻次




書目名稱Network Hardening被引頻次學(xué)科排名




書目名稱Network Hardening年度引用




書目名稱Network Hardening年度引用學(xué)科排名




書目名稱Network Hardening讀者反饋




書目名稱Network Hardening讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:33:40 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:23:24 | 只看該作者
Book 2014ths 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 hardenin
地板
發(fā)表于 2025-3-22 05:37:35 | 只看該作者
Minimum-Cost Network Hardening,rusions. More specifically, we first represent given critical resources as a logic proposition of initial conditions. We then simplify the proposition to make hardening options explicit. Among the options we finally choose solutions with the minimum cost.
5#
發(fā)表于 2025-3-22 12:20:26 | 只看該作者
Linear-Time Network Hardening,ble actions, and define a cost model that takes into account the impact of interdependent hardening actions. We also introduce a near-optimal approximation algorithm that scales linearly with the size of the graphs, which we validate experimentally.
6#
發(fā)表于 2025-3-22 13:03:02 | 只看該作者
7#
發(fā)表于 2025-3-22 17:29:03 | 只看該作者
Book 2014 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 networ
8#
發(fā)表于 2025-3-22 22:05:29 | 只看該作者
2191-5768 rk against sophisticated multi-step intrusions. Network Hardening: An Automated Approach to Improving Network Security is a valuable resource for researchers and professionals working in networ978-3-319-04611-2978-3-319-04612-9Series ISSN 2191-5768 Series E-ISSN 2191-5776
9#
發(fā)表于 2025-3-23 05:02:25 | 只看該作者
10#
發(fā)表于 2025-3-23 05:56:14 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 04:19
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
满洲里市| 镇坪县| 汝阳县| 长沙市| 周至县| 瓦房店市| 沾化县| 水城县| 汨罗市| 鸡泽县| 土默特左旗| 大名县| 兴业县| 中西区| 宁乡县| 娄烦县| 紫金县| 循化| 特克斯县| 武冈市| 皮山县| 建瓯市| 边坝县| 许昌市| 赤城县| 长岛县| 土默特左旗| 普兰县| 左权县| 建平县| 宿州市| 武强县| 贵阳市| 常山县| 长武县| 巴彦县| 新田县| 斗六市| 泸溪县| 弥渡县| 涿州市|