Log in

Relevant bibliographies by topics / Network attack

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Network attack'

Author: Grafiati

Published: 4 June 2021

Last updated: 12 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Network attack.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Network attack"

1

Ahmed, Abdulghani Ali. "Investigation Approach for Network Attack Intention Recognition." International Journal of Digital Crime and Forensics 9, no. 1 (2017): 17–38. http://dx.doi.org/10.4018/ijdcf.2017010102.

Full text

Abstract:

Sensitive information has critical risks when transmitted through computer networks. Existing protection systems still have limitations with treating network information with sufficient confidentiality, integrity, and availability. The rapid development of network technologies helps increase network attacks and hides their malicious intentions. Attack intention is the ultimate attack goal that the attacker attempts to achieve by executing various intrusion methods or techniques. Recognizing attack intentions helps security administrator develop effective protection systems that can detect network attacks that have similar intentions. This paper analyses attack types and classifies them according to their malicious intent. An investigation approach based on similarity metric is proposed to recognize attacker plans and predict their intentions. The obtained results demonstrate that the proposed approach is capable of investigating similarity of attack signatures and recognizing the intentions of Network attack.

APA, Harvard, Vancouver, ISO, and other styles

2

Singhal, Prateek, Puneet Sharma, and Deepak Arora. "An approach towards preventing iot based sybil attack based on contiki framework through cooja simulator." International Journal of Engineering & Technology 7, no. 2.8 (2018): 261. http://dx.doi.org/10.14419/ijet.v7i2.8.10421.

Full text

Abstract:

In this paper we propagate the Sybil attack in WSN (Wireless sensor network), by the researchers many attacks have been recognized in WSN till now and there are many attacks which can attack over through internet, Internet of thing means all devices is interconnected to each other M2M over internet and can be attacked by any of the attacker on any devices. Sybil attack is the detrimental attack against sensor network where several counterfeit identities and legitimate identities are used to get prohibited pass in a network. This is major attack which results an information loss and misinterpretation in the network, and it also minimizes the routing disturbance, trustworthiness and dropping sensitivity packets into a network. In this instance node can trust the imaginary node and sharing of information starts, owed to this security of node is get affected and information is lost. In this paper, a survey of CONTIKI OS-2.7, stimulation tool COOJA and the Sybil attack and proposed the defense mechanisms and CAM (Compare and Match) approach to verify the Sybil attack position and prevent it. This Sybil attack can be stimulated on the stimulation tool COOJA which helps to identify the attacker position node, whereas these attacks outcome in uni-casting as well as multicasting and in this paper specifically given the secure security for Wireless sensor network.

APA, Harvard, Vancouver, ISO, and other styles

3

Winda Andrini Wulandari. "THE ANALYSIS NETWORK FORENSICS USING HONEYPOT ON PUBLIC CLOUD COMPUTING SERVICE NETWORK." Jurnal Teknologi Informasi Universitas Lambung Mangkurat (JTIULM) 3, no. 1 (2018): 18–25. http://dx.doi.org/10.20527/jtiulm.v3i1.24.

Full text

Abstract:

This research presents visualization in dashboard using AWN campus honeypot log data connected to IHP (Kemkominfo) Jakarta on public cloud computing service network to categorize time stamp in data. Package attack data is divided into three categories namely morning, noon, and night based on Time Western Indonesia (WIB). DDoS attacks attacked several ports 21, 80, 135, and 445. K -means clustering method is implemented in this research to get categorization result of time of effective attack to know DDoS attack attack and cyber profilling which is expected to help monitoring process of anticipation of vulnerability cloud network of ddos / cyber crime attacks. The results of this study indicate that the method used to obtain results in accordance with the objectives.

APA, Harvard, Vancouver, ISO, and other styles

4

Qin, Yuan. "Computer Network Attack Modeling and Network Attack Graph Study." Advanced Materials Research 1079-1080 (December 2014): 816–19. http://dx.doi.org/10.4028/www.scientific.net/amr.1079-1080.816.

Full text

Abstract:

With the development of computer network and rapid popularity of Internet, network information security has become the focus of safeguarding national security and social stability. In the network security event, the hacker often can’t successfully intrude into the network by means of a single host / services hacker. With the help of various kinds of "vulnerability" generated bydifferent relationship existing in multiple point multiple host, the hacker can achieve the purpose of network intrusion. Therefore one important aspect of network security is after obtaining the vulnerability of the network information, considering a combination of multiple exploits and analyzing the attack path of network penetration attacks that the attacker may take.

APA, Harvard, Vancouver, ISO, and other styles

5

Park, Sanglee, and Jungmin So. "On the Effectiveness of Adversarial Training in Defending against Adversarial Example Attacks for Image Classification." Applied Sciences 10, no. 22 (2020): 8079. http://dx.doi.org/10.3390/app10228079.

Full text

Abstract:

