research-article

A New Complex Network Robustness Attack Algorithm

Authors:

Keke GaiAuthors Info & Claims

BSCI '19: Proceedings of the 2019 ACM International Symposium on Blockchain and Secure Critical Infrastructure

Pages 13 - 17

https://doi.org/10.1145/3327960.3332385

Published: 02 July 2019 Publication History

Abstract

Complex networks have been widely used in many systems of bank, social networks and smart grid, etc. A vital quantitative criteria for complex networks is to measure the robust performance in those systems. It observes the response of the networks when nodes or links are removed from potential threats. Most of the existing works focus on the enhancement of the robustness itself, but not considering the completeness of the possible removal attacks from the viewpoint of adversary. In this paper, we first propose a new RL-based critical edge removal attack (RCERA) algorithm, and prove that the damage of the robustness using the proposed algorithm is worse than that using the existing degree product attack and random edge attack. In order to solve the uncertainty of the network robustness evaluation algorithm proposed before, we propose a new complex network robustness evaluation algorithm. Finally we apply our attack algorithm to a Bitcoin OTC network. The result shows that our algorithm is better than the other two algorithm.

References

[1]

L. Amaral and J. Ottino. Complex networks. The European Physical Journal B, 38(2):147--162, 2004.

[2]

R. Albert and A. Barabási. Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.

[3]

M. Newman. Networks. Oxford university press, 2018.

Digital Library

[4]

D. Watts and S. Strogatz. Collective dynamics of small-world networks. nature, 393(6684):440, 1998.

[5]

A. Barabási and R. Albert. Emergence of scaling in random networks. science, 286(5439):509--512, 1999.

[6]

J. Dowling and G. Wald. The biological function of vitamin-a acid. NUTRITION REVIEWS, 39(3):135--138, 1981.

[7]

A. Zeng and G. Cimini. Removing spurious interactions in complex networks. Physical Review E, 85(3):036101, 2012.

[8]

K. Gai, K.K.R. Choo, M. Qiu, and L. Zhu. Privacy-preserving content-oriented wireless communication in internet-of-things. IEEE Internet of Things Journal, 5(4):3059--3067, 2018.

[9]

K. Gai, Y. Wu, L. Zhu, M. Qiu, and M. Shen. Privacy-preserving energy trading using consortium blockchain in smart grid. IEEE Transactions on Industrial Informatics, PP(99):1, 2019.

[10]

B. Shargel, H. Sayama, I. Epstein, and Y. Bar-Yam. Optimization of robustness and connectivity in complex networks. Physical review letters, 90(6):068701, 2003.

[11]

E. Estrada. Network robustness to targeted attacks. the interplay of expansibility and degree distribution. The European Physical Journal B-Condensed Matter and Complex Systems, 52(4):563--574, 2006.

[12]

A. Moreira, J. Andrade, H. Herrmann, and J. Indekeu. How to make a fragile network robust and vice versa. Physical review letters, 102(1):018701, 2009.

[13]

V. Louzada, F. Daolio, H. Herrmann, and M. Tomassini. Smart rewiring for network robustness. Journal of Complex networks, 1(2):150--159, 2013.

[14]

C. Schneider, A. Moreira, J. Andrade, S. Havlin, and H. Herrmann. Mitigation of malicious attacks on networks. Proceedings of the National Academy of Sciences, 108(10):3838--3841, 2011.

[15]

G. Paul, T. Tanizawa, S. Havlin, and H. Stanley. Optimization of robustness of complex networks. The European Physical Journal B, 38(2):187--191, 2004.

[16]

K. Gai, Y. Wu, L. Zhu, L. Xu, and Y. Zhang. Permissioned blockchain and edge computing empowered privacy-preserving smart grid networks. IEEE Internet of Things Journal, PP(99):1, 2019.

[17]

T. Tanizawa, G. Paul, R. Cohen, S. Havlin, and H. Stanley. Optimization of network robustness to waves of targeted and random attacks. Physical review E, 71(4):047101, 2005.

[18]

Z. Zhou. Ensemble learning. Encyclopedia of biometrics, pages 411--416, 2015.

[19]

Y.Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119--139, 1997.

Digital Library

[20]

R. Albert, H. Jeong, and A. Barabási. Error and attack tolerance of complex networks. nature, 406(6794):378, 2000.

[21]

A. Beygelzimer, G. Grinstein, R. Linsker, and I. Rish. Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications, 357(3--4):593--612, 2005.

[22]

J. Wu, M. Barahona, Y. Tan, and H. Deng. Spectral measure of structural robustness in complex networks. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 41(6):1244--1252, 2011.

Digital Library

[23]

V.Latora and M. Marchiori. Efficient behavior of small-world networks. Physical review letters, 87(19):198701, 2001.

[24]

M. Fiedler. Algebraic connectivity of graphs. Czechoslovak mathematical journal, 23(2):298--305, 1973.

[25]

L. Bu, R. Babu, B. De Schutter, et al. A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 38(2):156--172, 2008.

Digital Library

[26]

Y. Chang, T. Ho, and L. Kaelbling. Mobilized ad-hoc networks: A reinforcement learning approach. In International Conference on Autonomic Computing, 2004. Proceedings., pages 240--247. IEEE, 2004.

Digital Library

[27]

W. Huang, G. Song, H. Hong, and K. Xie. Deep architecture for traffic flow prediction: deep belief networks with multitask learning. IEEE Transactions on Intelligent Transportation Systems, 15(5):2191--2201, 2014.

[28]

