A Method Based on Global Attack Graph for Network Hardening
In order to improve the overall security of networks, a method of making strategies for network hardening based on global attack graphs is proposed. This method calculates the reachability of network states by using a global attack graph firstly, and then the security loss of network states and the...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Dapeng Man Yang Wu Yongtian Yang |
| description | In order to improve the overall security of networks, a method of making strategies for network hardening based on global attack graphs is proposed. This method calculates the reachability of network states by using a global attack graph firstly, and then the security loss of network states and the criticality of security elements are got. Security elements are removed based on the rule of maximum-criticality-first. The operability of security enhancement strategies made by this method is better than traditional methods. |
| doi_str_mv | 10.1109/WiCom.2008.1086 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4678994</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4678994</ieee_id><sourcerecordid>4678994</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-6e20e44490168f0f29547a3334d797d5798b337435c7f64a3219b04597de4c9e3</originalsourceid><addsrcrecordid>eNo1jk1Lw0AYhFe0YFtz9uBl_0DifrzZ3RdPMdRUqHop6K1sko2NTbNlExD_vRF1LsPDMMMQcs1ZwjnD29c298dEMGYSzow6IwsOAkBM8HZOItTmn7W-IHPBFY9RgZqRxU8JGVNaXpJoGD7YJEilMXpO7jL65Ma9r-m9HVxNfU-Lzpe2o9k42upAi2BPe9r4QJ_d-OnDga5tqF3f9u9XZNbYbnDRny_J9mG1zdfx5qV4zLNN3CIbY-UEcwCAjCvTsEZgCtpKKaHWqOtUoyml1CDTSjcKrBQcy-nflDmo0MklufmdbZ1zu1NojzZ87UBpgwjyGwmPSbo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Method Based on Global Attack Graph for Network Hardening</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dapeng Man ; Yang Wu ; Yongtian Yang</creator><creatorcontrib>Dapeng Man ; Yang Wu ; Yongtian Yang</creatorcontrib><description>In order to improve the overall security of networks, a method of making strategies for network hardening based on global attack graphs is proposed. This method calculates the reachability of network states by using a global attack graph firstly, and then the security loss of network states and the criticality of security elements are got. Security elements are removed based on the rule of maximum-criticality-first. The operability of security enhancement strategies made by this method is better than traditional methods.</description><identifier>ISSN: 2161-9646</identifier><identifier>ISBN: 9781424421077</identifier><identifier>ISBN: 1424421071</identifier><identifier>EISBN: 142442108X</identifier><identifier>EISBN: 9781424421084</identifier><identifier>DOI: 10.1109/WiCom.2008.1086</identifier><identifier>LCCN: 2008900673</identifier><language>eng</language><publisher>IEEE</publisher><subject>Costs ; Greedy algorithms ; Information security ; Samarium</subject><ispartof>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4678994$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54897</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4678994$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dapeng Man</creatorcontrib><creatorcontrib>Yang Wu</creatorcontrib><creatorcontrib>Yongtian Yang</creatorcontrib><title>A Method Based on Global Attack Graph for Network Hardening</title><title>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</title><addtitle>WiCom</addtitle><description>In order to improve the overall security of networks, a method of making strategies for network hardening based on global attack graphs is proposed. This method calculates the reachability of network states by using a global attack graph firstly, and then the security loss of network states and the criticality of security elements are got. Security elements are removed based on the rule of maximum-criticality-first. The operability of security enhancement strategies made by this method is better than traditional methods.</description><subject>Costs</subject><subject>Greedy algorithms</subject><subject>Information security</subject><subject>Samarium</subject><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><isbn>142442108X</isbn><isbn>9781424421084</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1jk1Lw0AYhFe0YFtz9uBl_0DifrzZ3RdPMdRUqHop6K1sko2NTbNlExD_vRF1LsPDMMMQcs1ZwjnD29c298dEMGYSzow6IwsOAkBM8HZOItTmn7W-IHPBFY9RgZqRxU8JGVNaXpJoGD7YJEilMXpO7jL65Ma9r-m9HVxNfU-Lzpe2o9k42upAi2BPe9r4QJ_d-OnDga5tqF3f9u9XZNbYbnDRny_J9mG1zdfx5qV4zLNN3CIbY-UEcwCAjCvTsEZgCtpKKaHWqOtUoyml1CDTSjcKrBQcy-nflDmo0MklufmdbZ1zu1NojzZ87UBpgwjyGwmPSbo</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Dapeng Man</creator><creator>Yang Wu</creator><creator>Yongtian Yang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200810</creationdate><title>A Method Based on Global Attack Graph for Network Hardening</title><author>Dapeng Man ; Yang Wu ; Yongtian Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-6e20e44490168f0f29547a3334d797d5798b337435c7f64a3219b04597de4c9e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Costs</topic><topic>Greedy algorithms</topic><topic>Information security</topic><topic>Samarium</topic><toplevel>online_resources</toplevel><creatorcontrib>Dapeng Man</creatorcontrib><creatorcontrib>Yang Wu</creatorcontrib><creatorcontrib>Yongtian Yang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dapeng Man</au><au>Yang Wu</au><au>Yongtian Yang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Method Based on Global Attack Graph for Network Hardening</atitle><btitle>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</btitle><stitle>WiCom</stitle><date>2008-10</date><risdate>2008</risdate><spage>1</spage><epage>4</epage><pages>1-4</pages><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><eisbn>142442108X</eisbn><eisbn>9781424421084</eisbn><abstract>In order to improve the overall security of networks, a method of making strategies for network hardening based on global attack graphs is proposed. This method calculates the reachability of network states by using a global attack graph firstly, and then the security loss of network states and the criticality of security elements are got. Security elements are removed based on the rule of maximum-criticality-first. The operability of security enhancement strategies made by this method is better than traditional methods.</abstract><pub>IEEE</pub><doi>10.1109/WiCom.2008.1086</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2161-9646 |
| ispartof | 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-4 |
| issn | 2161-9646 |
| language | eng |
| recordid | cdi_ieee_primary_4678994 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Costs Greedy algorithms Information security Samarium |
| title | A Method Based on Global Attack Graph for Network Hardening |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T09%3A42%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Method%20Based%20on%20Global%20Attack%20Graph%20for%20Network%20Hardening&rft.btitle=2008%204th%20International%20Conference%20on%20Wireless%20Communications,%20Networking%20and%20Mobile%20Computing&rft.au=Dapeng%20Man&rft.date=2008-10&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.issn=2161-9646&rft.isbn=9781424421077&rft.isbn_list=1424421071&rft_id=info:doi/10.1109/WiCom.2008.1086&rft_dat=%3Cieee_6IE%3E4678994%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=142442108X&rft.eisbn_list=9781424421084&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4678994&rfr_iscdi=true |