State-of-the-art neural network models are actively used in various fields, but it is well-known that they are vulnerable to adversarial example attacks. Throughout the efforts to make the models robust against adversarial example attacks, it has been found to be a very difficult task. While many defense approaches were shown to be not effective, adversarial training remains as one of the promising methods. In adversarial training, the training data are augmented by “adversarial” samples generated using an attack algorithm. If the attacker uses a similar attack algorithm to generate adversarial examples, the adversarially trained network can be quite robust to the attack. However, there are numerous ways of creating adversarial examples, and the defender does not know what algorithm the attacker may use. A natural question is: Can we use adversarial training to train a model robust to multiple types of attack? Previous work have shown that, when a network is trained with adversarial examples generated from multiple attack methods, the network is still vulnerable to white-box attacks where the attacker has complete access to the model parameters. In this paper, we study this question in the context of black-box attacks, which can be a more realistic assumption for practical applications. Experiments with the MNIST dataset show that adversarially training a network with an attack method helps defending against that particular attack method, but has limited effect for other attack methods. In addition, even if the defender trains a network with multiple types of adversarial examples and the attacker attacks with one of the methods, the network could lose accuracy to the attack if the attacker uses a different data augmentation strategy on the target network. These results show that it is very difficult to make a robust network using adversarial training, even for black-box settings where the attacker has restricted information on the target network.

APA, Harvard, Vancouver, ISO, and other styles

6

Sehrawat, Harkesh, Yudhvir Singh, and Vikas Siwach. "Analysis of AODV protocol under sinkhole attack in wireless sensor network." International Journal of Engineering & Technology 7, no. 2.4 (2018): 153. http://dx.doi.org/10.14419/ijet.v7i2.4.13028.

Full text

Abstract:

A Wireless Sensor Network (WSNs) is a collection of number of sensor nodes which are left open in an unsecured environment. Sensor nodes work and communicate together to attain the desired goals. They are placed at the locations where monitoring is otherwise impossible. Wireless Sensor Networks are resource constrained which may be computational power, memory capacity, battery power etc. As Wireless Sensor Networks are implemented in the unattended environment, they are prone to discrete type of security attacks. Because of their limitations these networks are easily targeted by intruders. Sinkhole attack is one of the security attacks which try to disturb the ongoing communication in wireless sensor network. In sinkhole attack, the intruder or the malicious node try to attract the network traffic towards itself, that sensor nodes will pass data packets through this compromised node thereby manipulating messages which sensor nodes are transferring to the base station. In this paper we analyze the impact of Sinkhole attack on AODV protocol under various conditions. We analyzed the impact of Sinkhole attack on AODV protocol with varying number of attacker nodes.

APA, Harvard, Vancouver, ISO, and other styles

7

Gandhi, Kaushal, Rajneesh Narula, Sumeer Khullar, and Anish Arora. "Security Issues of Routing Protocols in MANETs." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 2 (2012): 339–42. http://dx.doi.org/10.24297/ijct.v3i2c.2894.

Full text

Abstract:

There are a number of routing protocols developed by researchers. Due to the nature of ad hoc networks, secure routing is an important area of research in developing secure routing protocols. Although researchers have proposed several secure routing protocols, their resistance towards various types of security attacks and efficiency are primary points of concern in implementing these protocols. This paper presents some of the available secure routing protocols and most common attack patterns against ad hoc networks. Routing protocols are subjected to case studies against the most commonly identified attack patterns such as: denial-of-service attack, tunneling, spoofing, black hole attack and wormhole attack etc. In MANET, the nodes also function as routers that discover and maintain routes to other nodes in the network. Establishing an optimal and efficient route between the communicating parties is the primary concern of the routing protocols of MANET. Any attack in routing phase may disrupt the overall communication and the entire network can be paralyzed. Thus, security in network layer plays an important role in the security of the whole network. A number of attacks in network layer have been identified and studied in security research. An attacker can absorb network traffic, inject themselves into the path between the source and destination and thus control the network traffic flow.

APA, Harvard, Vancouver, ISO, and other styles

8

Moskal, Stephen, Shanchieh Jay Yang, and Michael E. Kuhl. "Cyber threat assessment via attack scenario simulation using an integrated adversary and network modeling approach." Journal of Defense Modeling and Simulation: Applications, Methodology, Technology 15, no. 1 (2017): 13–29. http://dx.doi.org/10.1177/1548512917725408.

Full text

Abstract:

Existing research on cyber threat assessment focuses on analyzing the network vulnerabilities and producing possible attack graphs. Cyber attacks in real-world enterprise networks, however, vary significantly due to not only network and system configurations, but also the attacker’s strategies. This work proposes a cyber-based attacker behavior model (ABM) in conjunction with the Cyber Attack Scenario and Network Defense Simulator to model the interaction between the network and the attackers. The ABM leverages a knowledge-based design and factors in the capability, opportunity, intent, preference, and Cyber Attack Kill Chain integration to model various types of attackers. By varying the types of attackers and the network configurations, and simulating their interactions, we present a method to measure the overall network security against cyber attackers under different scenarios. Simulation results based on four attacker types on two network configurations are shown to demonstrate how different attacker behaviors may lead to different ways to penetrate a network, and how a single misconfiguration may impact network security.