J. Zhang, Y. Zheng, and D. Qi. Deep spatio-temporal residual networks for citywide crowd flows prediction. In Thirty-First AAAI Conference on Artificial Intelligence, 2017.

Digital Library

[29]

A. Zeng and W. Liu. Enhancing network robustness against malicious attacks. Physical Review E, 85(6):066130, 2012.

[30]

M. Newman. Mixing patterns in networks. Physical Review E, 67(2):026126, 2003. {31} L. Freeman. A set of measures of centrality based on betweenness. Sociometry, pages 35--41, 1977.

[31]

P. Holme, B. Kim, C. Yoon, and S. Han.Attack vulnerability of complex networks. Physical review E, 65(5):056109, 2002.

[32]

S. Kumar, F. Spezzano, V. Subrahmanian, and C. Faloutsos. Edge weight prediction in weighted signed networks. In Data Mining (ICDM), 2016 IEEE 16th International Conference on, pages 221--230. IEEE, 2016.

Cited By

Lou YWang LChen G(2023) Structural Robustness of Complex Networks: A Survey of A Posteriori Measures [Feature] IEEE Circuits and Systems Magazine10.1109/MCAS.2023.323665923:1(12-35)Online publication date: Sep-2024
https://doi.org/10.1109/MCAS.2023.3236659
Lou YWang LXie SChen G(2023)Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal AttacksInternational Journal of Control, Automation and Systems10.1007/s12555-021-0831-421:2(376-388)Online publication date: 30-Jan-2023
https://doi.org/10.1007/s12555-021-0831-4
Cao JLi JHou L(2022)Attack research of multilayer network vulnerability in the urban transport systemInternational Conference on Signal Processing and Communication Security (ICSPCS 2022)10.1117/12.2655174(5)Online publication date: 2-Nov-2022
https://doi.org/10.1117/12.2655174
Show More Cited By

Index Terms

A New Complex Network Robustness Attack Algorithm
1. Computing methodologies
  1. Artificial intelligence
2. Networks
  1. Network performance evaluation
    1. Network performance analysis

Recommendations

On the robustness of Lightning Network in Bitcoin
Abstract
An off-chain transaction protocol called Lightning Network was recently introduced to enable low-fee and micropayment transactions on the top of the Bitcoin network. This technology has the potential to solve the inherent scalability ...
Robustness analysis of electricity networks against failure or attack: The case of the Australian National Electricity Market (NEM)
Abstract
This study explores network science algorithms for the robustness analysis of electricity networks. We first investigate the characteristics of key network models including random graphs, small-world, and scale-free networks. Then, ...
Robustness of Dengue Complex Network under Targeted versus Random Attack

Dengue virus infection is one of those epidemic diseases that require much consideration in order to save the humankind from its unsafe impacts. According to the World Health Organization (WHO), 3.6 billion individuals are at risk because of the dengue ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

BSCI '19: Proceedings of the 2019 ACM International Symposium on Blockchain and Secure Critical Infrastructure

July 2019

134 pages

ISBN:9781450367868

DOI:10.1145/3327960

Program Chairs:
Keke Gai
Beijing Institute of Technology, China
,
Kim-Kwang Raymond Choo
University of Texas at San Antonio, USA
,
Debiao He
Wuhan University, China
,
Sheng Wen
Swinburne University of Technology, Australia

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 July 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

China National Key Research and

Conference

Asia CCS '19

Sponsor:

SIGSAC

Asia CCS '19: ACM Asia Conference on Computer and Communications Security

July 8, 2019

Auckland, New Zealand

Acceptance Rates

BSCI '19 Paper Acceptance Rate 44 of 12 submissions, 367%;

Overall Acceptance Rate 44 of 12 submissions, 367%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
245
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lou YWang LChen G(2023) Structural Robustness of Complex Networks: A Survey of A Posteriori Measures [Feature] IEEE Circuits and Systems Magazine10.1109/MCAS.2023.323665923:1(12-35)Online publication date: Sep-2024
https://doi.org/10.1109/MCAS.2023.3236659
Lou YWang LXie SChen G(2023)Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal AttacksInternational Journal of Control, Automation and Systems10.1007/s12555-021-0831-421:2(376-388)Online publication date: 30-Jan-2023
https://doi.org/10.1007/s12555-021-0831-4
Cao JLi JHou L(2022)Attack research of multilayer network vulnerability in the urban transport systemInternational Conference on Signal Processing and Communication Security (ICSPCS 2022)10.1117/12.2655174(5)Online publication date: 2-Nov-2022
https://doi.org/10.1117/12.2655174
Alwasel B(2022)Efficient Restoration of Structural Controllability Under Malicious Edge Attacks for Complex NetworksAdvanced Information Networking and Applications10.1007/978-3-030-99584-3_14(152-166)Online publication date: 31-Mar-2022
https://doi.org/10.1007/978-3-030-99584-3_14
Xu ZZhang W(2021)QuickCDC: A Quick Content Defined Chunking Algorithm Based on Jumping and Dynamically Adjusting Mask Bits2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00049(288-299)Online publication date: Sep-2021
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00049
Montes-Orozco EMora-Gutiérrez RObregón-Quintana Bde-los-Cobos-Silva SRincón-García ELara-Velázquez PGutiérrez-Andrade M(2021)Methodology to quantify robustness in networks: case study—Higher Education System in MexicoComputing10.1007/s00607-021-00909-xOnline publication date: 11-Feb-2021
https://doi.org/10.1007/s00607-021-00909-x

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten