Correlations in complex networks under attack

Srivastava, Animesh; Mitra, Bivas; Ganguly, Niloy; Peruani, Fernando

doi:10.1103/physreve.86.036106

Cited by 20 publications

(13 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the network G 0 has no degree correlations, G τ generated by removing nodes randomly from G 0 with a probability depending only on the degree is also uncorrelated [29]. Therefore, the conditional probability is presented by P τ (k |k) = k P τ (k )/ k τ , where k τ is the average degree of G τ , and φ τ is written as…”

Section: Size Of the Giant Componentmentioning

confidence: 99%

Robustness of scale-free networks to cascading failures induced by fluctuating loads

Mizutaka

Yakubo

2015

Phys. Rev. E

View full text Add to dashboard Cite

Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks against cascading overload failures induced by fluctuating loads. In our model, loads are described by random walkers moving on a network and a node fails when the number of walkers on the node is beyond the node capacity. Our results obtained by using the generating function method show that scale-free networks are more robust against cascading overload failures than Erdős-Rényi random graphs with homogeneous degree distributions. This conclusion is contrary to that predicted by previous works, which neglect the effect of fluctuations of loads.

show abstract

Section: Size Of the Giant Componentmentioning

confidence: 99%

Robustness of scale-free networks to cascading failures induced by fluctuating loads

Mizutaka

Yakubo

2015

Phys. Rev. E

View full text Add to dashboard Cite

show abstract

“…To consider the network topology, the rumor diffusion models on small-world network [22] and SFNs [21,23,24] have been described.…”

Section: Related Workmentioning

confidence: 99%

“…The Daley-Kendal and MK models have a serious weakness; these models do not take into account the topology of the underlying networks along with the rumor propagation process [21]. To consider the network topology, the rumor diffusion models on small-world network [22] and SFNs [21,23,24] have been described.…”

Section: Related Workmentioning

confidence: 99%

Dynamics of a rumor‐spreading model with diversity of configurations in scale‐free networks

Hosseini

Azgomi

Rahmani

2015

Int J Communication

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose a new rumor-spreading model, which is a variant of the susceptible-exposedinfectious-removed epidemic model. We consider the influences of the diversity of configurations as a defense strategy to diminish the damage brought by rumor diffusion. The diversity of configuration can be found in different instant messengers or social networks. Moreover, we apply two kinds of the rumor immunization strategies such as random immunization and targeted immunization and show that targeted immunization is better than random immunization for rumor-spreading control in scale-free networks. We carry out the systematic analysis of the model and study the local and global stability of rumor-free equilibrium. In the proposed model, we introduce two new states, namely, hibernator and stifler2, to study dynamical behaviors of the model. The proposed model combines both targeted immunization and diversity of configuration to prevent rumor spreading. By numerical simulations, we indicate that our model is appreciably better than other models in terms of declining the rumor diffusion speed. Furthermore, we investigate many related dynamic properties to make the result more complete. Simulation results show the effect of different parameters on the rumor diffusion in scale-free networks; meanwhile, numerical simulations confirm the theoretical solution.

show abstract

“…network connectivity) [13]- [16]. These attacks target the physical layer of network connection, and applicable to all higher level network-oriented protocols.…”

Section: Network Attacks Of Dh Integration In Protocolsmentioning

confidence: 99%

Network-Specific Attacks on Diffie-Hellman Key-Exchange in Commercial Protocols

Fathirad¹,

Devlin²,

Atshani³

2016

IJCTE

View full text Add to dashboard Cite

Abstract-An efficient and reliable key-establishment method is the most important building block of any secure cryptographic channels. Public-key cryptography was a revolution in cyber security key administration and enabled peers to dynamically create keys for each cryptographic session. The Diffie-Hellman (DH) algorithm is the first published public-key cryptosystem. DH and its variants are extensively investigated, standardized, and widely used in network security protocols. However, DH is vulnerable to some concerning mathematical, implementation-related and network-specific attacks. Defending against these attacks is important in secure implementation of DH in network protocols. This paper categorizes various attacks on DH scheme with focuses on attacks related to the DH integration in network protocols (referred as network-specific attacks). Furthermore, we comparatively review the approaches taken by commercial protocols to tackle network attacks and analyze the strength of these solutions.

show abstract

Correlations in complex networks under attack

Cited by 20 publications

References 20 publications

Robustness of scale-free networks to cascading failures induced by fluctuating loads

Robustness of scale-free networks to cascading failures induced by fluctuating loads

Dynamics of a rumor‐spreading model with diversity of configurations in scale‐free networks

Network-Specific Attacks on Diffie-Hellman Key-Exchange in Commercial Protocols

Contact Info

Product

Resources

About