APA, Harvard, Vancouver, ISO, and other styles

9

Podobnik, B., D. Horvatic, T. Lipic, M. Perc, J. M. Buldú, and H. E. Stanley. "The cost of attack in competing networks." Journal of The Royal Society Interface 12, no. 112 (2015): 20150770. http://dx.doi.org/10.1098/rsif.2015.0770.

Full text

Abstract:

Real-world attacks can be interpreted as the result of competitive interactions between networks, ranging from predator–prey networks to networks of countries under economic sanctions. Although the purpose of an attack is to damage a target network, it also curtails the ability of the attacker, which must choose the duration and magnitude of an attack to avoid negative impacts on its own functioning. Nevertheless, despite the large number of studies on interconnected networks, the consequences of initiating an attack have never been studied. Here, we address this issue by introducing a model of network competition where a resilient network is willing to partially weaken its own resilience in order to more severely damage a less resilient competitor. The attacking network can take over the competitor's nodes after their long inactivity. However, owing to a feedback mechanism the takeovers weaken the resilience of the attacking network. We define a conservation law that relates the feedback mechanism to the resilience dynamics for two competing networks. Within this formalism, we determine the cost and optimal duration of an attack, allowing a network to evaluate the risk of initiating hostilities.

APA, Harvard, Vancouver, ISO, and other styles

10

Yan, Yao, and Rui Xu. "DDoS Attacks for Ad Hoc Network Based on Attack Cluster." Advanced Materials Research 546-547 (July 2012): 1371–76. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1371.

Full text

Abstract:

Show the definition of Ad Hoc network attack cluster, and propose a new method of DDoS attacks for Ad Hoc Networks, which can accurately attack the target node, demonstrate no redundant aggressive behavior compared with the traditional attack and reduce the detection rate of aggressive behavior. Use NS2 simulation platform to build Ad Hoc network simulation scenarios with dynamic topology, and simulate DDoS attacks in this environment; The simulation results show that the new DDoS attack method can effectively reduce the communication ability of the Ad Hoc network, and increasing the attack node density will strengthen the attack effect.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Network attack"

1

Avidan, Lenoy. "Dynamic Shifting of Virtual Network Topologies for Network Attack Prevention." DigitalCommons@CalPoly, 2019. https://digitalcommons.calpoly.edu/theses/1986.

Full text

Abstract:

Computer networks were not designed with security in mind, making research into the subject of network security vital. Virtual Networks are similar to computer networks, except the components of a Virtual Network are in software rather than hardware. With the constant threat of attacks on networks, security is always a big concern, and Virtual Networks are no different. Virtual Networks have many potential attack vectors similar to physical networks, making research into Virtual Network security of great importance. Virtual Networks, since they are composed of virtualized network components, have the ability to dynamically change topologies. In this paper, we explore Virtual Networks and their ability to quickly shift their network topology. We investigate the potential use of this flexibility to protect network resources and defend against malicious activities. To show the ability of reactively shifting a Virtual Network’s topology to se- cure a network, we create a set of four experiments, each with a different dynamic topology shift, or “dynamic defense”. These four groups of experiments are called the Server Protection, Isolated Subnet, Distributed Port Group, and Standard Port Group experiments. The Server Protection experiments involve detecting an attack against a server and shifting the server behind a protected subnet. The other three sets of experiments, called Attacker Prevention experiments, involve detecting a malicious node in the internal network and initiating a dynamic de- fense to move the attacker behind a protected subnet. Each Attacker Prevention experiment utilizes a different dynamic defense to prevent the malicious node from attacking the rest of the Virtual Network. For each experiment, we run 6 different network attacks to validate the effectiveness of the dynamic defenses. The network attacks utilized for each experiment are ICMP Flooding, TCP Syn Flooding, Smurf attack, ARP Spoofing, DNS Spoofing, and NMAP Scanning. Our validation shows that our dynamic defenses, outside of the standard port group, are very effective in stopping each attack, consistently lowering the at- tacks’ success rate significantly. The Standard Port Group was the one dynamic defense that is ineffective, though there are also a couple of experiments that could benefit from being run with more attackers and with different situations to fully understand the effectiveness of the defenses. We believe that, as Virtual Networks become more common and utilized outside of data centers, the ability to dynamically shift topology can be used for network security purposes.

APA, Harvard, Vancouver, ISO, and other styles

2

Karaaslan, Ibrahim. "Anti-sensor Network: Distortion-based Distributed Attack In Wireless Sensor Networks." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609276/index.pdf.

Full text

Abstract:

In this thesis, a novel anti-sensor network paradigm is introduced against wireless sensor networks (WSN). Anti-sensor network (ASN) aims to destroy application reliability by adaptively and anonymously introducing adequate level of artificial distortion into the communication of the event features transported from the sensor nodes (SN) to the sink. ASN is composed of anti-sensor nodes (aSN) randomly distributed over the sensor network field. aSNs pretend to be SNs tomaintain anonymity and so improve resiliency against attack detection and prevention mechanisms. Performance evaluations via mathematical analysis and simulation experiments show that ASN can effectively reduce the application reliability of WSN.

APA, Harvard, Vancouver, ISO, and other styles

3

Gerbert, Oscar. "Attack on the Chaos Sensor Network Protocol." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-260480.

Full text

Abstract:

As the demand for wireless sensor networks increases the need for new protocols with specific ways of distributing data emerges. Chaos is one of those protocols. Chaos has no native security countermeasures implemented, therefore it is important to test how vulnerable it is against attacks. In this thesis I present four novel attacks to test the robustness of Chaos. Experiments show that a Drizzle-attack was the most effective attack, strategic placement of the nodes was the key to a more efficient attack.

APA, Harvard, Vancouver, ISO, and other styles

4

Van, Heerden Renier Pelser. "A formalised ontology for network attack classification." Thesis, Rhodes University, 2014. http://hdl.handle.net/10962/d1011603.

Full text

Abstract:

One of the most popular attack vectors against computers are their network connections. Attacks on computers through their networks are commonplace and have various levels of complexity. This research formally describes network-based computer attacks in the form of a story, formally and within an ontology. The ontology categorises network attacks where attack scenarios are the focal class. This class consists of: Denial-of- Service, Industrial Espionage, Web Defacement, Unauthorised Data Access, Financial Theft, Industrial Sabotage, Cyber-Warfare, Resource Theft, System Compromise, and Runaway Malware. This ontology was developed by building a taxonomy and a temporal network attack model. Network attack instances (also know as individuals) are classified according to their respective attack scenarios, with the use of an automated reasoner within the ontology. The automated reasoner deductions are verified formally; and via the automated reasoner, a relaxed set of scenarios is determined, which is relevant in a near real-time environment. A prototype system (called Aeneas) was developed to classify network-based attacks. Aeneas integrates the sensors into a detection system that can classify network attacks in a near real-time environment. To verify the ontology and the prototype Aeneas, a virtual test bed was developed in which network-based attacks were generated to verify the detection system. Aeneas was able to detect incoming attacks and classify them according to their scenario. The novel part of this research is the attack scenarios that are described in the form of a story, as well as formally and in an ontology. The ontology is used in a novel way to determine to which class attack instances belong and how the network attack ontology is affected in a near real-time environment.

APA, Harvard, Vancouver, ISO, and other styles

5

Tan, Hailun Computer Science &amp Engineering Faculty of Engineering UNSW. "Secure network programming in wireless sensor networks." Awarded By:University of New South Wales. Computer Science & Engineering, 2010. http://handle.unsw.edu.au/1959.4/44835.

Full text

Abstract:

Network programming is one of the most important applications in Wireless Sensor Networks as It provides an efficient way to update program Images running on sensor nodes without physical access to them. Securing these updates, however, remains a challenging and important issue, given the open deployment environment of sensor nodes. Though several security schemes have been proposed to impose the authenticity and Integrity protection on network programming applications, they are either energy Inefficient as they tend to use digital signature or lacks the data confidentiality. In addition, due to the absence of secure memory management in the current sensor hardware, the attacker could inject malicious code into the program flash by exploiting buffer overflow In the memory despite the secure code dissemination. The contribution of this thesis Is to provide two software-based security protocols and one hardware-based remote attestation protocol for network programming application. Our first protocol deploys multiple one-way key chains for a multi-hop sensor network. The scheme Is shown to be lower In computational, power consumption and communication costs yet still able to secure multi??hop propagation of program images. Our second protocol utilizes an Iterative hash structure to the data packets in network programming application, ensuring the data confidentiality and authenticity. In addition, we Integrated confidentiality and DoS-attack-resistance in a multi??hop code dissemination protocol. Our final solution is a hardware-based remote attestation protocol for verification of running codes on sensor nodes. An additional piece of tamper-proof hardware, Trusted Platform Module (TPM), is imposed into the sensor nodes. It secures the sensitive information (e.g., the session key) from attackers and monitors any platform environment changes with the Internal registers. With these features of TPM, the code Injection attack could be detected and removed when the contaminated nodes are challenged in our remote attestation protocol. We implement the first two software-based protocols with Deluge as the reference network programming protocol in TinyOS, evaluate them with the extensive simulation using TOSSIM and validate the simulation results with experiments using Tmote. We implement the remote attestation protocol on Fleck, a sensor platform developed by CSIRO that Integrates an Atmel TPM chip.

APA, Harvard, Vancouver, ISO, and other styles

6

Hamid, Thaier K. A. "Attack graph approach to dynamic network vulnerability analysis and countermeasures." Thesis, University of Bedfordshire, 2014. http://hdl.handle.net/10547/576432.

Full text

Abstract:

It is widely accepted that modern computer networks (often presented as a heterogeneous collection of functioning organisations, applications, software, and hardware) contain vulnerabilities. This research proposes a new methodology to compute a dynamic severity cost for each state. Here a state refers to the behaviour of a system during an attack; an example of a state is where an attacker could influence the information on an application to alter the credentials. This is performed by utilising a modified variant of the Common Vulnerability Scoring System (CVSS), referred to as a Dynamic Vulnerability Scoring System (DVSS). This calculates scores of intrinsic, time-based, and ecological metrics by combining related sub-scores and modelling the problem’s parameters into a mathematical framework to develop a unique severity cost. The individual static nature of CVSS affects the scoring value, so the author has adapted a novel model to produce a DVSS metric that is more precise and efficient. In this approach, different parameters are used to compute the final scores determined from a number of parameters including network architecture, device setting, and the impact of vulnerability interactions. An attack graph (AG) is a security model representing the chains of vulnerability exploits in a network. A number of researchers have acknowledged the attack graph visual complexity and a lack of in-depth understanding. Current attack graph tools are constrained to only limited attributes or even rely on hand-generated input. The automatic formation of vulnerability information has been troublesome and vulnerability descriptions are frequently created by hand, or based on limited data. The network architectures and configurations along with the interactions between the individual vulnerabilities are considered in the method of computing the Cost using the DVSS and a dynamic cost-centric framework. A new methodology was built up to present an attack graph with a dynamic cost metric based on DVSS and also a novel methodology to estimate and represent the cost-centric approach for each host’ states was followed out. A framework is carried out on a test network, using the Nessus scanner to detect known vulnerabilities, implement these results and to build and represent the dynamic cost centric attack graph using ranking algorithms (in a standardised fashion to Mehta et al. 2006 and Kijsanayothin, 2010). However, instead of using vulnerabilities for each host, a CostRank Markov Model has developed utilising a novel cost-centric approach, thereby reducing the complexity in the attack graph and reducing the problem of visibility. An analogous parallel algorithm is developed to implement CostRank. The reason for developing a parallel CostRank Algorithm is to expedite the states ranking calculations for the increasing number of hosts and/or vulnerabilities. In the same way, the author intends to secure large scale networks that require fast and reliable computing to calculate the ranking of enormous graphs with thousands of vertices (states) and millions of arcs (representing an action to move from one state to another). In this proposed approach, the focus on a parallel CostRank computational architecture to appraise the enhancement in CostRank calculations and scalability of of the algorithm. In particular, a partitioning of input data, graph files and ranking vectors with a load balancing technique can enhance the performance and scalability of CostRank computations in parallel. A practical model of analogous CostRank parallel calculation is undertaken, resulting in a substantial decrease in calculations communication levels and in iteration time. The results are presented in an analytical approach in terms of scalability, efficiency, memory usage, speed up and input/output rates. Finally, a countermeasures model is developed to protect against network attacks by using a Dynamic Countermeasures Attack Tree (DCAT). The following scheme is used to build DCAT tree (i) using scalable parallel CostRank Algorithm to determine the critical asset, that system administrators need to protect; (ii) Track the Nessus scanner to determine the vulnerabilities associated with the asset using the dynamic cost centric framework and DVSS; (iii) Check out all published mitigations for all vulnerabilities. (iv) Assess how well the security solution mitigates those risks; (v) Assess DCAT algorithm in terms of effective security cost, probability and cost/benefit analysis to reduce the total impact of a specific vulnerability.

APA, Harvard, Vancouver, ISO, and other styles

7

Schuhart, Russell G. "Hacking social networks examining the viability of using computer network attack against social networks." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FSchuhart.pdf.

Full text

Abstract:

Thesis (M.S. in Information Systems and Operations)--Naval Postgraduate School, March 2007.<br>Thesis Advisor(s): David Tucker. "March 2007." Includes bibliographical references (p. 55-56). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

8

Klaus, Christian. "Network design for reliability and resilience to attack." Thesis, Monterey, California: Naval Postgraduate School, 2014. http://hdl.handle.net/10945/41406.

Full text

Abstract:

Approved for public release; distribution is unlimited.<br>We define and solve two network-design problems. In the first, (1) a defender uses limited resources to select a portfolio of paths or design a sub-network; (2) an attacker then uses limited attack resources to destroy network arcs, and then (3) the defender operates the damaged network optimally by ending a shortest path. The solution identifies a network design that minimizes post-attack path length. We show how the tri-level problem is equivalent to a single-level mixed integer program (MIP) with an exponential number of rows and columns, and solve that MIP using simultaneous row and column generation. Methods extend to network operations denied through general now constructs. The second problem considers a stochastic logistics network where arcs are present randomly and independently. Shipping from a source to a destination may be delayed until a path connecting the two is available. In the presence of storage capacity, cargo can be shipped partway. The problem's solution identifies the storage locations that minimize the cargo's waiting time for shipment. We develop and demonstrate practical methods to solve this #P-complete problem on a model instance derived from a Department of Defense humanitarian shipping network.

APA, Harvard, Vancouver, ISO, and other styles

9

Mohammadnia, Hamzeh. "IoT-NETZ: Spoong Attack Mitigation in IoT Network." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-260250.

Full text

Abstract:

The phenomenal growth of the Internet of Things (IoT) and popularity of the mobile stations have rapidly increased the demand of WLAN network (known as IEEE 802.11 and WiFi). WLAN is a low-cost alternative of the cellular network and being an unlicensed spectrum to build the master plan of embedding the Internet in everything -&-anywhere. At the same time, monitoring the number of IoT and WiFi-enabled devices across residential and enterprises is not trivial. Therefore, future WiFi network architecture requires an agile management paradigm to provide internal support and security for WiFi networks.The operation of IoT and mobile device applications relies on scalability and high-performance computing of clouds. Cloud computing has completely centralized the current data center networking architecture and it provides computation-intensive, high-speed network, and realtime responses to the requests of IoT. The IoT-to-cloud communication is the essence of network security concerns and it is in grievous need of constant security improvement along the inter-networking. Based on the number of researches and analysis on generated traffic by IoT, it has been observed there are the significant number of massive spoofing-oriented attacks targeting cloud services are launched from compromised IoT.On the basis of reviewing prior researches on mostly-conducted network attacks by IoT, there is a challenging and common characteristic which has been frequently utilized in the numerous massive Internet attacks, known as spoofing. This work will survey the existing proposed solutions which have been deployed to protect both traditional and softwarized network paradigms. Then, it proposes the approach of this work that enables IoT-hosting networks protected by employing Software-defined Wireless Networking (SDWN) within the proposed model to mitigate spoofing -oriented network attacks. In addition, the proposed solution provides the environmental sustainability feature by saving power consumption in networking devices during network operation. The practical improvement in the proposed model is measured and evaluated within the emulated environment of Mininet-WiFi.<br>Den fenomenala tillväxten av IoT och populariteten hos mobilstationerna har snabbt ökat efterfrågan på WLAN-nätverk (känd som IEEE 802.11 och WiFi). WLAN är ett billigt alternativ för mobilnätet och är ett olicensierat spektrum för att bygga huvudplanen för att bädda in Internet i allt-och-var som helst. Samtidigt är det inte trivialt att övervaka antalet IoT och WiFi-aktiverade enheter över bostäder och företag. Därför kräver framtida WiFi nätverksarkitektur ett smidigt hantering paradigm för att tillhandahålla internt stöd och säkerhet för WiFi-nätverk.Användningen av IoT och mobilanvändningsapplikationer är beroende av skalbarhet och högpresterande beräkningar av moln. Cloud computing har helt centraliserat den nuvarande datacenters nätverksarkitektur och det ger beräkningsintensiva, höghastighetsnätverk och realtidssvar påbegäran från IoT. IoT-till-moln kommunikationen är kärnan i nätverkssäkerhetshänsyn och de har ett allvarligt behov av ständig förbättring och säkerhetshärdning inom deras internätverk. Baserat på antalet undersökningar och analyser av genererad trafik av IoT har det observerats. Det finns det betydande antalet massiva spoofing-orienterade attacker som riktar sig mot molntjänster, lanseras från komprometterad IoT.På grundval av att granska tidigare undersökningar om IoTs mest genomförda nätverksattacker finns det en utmanande och gemensam egenskap som ofta utnyttjats i de många massiva internetattackerna. Detta arbete kommer att undersöka de befintliga lösningarna som har implementerats för att skydda både traditionella och mjukvariga nätverksparadigmer. Därefter föreslår det tillvägagångssättet för detta arbete som möjliggör IoT-värdnät skyddade genom att använda SDWN inom den föreslagna modellen för att mildra poofing-orienterade nätverksattacker. Dessutom erbjuder den föreslagna lösningen miljöhållbarhet genom att spara strömförbrukning i nätverksenheter under nätverksdrift. Den praktiska förbättringen av den föreslagna modellen mäts och utvärderas inom den omgivande miljön av Mininet-WiFi.

APA, Harvard, Vancouver, ISO, and other styles

10

Kenar, Serkan. "An Extensible Framework For Automated Network Attack Signature Generation." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611418/index.pdf.

Full text

Abstract:

The effectiveness of misuse-based intrusion detection systems (IDS) are seriously broken, with the advance of threats in terms of speed and scale. Today worms, trojans, viruses and other threats can spread all around the globe in less than thirty minutes. In order to detect these emerging threats, signatures must be generated automatically and distributed to intrusion detection systems rapidly. There are studies on automatically generating signatures for worms and attacks. However, either these systems rely on Honeypots which are supposed to receive only suspicious traffic, or use port-scanning outlier detectors. In this study, an open, extensible system based on an network IDS is proposed to identify suspicious traffic using anomaly detection methods, and to automatically generate signatures of attacks out of this suspicious traffic. The generated signatures are classified and fedback into the IDS either locally or distributed. Design and proof-of-concept implementation are described and developed system is tested on both synthetic and real network data. The system is designed as a framework to test different methods and evaluate the outcomes of varying configurations easily. The test results show that, with a properly defined attack detection algorithm, attack signatures could be generated with high accuracy and efficiency. The resulting system could be used to prevent early damages of fast-spreading worms and other threats.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Network attack"

1

College), Symposium on Computer Network Attack and International Law (1999 Naval War. Computer network attack and international law. Naval War College, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Harrison, R. F. Neur al networks,heart attack and bayesian decisions: An application oof the Boltzmann perceptron network. University of Sheffield, Dept. of Automatic Control & Systems Engineering, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Karppinen, Kaarina. Security measurement based on attack trees in a mobile ad hoc network environment. VTT Technical Research Centre of Finland, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Prowell, Stacy J. Seven deadliest network attacks. Syngress, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Monte, Matthew. Network Attacks & Exploitation. John Wiley & Sons, Inc, 2015. http://dx.doi.org/10.1002/9781119183440.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rob, Kraus, and Borkin Mike, eds. Seven deadliest network attacks. Syngress, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Network security attacks and countermeasures. Information Science Reference, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Perez, Richard, 1969 Oct. 17- and Ely Adam, eds. Seven deadliest social network attacks. Syngress, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhou, Qing. Network Robustness under Large-Scale Attacks. Springer New York, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhou, Qing, Long Gao, Ruifang Liu, and Shuguang Cui. Network Robustness under Large-Scale Attacks. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-4860-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Network attack"

1

Wang, Lingyu, Massimiliano Albanese, and Sushil Jajodia. "Attack Graph and Network Hardening." In Network Hardening. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04612-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mendel, Florian, Tomislav Nad, and Martin Schläffer. "Collision Attack on Boole." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01957-9_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Qing, and Lin Huang. "Mobile Network Security." In Inside Radio: An Attack and Defense Guide. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8447-8_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Theodoros, Tzouramanis, and Karampelas Loukas. "Online Social Network Phishing Attack." In Encyclopedia of Social Network Analysis and Mining. Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4614-6170-8_348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Theodoros, Tzouramanis, and Karampelas Loukas. "Online Social Network Phishing Attack." In Encyclopedia of Social Network Analysis and Mining. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4939-7131-2_348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Theodoros, Tzouramanis, and Karampelas Loukas. "Online Social Network Phishing Attack." In Encyclopedia of Social Network Analysis and Mining. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4614-7163-9_348-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lee, Heejo, and Jong Kim. "Attack Resiliency of Network Topologies." In Parallel and Distributed Computing: Applications and Technologies. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30501-9_123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Yu, Hongbo, Gaoli Wang, Guoyan Zhang, and Xiaoyun Wang. "The Second-Preimage Attack on MD4." In Cryptology and Network Security. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11599371_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Todo, Yosuke, and Kazumaro Aoki. "FFT Key Recovery for Integral Attack." In Cryptology and Network Security. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12280-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yang, Lin, Meiqin Wang, and Siyuan Qiao. "Side Channel Cube Attack on PRESENT." In Cryptology and Network Security. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10433-6_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Network attack"

1

Alzubi, Saif, Frederic T. Stahl, and Mohamed M. Gaber. "Towards Intrusion Detection Of Previously Unknown Network Attacks." In 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0035.

Full text

Abstract:

Advances in telecommunication network technologies have led to an ever more interconnected world. Accordingly, the types of threats and attacks to intrude or disable such networks or portions of it are continuing to develop likewise. Thus, there is a need to detect previously unknown attack types. Supervised techniques are not suitable to detect previously not encountered attack types. This paper presents a new ensemble-based Unknown Network Attack Detector (UNAD) system. UNAD proposes a training workflow composed of heterogeneous and unsupervised anomaly detection techniques, trains on attack-free data and can distinguish normal network flow from (previously unknown) attacks. This scenario is more realistic for detecting previously unknown attacks than supervised approaches and is evaluated on telecommunication network data with known ground truth. Empirical results reveal that UNAD can detect attacks on which the workflows have not been trained on with a precision of 75% and a recall of 80%. The benefit of UNAD with existing network attack detectors is, that it can detect completely new attack types that have never been encountered before.

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Yu, Shahin Jabbari, Michael Kearns, Sanjeev Khanna, and Jamie Morgenstern. "Network Formation under Random Attack and Probabilistic Spread." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/26.

Full text

Abstract:

We study a network formation game where agents receive benefits by forming connections to other agents but also incur both direct and indirect costs from the formed connections. Specifically, once the agents have purchased their connections, an attack starts at a randomly chosen vertex in the network and spreads according to the independent cascade model with a fixed probability, destroying any infected agents. The utility or welfare of an agent in our game is defined to be the expected size of the agent's connected component post-attack minus her expenditure in forming connections. Our goal is to understand the properties of the equilibrium networks formed in this game. Our first result concerns the edge density of equilibrium networks. A network connection increases both the likelihood of remaining connected to other agents after an attack as well the likelihood of getting infected by a cascading spread of infection. We show that the latter concern primarily prevails and any equilibrium network in our game contains only $O(n\log n)$ edges where $n$ denotes the number of agents. On the other hand, there are equilibrium networks that contain $\Omega(n)$ edges showing that our edge density bound is tight up to a logarithmic factor. Our second result shows that the presence of attack and its spread through a cascade does not significantly lower social welfare as long as the network is not too dense. We show that any non-trivial equilibrium network with $O(n)$ edges has $\Theta(n^2)$ social welfare, asymptotically similar to the social welfare guarantee in the game without any attacks.

APA, Harvard, Vancouver, ISO, and other styles

3

Ingols, Kyle, Matthew Chu, Richard Lippmann, Seth Webster, and Stephen Boyer. "Modeling Modern Network Attacks and Countermeasures Using Attack Graphs." In 2009 Annual Computer Security Applications Conference (ACSAC). IEEE, 2009. http://dx.doi.org/10.1109/acsac.2009.21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lei, Jie, and Zhi-tang Li. "Using Network Attack Graph to Predict the Future Attacks." In 2007 Second International Conference on Communications and Networking in China. IEEE, 2007. http://dx.doi.org/10.1109/chinacom.2007.4469413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Man, and Jinjing Cao. "Network Attack Defense Awareness." In Next Generation Computer and Information Technology 2015. Science & Engineering Research Support soCiety, 2015. http://dx.doi.org/10.14257/astl.2015.111.34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Weifeng, Xinyu Zhang, Likai Dong, Yuling Fan, Xinyi Diao, and Tao Xu. "Network Attack Detection based on Domain Attack Behavior Analysis." In 2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI). IEEE, 2020. http://dx.doi.org/10.1109/cisp-bmei51763.2020.9263663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Roy, Sangita, and Ashok Singh Sairam. "Network Attack Detection and Mitigation." In 2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW). IEEE, 2015. http://dx.doi.org/10.1109/sasow.2015.33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Marechal, Emeline, and Benoit Donnet. "Network Fingerprinting: Routers under Attack." In 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW). IEEE, 2020. http://dx.doi.org/10.1109/eurospw51379.2020.00086.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vykopal, Jan, Tomas Plesnik, and Pavel Minarik. "Network-Based Dictionary Attack Detection." In 2009 International Conference on Future Networks, ICFN. IEEE, 2009. http://dx.doi.org/10.1109/icfn.2009.36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Toth, Rudolf, Zoltan Faigl, Mate Szalay, and Sandor Imre. "An Advanced Timing Attack Scheme on RSA." In 2008 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2008. http://dx.doi.org/10.1109/netwks.2008.4763727.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Network attack"

1

May, Jack, and James Petersen. Network Attack Program. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada387940.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lenderman, Curtis C. Computer Network Attack: An Operational Tool? Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada415427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Busby, Daniel J. Peacetime Use of Computer Network Attack. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada377624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Salowey, J., and S. Hanna. The Network Endpoint Assessment (NEA) Asokan Attack Analysis. RFC Editor, 2012. http://dx.doi.org/10.17487/rfc6813.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kahn, Russell L. Attack Analyzer: A Network Analysis and Visualization Tool. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada464353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

FU, Fabian. End-to-End and Network-wide Attack Defense Solution -Overhaul Carrier Network Security. River Publishers, 2016. http://dx.doi.org/10.13052/popcas006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Williamson, Jennie M. Information Operations: Computer Network Attack in the 21st Century. Defense Technical Information Center, 2002. http://dx.doi.org/10.21236/ada402018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hanson, Kraig. Organization of DoD Computer Network Defense, Exploitation, and Attack Forces. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada500822.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Presby, Timothy D. Computer Network Attack and Its Effectiveness against Non-State Actors. Defense Technical Information Center, 2006. http://dx.doi.org/10.21236/ada463692.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Younes, Paul R. Follow the Money: Using Computer Network Attack to Enforce Economic Sanctions. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada390083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!